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-circular-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 18:08:11,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 18:08:11,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 18:08:11,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 18:08:11,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 18:08:11,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 18:08:11,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 18:08:11,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 18:08:11,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 18:08:11,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 18:08:11,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 18:08:11,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 18:08:11,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 18:08:11,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 18:08:11,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 18:08:11,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 18:08:11,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 18:08:11,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 18:08:11,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 18:08:11,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 18:08:11,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 18:08:11,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 18:08:11,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 18:08:11,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 18:08:11,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 18:08:11,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 18:08:11,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 18:08:11,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 18:08:11,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 18:08:11,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 18:08:11,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 18:08:11,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 18:08:11,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 18:08:11,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 18:08:11,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 18:08:11,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 18:08:11,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 18:08:11,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 18:08:11,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 18:08:11,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 18:08:11,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 18:08:11,529 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-13 18:08:11,543 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 18:08:11,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 18:08:11,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 18:08:11,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 18:08:11,545 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 18:08:11,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 18:08:11,546 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 18:08:11,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 18:08:11,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 18:08:11,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 18:08:11,546 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 18:08:11,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 18:08:11,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 18:08:11,547 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 18:08:11,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 18:08:11,547 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 18:08:11,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 18:08:11,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 18:08:11,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 18:08:11,548 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 18:08:11,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 18:08:11,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 18:08:11,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 18:08:11,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 18:08:11,549 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 18:08:11,549 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 18:08:11,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 18:08:11,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 18:08:11,550 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 18:08:11,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 18:08:11,830 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 18:08:11,834 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 18:08:11,835 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 18:08:11,836 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 18:08:11,836 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-circular-1.i [2019-10-13 18:08:11,912 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fe2548fa/b24e21d07ada48e8afda7d79f505c4b9/FLAG9808b619a [2019-10-13 18:08:12,476 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 18:08:12,479 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-circular-1.i [2019-10-13 18:08:12,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fe2548fa/b24e21d07ada48e8afda7d79f505c4b9/FLAG9808b619a [2019-10-13 18:08:12,740 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fe2548fa/b24e21d07ada48e8afda7d79f505c4b9 [2019-10-13 18:08:12,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 18:08:12,752 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 18:08:12,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 18:08:12,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 18:08:12,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 18:08:12,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:08:12" (1/1) ... [2019-10-13 18:08:12,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26497d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:12, skipping insertion in model container [2019-10-13 18:08:12,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:08:12" (1/1) ... [2019-10-13 18:08:12,772 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 18:08:12,828 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 18:08:13,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 18:08:13,273 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 18:08:13,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 18:08:13,389 INFO L192 MainTranslator]: Completed translation [2019-10-13 18:08:13,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:13 WrapperNode [2019-10-13 18:08:13,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 18:08:13,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 18:08:13,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 18:08:13,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 18:08:13,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:13" (1/1) ... [2019-10-13 18:08:13,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:13" (1/1) ... [2019-10-13 18:08:13,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:13" (1/1) ... [2019-10-13 18:08:13,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:13" (1/1) ... [2019-10-13 18:08:13,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:13" (1/1) ... [2019-10-13 18:08:13,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:13" (1/1) ... [2019-10-13 18:08:13,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:13" (1/1) ... [2019-10-13 18:08:13,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 18:08:13,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 18:08:13,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 18:08:13,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 18:08:13,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:13" (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-13 18:08:13,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 18:08:13,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 18:08:13,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 18:08:13,528 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 18:08:13,528 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 18:08:13,528 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 18:08:13,528 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 18:08:13,528 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 18:08:13,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 18:08:13,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 18:08:13,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 18:08:13,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 18:08:13,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 18:08:13,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 18:08:13,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 18:08:13,530 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 18:08:13,530 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 18:08:13,530 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 18:08:13,530 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 18:08:13,530 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 18:08:13,531 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 18:08:13,531 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 18:08:13,531 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 18:08:13,531 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 18:08:13,531 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 18:08:13,531 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 18:08:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 18:08:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 18:08:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 18:08:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 18:08:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 18:08:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 18:08:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 18:08:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 18:08:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 18:08:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 18:08:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 18:08:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 18:08:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 18:08:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 18:08:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 18:08:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 18:08:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 18:08:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 18:08:13,535 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 18:08:13,535 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 18:08:13,535 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 18:08:13,535 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 18:08:13,535 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 18:08:13,535 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 18:08:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 18:08:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 18:08:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 18:08:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 18:08:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 18:08:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 18:08:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 18:08:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 18:08:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 18:08:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 18:08:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 18:08:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 18:08:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 18:08:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 18:08:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 18:08:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 18:08:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 18:08:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 18:08:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 18:08:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 18:08:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 18:08:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 18:08:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 18:08:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 18:08:13,540 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 18:08:13,540 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 18:08:13,540 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 18:08:13,540 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 18:08:13,540 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 18:08:13,540 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 18:08:13,541 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 18:08:13,541 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 18:08:13,541 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 18:08:13,541 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 18:08:13,541 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 18:08:13,541 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 18:08:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 18:08:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 18:08:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 18:08:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 18:08:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 18:08:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 18:08:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 18:08:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 18:08:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 18:08:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 18:08:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 18:08:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 18:08:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 18:08:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 18:08:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 18:08:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 18:08:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 18:08:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 18:08:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 18:08:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 18:08:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 18:08:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 18:08:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 18:08:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 18:08:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 18:08:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 18:08:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 18:08:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 18:08:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 18:08:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 18:08:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 18:08:14,133 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 18:08:14,133 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-13 18:08:14,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:08:14 BoogieIcfgContainer [2019-10-13 18:08:14,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 18:08:14,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 18:08:14,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 18:08:14,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 18:08:14,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:08:12" (1/3) ... [2019-10-13 18:08:14,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5977d9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:08:14, skipping insertion in model container [2019-10-13 18:08:14,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:13" (2/3) ... [2019-10-13 18:08:14,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5977d9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:08:14, skipping insertion in model container [2019-10-13 18:08:14,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:08:14" (3/3) ... [2019-10-13 18:08:14,144 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2019-10-13 18:08:14,153 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 18:08:14,161 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-13 18:08:14,172 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-13 18:08:14,197 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 18:08:14,197 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 18:08:14,197 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 18:08:14,198 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 18:08:14,198 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 18:08:14,198 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 18:08:14,198 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 18:08:14,199 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 18:08:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-13 18:08:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 18:08:14,222 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:14,223 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:14,225 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:14,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:14,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1483997276, now seen corresponding path program 1 times [2019-10-13 18:08:14,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:14,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682629122] [2019-10-13 18:08:14,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:14,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:14,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:14,435 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-13 18:08:14,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682629122] [2019-10-13 18:08:14,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:14,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 18:08:14,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39535669] [2019-10-13 18:08:14,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 18:08:14,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:14,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 18:08:14,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 18:08:14,463 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-10-13 18:08:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:14,575 INFO L93 Difference]: Finished difference Result 70 states and 106 transitions. [2019-10-13 18:08:14,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 18:08:14,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-13 18:08:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:14,587 INFO L225 Difference]: With dead ends: 70 [2019-10-13 18:08:14,588 INFO L226 Difference]: Without dead ends: 30 [2019-10-13 18:08:14,591 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-13 18:08:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-13 18:08:14,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-13 18:08:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 18:08:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-10-13 18:08:14,631 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2019-10-13 18:08:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:14,632 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-10-13 18:08:14,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 18:08:14,632 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-10-13 18:08:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 18:08:14,633 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:14,633 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:14,634 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:14,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:14,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1199756337, now seen corresponding path program 1 times [2019-10-13 18:08:14,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:14,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416759562] [2019-10-13 18:08:14,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:14,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:14,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:14,814 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-13 18:08:14,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416759562] [2019-10-13 18:08:14,815 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:14,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 18:08:14,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739327635] [2019-10-13 18:08:14,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 18:08:14,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:14,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 18:08:14,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 18:08:14,819 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2019-10-13 18:08:14,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:14,963 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-10-13 18:08:14,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 18:08:14,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-13 18:08:14,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:14,965 INFO L225 Difference]: With dead ends: 46 [2019-10-13 18:08:14,965 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 18:08:14,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 18:08:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 18:08:14,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-10-13 18:08:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 18:08:14,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-10-13 18:08:14,974 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2019-10-13 18:08:14,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:14,974 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-13 18:08:14,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 18:08:14,974 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-10-13 18:08:14,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 18:08:14,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:14,975 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:14,976 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:14,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:14,976 INFO L82 PathProgramCache]: Analyzing trace with hash -97127833, now seen corresponding path program 1 times [2019-10-13 18:08:14,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:14,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882678323] [2019-10-13 18:08:14,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:14,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:14,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:15,067 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-13 18:08:15,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882678323] [2019-10-13 18:08:15,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:15,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 18:08:15,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964006667] [2019-10-13 18:08:15,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 18:08:15,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:15,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 18:08:15,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 18:08:15,070 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 4 states. [2019-10-13 18:08:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:15,154 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-10-13 18:08:15,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 18:08:15,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-13 18:08:15,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:15,158 INFO L225 Difference]: With dead ends: 75 [2019-10-13 18:08:15,158 INFO L226 Difference]: Without dead ends: 53 [2019-10-13 18:08:15,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 18:08:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-13 18:08:15,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2019-10-13 18:08:15,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 18:08:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-10-13 18:08:15,169 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 14 [2019-10-13 18:08:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:15,169 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-10-13 18:08:15,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 18:08:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-10-13 18:08:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 18:08:15,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:15,171 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:15,171 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:15,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:15,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2075944349, now seen corresponding path program 1 times [2019-10-13 18:08:15,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:15,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90530503] [2019-10-13 18:08:15,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:15,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:15,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:15,224 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-13 18:08:15,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90530503] [2019-10-13 18:08:15,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:15,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 18:08:15,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547511141] [2019-10-13 18:08:15,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 18:08:15,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:15,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 18:08:15,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 18:08:15,227 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 4 states. [2019-10-13 18:08:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:15,289 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-10-13 18:08:15,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 18:08:15,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-13 18:08:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:15,290 INFO L225 Difference]: With dead ends: 42 [2019-10-13 18:08:15,290 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 18:08:15,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 18:08:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 18:08:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-13 18:08:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-13 18:08:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-10-13 18:08:15,298 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2019-10-13 18:08:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:15,298 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-10-13 18:08:15,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 18:08:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-10-13 18:08:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 18:08:15,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:15,300 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:15,300 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:15,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:15,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2075946271, now seen corresponding path program 1 times [2019-10-13 18:08:15,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:15,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010114828] [2019-10-13 18:08:15,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:15,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:15,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:15,596 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-13 18:08:15,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010114828] [2019-10-13 18:08:15,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:15,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 18:08:15,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561978980] [2019-10-13 18:08:15,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 18:08:15,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:15,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 18:08:15,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 18:08:15,598 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2019-10-13 18:08:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:15,810 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-10-13 18:08:15,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 18:08:15,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-13 18:08:15,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:15,812 INFO L225 Difference]: With dead ends: 51 [2019-10-13 18:08:15,812 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 18:08:15,815 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-13 18:08:15,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 18:08:15,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-13 18:08:15,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 18:08:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-10-13 18:08:15,825 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 17 [2019-10-13 18:08:15,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:15,825 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-10-13 18:08:15,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 18:08:15,826 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-10-13 18:08:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 18:08:15,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:15,827 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:15,827 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:15,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:15,827 INFO L82 PathProgramCache]: Analyzing trace with hash -351040154, now seen corresponding path program 1 times [2019-10-13 18:08:15,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:15,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519131937] [2019-10-13 18:08:15,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:15,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:15,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:15,908 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-13 18:08:15,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519131937] [2019-10-13 18:08:15,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891630033] [2019-10-13 18:08:15,909 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-13 18:08:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:16,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-13 18:08:16,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:16,100 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-13 18:08:16,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:16,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:16,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:16,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-13 18:08:16,139 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:16,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 18:08:16,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:16,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:16,156 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:16,156 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:16,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:16,164 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-13 18:08:16,164 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-10-13 18:08:16,194 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 18:08:16,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:16,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:16,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:16,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:16,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-10-13 18:08:16,218 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[|v_#memory_$Pointer$.base_20|]} [2019-10-13 18:08:16,237 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-13 18:08:16,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:16,273 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:16,274 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 68 treesize of output 55 [2019-10-13 18:08:16,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:16,284 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:16,299 INFO L567 ElimStorePlain]: treesize reduction 23, result has 28.1 percent of original size [2019-10-13 18:08:16,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:16,300 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:4 [2019-10-13 18:08:16,304 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-13 18:08:16,307 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:16,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-13 18:08:16,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589255436] [2019-10-13 18:08:16,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 18:08:16,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:16,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 18:08:16,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 18:08:16,309 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2019-10-13 18:08:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:16,466 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-10-13 18:08:16,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 18:08:16,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-10-13 18:08:16,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:16,468 INFO L225 Difference]: With dead ends: 65 [2019-10-13 18:08:16,468 INFO L226 Difference]: Without dead ends: 63 [2019-10-13 18:08:16,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 18:08:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-13 18:08:16,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2019-10-13 18:08:16,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 18:08:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2019-10-13 18:08:16,481 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 17 [2019-10-13 18:08:16,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:16,482 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-10-13 18:08:16,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 18:08:16,482 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2019-10-13 18:08:16,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 18:08:16,483 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:16,483 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:16,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:16,685 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:16,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:16,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2111834143, now seen corresponding path program 1 times [2019-10-13 18:08:16,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:16,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366589352] [2019-10-13 18:08:16,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:16,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:16,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:16,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366589352] [2019-10-13 18:08:16,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:16,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 18:08:16,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308609993] [2019-10-13 18:08:16,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 18:08:16,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:16,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 18:08:16,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 18:08:16,739 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 4 states. [2019-10-13 18:08:16,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:16,843 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2019-10-13 18:08:16,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 18:08:16,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-13 18:08:16,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:16,845 INFO L225 Difference]: With dead ends: 100 [2019-10-13 18:08:16,845 INFO L226 Difference]: Without dead ends: 77 [2019-10-13 18:08:16,846 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 18:08:16,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-13 18:08:16,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2019-10-13 18:08:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 18:08:16,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2019-10-13 18:08:16,859 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 21 [2019-10-13 18:08:16,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:16,859 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2019-10-13 18:08:16,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 18:08:16,859 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2019-10-13 18:08:16,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 18:08:16,863 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:16,863 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, 1] [2019-10-13 18:08:16,863 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:16,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:16,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2016892268, now seen corresponding path program 1 times [2019-10-13 18:08:16,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:16,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426623182] [2019-10-13 18:08:16,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:16,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:16,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:17,250 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-13 18:08:17,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426623182] [2019-10-13 18:08:17,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629556083] [2019-10-13 18:08:17,251 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-13 18:08:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:17,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-13 18:08:17,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:17,362 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-13 18:08:17,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,378 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-13 18:08:17,379 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,389 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-13 18:08:17,389 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2019-10-13 18:08:17,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,454 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-13 18:08:17,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,494 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_21|], 2=[|v_#memory_int_20|, |v_#memory_int_21|]} [2019-10-13 18:08:17,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:17,503 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:17,537 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,567 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-13 18:08:17,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:17,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 20 [2019-10-13 18:08:17,618 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,643 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-13 18:08:17,644 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:107, output treesize:45 [2019-10-13 18:08:17,681 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_22|], 6=[|v_#memory_$Pointer$.offset_19|, |v_#memory_$Pointer$.base_22|]} [2019-10-13 18:08:17,693 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 23 treesize of output 22 [2019-10-13 18:08:17,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:17,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:17,728 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:17,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:17,761 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,787 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:96, output treesize:54 [2019-10-13 18:08:17,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:17,880 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,880 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 2 case distinctions, treesize of input 156 treesize of output 179 [2019-10-13 18:08:17,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:17,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,950 INFO L567 ElimStorePlain]: treesize reduction 76, result has 65.9 percent of original size [2019-10-13 18:08:17,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2019-10-13 18:08:17,957 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,999 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,999 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 1 case distinctions, treesize of input 77 treesize of output 95 [2019-10-13 18:08:18,001 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:18,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:18,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:18,017 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:186, output treesize:61 [2019-10-13 18:08:18,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:18,077 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:08:18,077 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:08:18,078 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:08:18,079 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 56 [2019-10-13 18:08:18,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:18,085 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:08:18,086 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:08:18,087 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 1 [2019-10-13 18:08:18,087 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:18,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:18,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:18,102 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:161, output treesize:53 [2019-10-13 18:08:18,147 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-13 18:08:18,147 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:18,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-10-13 18:08:18,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102660192] [2019-10-13 18:08:18,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 18:08:18,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:18,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 18:08:18,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-13 18:08:18,149 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 13 states. [2019-10-13 18:08:18,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:18,677 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-10-13 18:08:18,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 18:08:18,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-10-13 18:08:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:18,680 INFO L225 Difference]: With dead ends: 86 [2019-10-13 18:08:18,680 INFO L226 Difference]: Without dead ends: 76 [2019-10-13 18:08:18,681 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-10-13 18:08:18,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-13 18:08:18,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-10-13 18:08:18,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-13 18:08:18,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2019-10-13 18:08:18,689 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 23 [2019-10-13 18:08:18,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:18,689 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2019-10-13 18:08:18,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 18:08:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2019-10-13 18:08:18,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 18:08:18,690 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:18,690 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:18,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:18,894 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:18,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:18,895 INFO L82 PathProgramCache]: Analyzing trace with hash -148911397, now seen corresponding path program 2 times [2019-10-13 18:08:18,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:18,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137630865] [2019-10-13 18:08:18,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:18,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:18,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:19,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137630865] [2019-10-13 18:08:19,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209538076] [2019-10-13 18:08:19,008 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-13 18:08:19,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 18:08:19,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 18:08:19,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-13 18:08:19,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:19,128 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-13 18:08:19,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:19,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:19,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:19,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-13 18:08:19,163 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:19,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 39 [2019-10-13 18:08:19,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:19,201 INFO L567 ElimStorePlain]: treesize reduction 14, result has 77.8 percent of original size [2019-10-13 18:08:19,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:19,211 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:19,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:19,232 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-13 18:08:19,232 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:36 [2019-10-13 18:08:19,269 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 18:08:19,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:19,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:19,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:19,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:19,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2019-10-13 18:08:19,309 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:19,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 30 [2019-10-13 18:08:19,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:19,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:19,405 INFO L341 Elim1Store]: treesize reduction 16, result has 78.7 percent of original size [2019-10-13 18:08:19,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 84 [2019-10-13 18:08:19,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:19,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,415 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:19,459 INFO L567 ElimStorePlain]: treesize reduction 124, result has 29.1 percent of original size [2019-10-13 18:08:19,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:19,460 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:50 [2019-10-13 18:08:19,535 INFO L341 Elim1Store]: treesize reduction 62, result has 37.4 percent of original size [2019-10-13 18:08:19,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 65 [2019-10-13 18:08:19,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:19,616 INFO L567 ElimStorePlain]: treesize reduction 34, result has 59.5 percent of original size [2019-10-13 18:08:19,616 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-13 18:08:19,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:50 [2019-10-13 18:08:19,629 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 12=[|v_#memory_$Pointer$.base_28|]} [2019-10-13 18:08:19,631 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-13 18:08:19,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:19,670 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:19,671 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 108 treesize of output 90 [2019-10-13 18:08:19,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,687 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-13 18:08:19,712 INFO L567 ElimStorePlain]: treesize reduction 35, result has 32.7 percent of original size [2019-10-13 18:08:19,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:19,713 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:94, output treesize:4 [2019-10-13 18:08:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:19,719 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:19,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-10-13 18:08:19,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850233464] [2019-10-13 18:08:19,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 18:08:19,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:19,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 18:08:19,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-13 18:08:19,720 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 9 states. [2019-10-13 18:08:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:20,057 INFO L93 Difference]: Finished difference Result 136 states and 164 transitions. [2019-10-13 18:08:20,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 18:08:20,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-10-13 18:08:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:20,059 INFO L225 Difference]: With dead ends: 136 [2019-10-13 18:08:20,059 INFO L226 Difference]: Without dead ends: 134 [2019-10-13 18:08:20,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-10-13 18:08:20,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-13 18:08:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 110. [2019-10-13 18:08:20,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-13 18:08:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2019-10-13 18:08:20,073 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 23 [2019-10-13 18:08:20,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:20,073 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2019-10-13 18:08:20,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 18:08:20,074 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2019-10-13 18:08:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 18:08:20,075 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:20,075 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:20,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:20,280 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:20,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:20,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1680620617, now seen corresponding path program 2 times [2019-10-13 18:08:20,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:20,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125144197] [2019-10-13 18:08:20,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:20,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:20,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:20,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125144197] [2019-10-13 18:08:20,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929065845] [2019-10-13 18:08:20,756 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 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-13 18:08:20,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 18:08:20,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 18:08:20,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-13 18:08:20,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:20,876 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-13 18:08:20,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:20,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:20,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:20,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-13 18:08:20,959 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:20,960 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-13 18:08:20,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:21,024 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-10-13 18:08:21,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:21,031 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:21,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:21,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:21,060 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:21,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:21,080 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-13 18:08:21,081 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-10-13 18:08:21,127 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_25|], 6=[|v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.base_30|]} [2019-10-13 18:08:21,134 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 13 treesize of output 9 [2019-10-13 18:08:21,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:21,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:21,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:21,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:21,175 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:21,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:21,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:21,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:21,209 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:21,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:21,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:21,232 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:100, output treesize:58 [2019-10-13 18:08:21,300 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:21,300 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-13 18:08:21,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:21,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:21,373 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_26|, |v_#memory_int_24|], 10=[|v_#memory_$Pointer$.offset_23|, |v_#memory_$Pointer$.base_31|]} [2019-10-13 18:08:21,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:21,387 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-13 18:08:21,388 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:21,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:21,435 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 33 treesize of output 21 [2019-10-13 18:08:21,436 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:21,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:21,484 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 0 case distinctions, treesize of input 157 treesize of output 102 [2019-10-13 18:08:21,485 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:21,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:21,555 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:21,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 124 [2019-10-13 18:08:21,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:21,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:21,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:21,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:21,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:21,565 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:21,672 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-10-13 18:08:21,672 INFO L567 ElimStorePlain]: treesize reduction 384, result has 18.1 percent of original size [2019-10-13 18:08:21,673 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-13 18:08:21,673 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:237, output treesize:84 [2019-10-13 18:08:21,719 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_27|], 12=[|v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.base_32|]} [2019-10-13 18:08:21,729 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 31 treesize of output 30 [2019-10-13 18:08:21,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:21,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:21,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:21,779 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:21,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 78 [2019-10-13 18:08:21,781 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:21,864 INFO L567 ElimStorePlain]: treesize reduction 36, result has 75.7 percent of original size [2019-10-13 18:08:21,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:21,925 INFO L341 Elim1Store]: treesize reduction 32, result has 61.0 percent of original size [2019-10-13 18:08:21,926 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 101 [2019-10-13 18:08:21,928 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:21,995 INFO L567 ElimStorePlain]: treesize reduction 58, result has 61.6 percent of original size [2019-10-13 18:08:21,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:21,996 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:135, output treesize:93 [2019-10-13 18:08:22,067 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_28|], 12=[|v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.base_33|]} [2019-10-13 18:08:22,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 54 [2019-10-13 18:08:22,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:22,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:22,188 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:22,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 311 treesize of output 350 [2019-10-13 18:08:22,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:22,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:22,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:22,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:22,480 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 46 [2019-10-13 18:08:22,481 INFO L567 ElimStorePlain]: treesize reduction 2686, result has 6.6 percent of original size [2019-10-13 18:08:22,552 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:22,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 233 [2019-10-13 18:08:22,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:22,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:22,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:22,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:22,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,592 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:22,694 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 37 [2019-10-13 18:08:22,694 INFO L567 ElimStorePlain]: treesize reduction 1945, result has 6.3 percent of original size [2019-10-13 18:08:22,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:22,695 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:388, output treesize:129 [2019-10-13 18:08:22,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:22,772 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:22,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-10-13 18:08:22,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643952190] [2019-10-13 18:08:22,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 18:08:22,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:22,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 18:08:22,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-13 18:08:22,774 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand 15 states. [2019-10-13 18:08:23,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:23,939 INFO L93 Difference]: Finished difference Result 172 states and 203 transitions. [2019-10-13 18:08:23,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 18:08:23,940 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-10-13 18:08:23,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:23,942 INFO L225 Difference]: With dead ends: 172 [2019-10-13 18:08:23,942 INFO L226 Difference]: Without dead ends: 170 [2019-10-13 18:08:23,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2019-10-13 18:08:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-13 18:08:23,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 122. [2019-10-13 18:08:23,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-13 18:08:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2019-10-13 18:08:23,955 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 29 [2019-10-13 18:08:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:23,955 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2019-10-13 18:08:23,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 18:08:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2019-10-13 18:08:23,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 18:08:23,957 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:23,957 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:24,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:24,166 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:24,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:24,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1307682849, now seen corresponding path program 1 times [2019-10-13 18:08:24,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:24,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869723924] [2019-10-13 18:08:24,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:24,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:24,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:24,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869723924] [2019-10-13 18:08:24,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106163920] [2019-10-13 18:08:24,308 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-13 18:08:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:24,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-13 18:08:24,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:24,441 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-13 18:08:24,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:24,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:24,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:24,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-13 18:08:24,504 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:24,504 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-13 18:08:24,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:24,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:24,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:24,538 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:24,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:24,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:24,565 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:24,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:24,580 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-13 18:08:24,581 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:71, output treesize:39 [2019-10-13 18:08:24,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:24,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:24,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:24,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:24,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:24,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:24,655 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:24,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:24,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:24,670 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2019-10-13 18:08:24,677 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_29|], 4=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_28|]} [2019-10-13 18:08:24,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-10-13 18:08:24,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:24,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:24,737 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:24,738 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 2 case distinctions, treesize of input 96 treesize of output 105 [2019-10-13 18:08:24,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:24,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:24,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:24,741 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-10-13 18:08:24,803 INFO L567 ElimStorePlain]: treesize reduction 242, result has 27.3 percent of original size [2019-10-13 18:08:24,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 55 [2019-10-13 18:08:24,814 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:24,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:24,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:24,830 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:125, output treesize:63 [2019-10-13 18:08:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:25,120 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:25,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-10-13 18:08:25,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923952302] [2019-10-13 18:08:25,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 18:08:25,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:25,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 18:08:25,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-13 18:08:25,122 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand 17 states. [2019-10-13 18:08:25,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:25,829 INFO L93 Difference]: Finished difference Result 150 states and 178 transitions. [2019-10-13 18:08:25,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 18:08:25,830 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-10-13 18:08:25,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:25,831 INFO L225 Difference]: With dead ends: 150 [2019-10-13 18:08:25,831 INFO L226 Difference]: Without dead ends: 116 [2019-10-13 18:08:25,832 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2019-10-13 18:08:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-13 18:08:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-10-13 18:08:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-13 18:08:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-10-13 18:08:25,852 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 30 [2019-10-13 18:08:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:25,853 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-10-13 18:08:25,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 18:08:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-10-13 18:08:25,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 18:08:25,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:25,858 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:26,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:26,072 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:26,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:26,072 INFO L82 PathProgramCache]: Analyzing trace with hash 432046418, now seen corresponding path program 1 times [2019-10-13 18:08:26,072 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:26,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215374117] [2019-10-13 18:08:26,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:26,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:26,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:26,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:26,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215374117] [2019-10-13 18:08:26,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743502410] [2019-10-13 18:08:26,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-13 18:08:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:26,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-13 18:08:26,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:26,702 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-13 18:08:26,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:26,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:26,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:26,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-10-13 18:08:26,769 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:26,769 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-13 18:08:26,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:26,836 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.8 percent of original size [2019-10-13 18:08:26,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:26,840 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:26,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:26,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:26,873 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:26,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:26,893 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-13 18:08:26,893 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:80, output treesize:52 [2019-10-13 18:08:26,944 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 6=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_30|]} [2019-10-13 18:08:26,949 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 13 treesize of output 9 [2019-10-13 18:08:26,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:26,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:26,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:26,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:26,990 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:27,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:27,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:27,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:27,028 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:27,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:27,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:27,054 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:103, output treesize:58 [2019-10-13 18:08:27,132 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:27,133 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-13 18:08:27,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:27,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:27,233 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|], 2=[|v_#memory_int_30|], 9=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_31|]} [2019-10-13 18:08:27,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-10-13 18:08:27,243 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:27,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:27,302 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 27 treesize of output 15 [2019-10-13 18:08:27,303 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:27,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:27,372 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:27,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 117 [2019-10-13 18:08:27,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:27,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:27,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:27,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:27,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:27,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:27,378 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:27,458 INFO L567 ElimStorePlain]: treesize reduction 117, result has 47.5 percent of original size [2019-10-13 18:08:27,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:27,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:27,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 62 [2019-10-13 18:08:27,469 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:27,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:27,493 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-13 18:08:27,493 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:202, output treesize:69 [2019-10-13 18:08:27,617 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_33|], 12=[|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_40|]} [2019-10-13 18:08:27,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:27,636 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 24 [2019-10-13 18:08:27,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:27,735 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.3 percent of original size [2019-10-13 18:08:27,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:27,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:27,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:27,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:27,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-13 18:08:27,752 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:27,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:27,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:27,796 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:27,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 69 [2019-10-13 18:08:27,798 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:27,847 INFO L567 ElimStorePlain]: treesize reduction 48, result has 60.3 percent of original size [2019-10-13 18:08:27,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:27,848 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:73 [2019-10-13 18:08:27,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:27,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:27,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:27,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 43 [2019-10-13 18:08:27,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:27,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:27,990 INFO L341 Elim1Store]: treesize reduction 44, result has 42.1 percent of original size [2019-10-13 18:08:27,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 53 [2019-10-13 18:08:27,991 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:28,039 INFO L567 ElimStorePlain]: treesize reduction 40, result has 76.2 percent of original size [2019-10-13 18:08:28,065 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:28,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 94 [2019-10-13 18:08:28,067 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:28,110 INFO L567 ElimStorePlain]: treesize reduction 96, result has 48.1 percent of original size [2019-10-13 18:08:28,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:28,111 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:206, output treesize:89 [2019-10-13 18:08:28,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:28,182 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:28,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-10-13 18:08:28,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324899683] [2019-10-13 18:08:28,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 18:08:28,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:28,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 18:08:28,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-10-13 18:08:28,184 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 17 states. [2019-10-13 18:08:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:29,190 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2019-10-13 18:08:29,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 18:08:29,190 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-10-13 18:08:29,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:29,192 INFO L225 Difference]: With dead ends: 130 [2019-10-13 18:08:29,192 INFO L226 Difference]: Without dead ends: 128 [2019-10-13 18:08:29,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-10-13 18:08:29,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-13 18:08:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2019-10-13 18:08:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-13 18:08:29,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2019-10-13 18:08:29,201 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 30 [2019-10-13 18:08:29,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:29,201 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2019-10-13 18:08:29,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 18:08:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2019-10-13 18:08:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 18:08:29,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:29,203 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:29,406 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:29,407 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:29,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:29,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1176084370, now seen corresponding path program 1 times [2019-10-13 18:08:29,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:29,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12937851] [2019-10-13 18:08:29,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:29,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:29,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:30,082 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:30,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12937851] [2019-10-13 18:08:30,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091107245] [2019-10-13 18:08:30,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-13 18:08:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:30,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-13 18:08:30,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:30,210 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-13 18:08:30,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:30,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-13 18:08:30,265 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:30,265 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-13 18:08:30,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,313 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-10-13 18:08:30,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:30,321 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:30,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:30,347 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:30,363 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-13 18:08:30,363 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-10-13 18:08:30,432 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_36|], 6=[|v_#memory_$Pointer$.offset_35|, |v_#memory_$Pointer$.base_43|]} [2019-10-13 18:08:30,439 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 13 treesize of output 9 [2019-10-13 18:08:30,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:30,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:30,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:30,479 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:30,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:30,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:30,514 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:30,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,537 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:100, output treesize:55 [2019-10-13 18:08:30,610 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:30,610 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-13 18:08:30,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:30,671 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_37|], 2=[|v_#memory_int_35|], 9=[|v_#memory_$Pointer$.offset_36|, |v_#memory_$Pointer$.base_44|]} [2019-10-13 18:08:30,681 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 39 treesize of output 15 [2019-10-13 18:08:30,681 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:30,755 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 27 treesize of output 15 [2019-10-13 18:08:30,756 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:30,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2019-10-13 18:08:30,804 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:30,885 INFO L341 Elim1Store]: treesize reduction 16, result has 76.1 percent of original size [2019-10-13 18:08:30,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 86 [2019-10-13 18:08:30,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:30,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:30,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:30,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:30,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:30,892 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,961 INFO L567 ElimStorePlain]: treesize reduction 94, result has 43.0 percent of original size [2019-10-13 18:08:30,961 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-13 18:08:30,962 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:199, output treesize:70 [2019-10-13 18:08:31,097 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_38|], 12=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_37|]} [2019-10-13 18:08:31,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:31,105 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 25 treesize of output 24 [2019-10-13 18:08:31,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:31,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:31,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:31,164 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:31,164 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 69 [2019-10-13 18:08:31,166 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:31,224 INFO L567 ElimStorePlain]: treesize reduction 52, result has 66.0 percent of original size [2019-10-13 18:08:31,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:31,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:31,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-13 18:08:31,232 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:31,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:31,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:31,255 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:124, output treesize:82 [2019-10-13 18:08:31,314 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_int_39|], 7=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_38|]} [2019-10-13 18:08:31,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:31,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 33 [2019-10-13 18:08:31,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:31,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:31,393 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:31,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 166 treesize of output 153 [2019-10-13 18:08:31,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,402 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-13 18:08:31,501 INFO L567 ElimStorePlain]: treesize reduction 371, result has 28.7 percent of original size [2019-10-13 18:08:31,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:31,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 104 [2019-10-13 18:08:31,513 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:31,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:31,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:31,533 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:226, output treesize:109 [2019-10-13 18:08:31,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,617 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:31,618 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:31,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-10-13 18:08:31,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119530294] [2019-10-13 18:08:31,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-13 18:08:31,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:31,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-13 18:08:31,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-10-13 18:08:31,620 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 20 states. [2019-10-13 18:08:32,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:32,891 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2019-10-13 18:08:32,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 18:08:32,892 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2019-10-13 18:08:32,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:32,894 INFO L225 Difference]: With dead ends: 130 [2019-10-13 18:08:32,894 INFO L226 Difference]: Without dead ends: 128 [2019-10-13 18:08:32,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2019-10-13 18:08:32,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-13 18:08:32,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2019-10-13 18:08:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-13 18:08:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2019-10-13 18:08:32,904 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 32 [2019-10-13 18:08:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:32,904 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2019-10-13 18:08:32,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-13 18:08:32,904 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2019-10-13 18:08:32,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 18:08:32,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:32,906 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:33,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:33,110 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:33,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:33,111 INFO L82 PathProgramCache]: Analyzing trace with hash -123276738, now seen corresponding path program 3 times [2019-10-13 18:08:33,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:33,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899371979] [2019-10-13 18:08:33,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:33,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:33,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:33,784 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:33,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899371979] [2019-10-13 18:08:33,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993290477] [2019-10-13 18:08:33,785 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 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-13 18:08:33,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 18:08:33,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 18:08:33,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 81 conjunts are in the unsatisfiable core [2019-10-13 18:08:33,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:33,996 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-13 18:08:33,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:34,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:34,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:34,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-10-13 18:08:34,031 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:34,031 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-13 18:08:34,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:34,087 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.8 percent of original size [2019-10-13 18:08:34,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:34,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:34,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:34,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:34,120 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:34,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:34,142 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-13 18:08:34,142 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:80, output treesize:52 [2019-10-13 18:08:34,183 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 6=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_40|]} [2019-10-13 18:08:34,194 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 13 treesize of output 9 [2019-10-13 18:08:34,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:34,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:34,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:34,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:34,240 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:34,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:34,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:34,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:34,276 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:34,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:34,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:34,298 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:103, output treesize:61 [2019-10-13 18:08:34,471 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:34,472 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-13 18:08:34,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:34,846 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-10-13 18:08:34,847 INFO L567 ElimStorePlain]: treesize reduction 40, result has 86.4 percent of original size [2019-10-13 18:08:34,848 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_40|, |v_#memory_int_43|], 10=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_41|]} [2019-10-13 18:08:34,854 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-13 18:08:35,057 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-10-13 18:08:35,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:35,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:35,070 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 73 treesize of output 36 [2019-10-13 18:08:35,070 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:35,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:35,256 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:35,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 190 treesize of output 159 [2019-10-13 18:08:35,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:35,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:35,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:35,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:35,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:35,261 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:35,475 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-10-13 18:08:35,476 INFO L567 ElimStorePlain]: treesize reduction 469, result has 26.0 percent of original size [2019-10-13 18:08:35,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:35,512 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:35,512 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 138 treesize of output 123 [2019-10-13 18:08:35,513 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:35,614 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-10-13 18:08:35,615 INFO L567 ElimStorePlain]: treesize reduction 48, result has 71.4 percent of original size [2019-10-13 18:08:35,615 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-13 18:08:35,616 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:249, output treesize:105 [2019-10-13 18:08:35,703 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_44|], 12=[|v_#memory_$Pointer$.base_50|, |v_#memory_$Pointer$.offset_42|]} [2019-10-13 18:08:35,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:35,714 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 31 treesize of output 30 [2019-10-13 18:08:35,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:35,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:35,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:35,818 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:35,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 92 [2019-10-13 18:08:35,819 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:35,909 INFO L567 ElimStorePlain]: treesize reduction 48, result has 73.5 percent of original size [2019-10-13 18:08:35,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:35,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:35,958 INFO L341 Elim1Store]: treesize reduction 32, result has 56.8 percent of original size [2019-10-13 18:08:35,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 92 [2019-10-13 18:08:35,960 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:36,034 INFO L567 ElimStorePlain]: treesize reduction 38, result has 75.0 percent of original size [2019-10-13 18:08:36,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:36,035 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:156, output treesize:114 [2019-10-13 18:08:36,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:36,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:36,167 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:36,167 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 37 treesize of output 53 [2019-10-13 18:08:36,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:36,273 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-13 18:08:36,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:36,276 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_41|], 4=[|v_#memory_int_45|], 17=[|v_#memory_$Pointer$.offset_43|, |v_#memory_$Pointer$.base_51|]} [2019-10-13 18:08:36,281 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-13 18:08:36,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:36,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:36,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 62 [2019-10-13 18:08:36,393 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:36,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:36,522 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:36,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 282 treesize of output 277 [2019-10-13 18:08:36,525 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:36,649 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-10-13 18:08:36,649 INFO L567 ElimStorePlain]: treesize reduction 152, result has 56.4 percent of original size [2019-10-13 18:08:36,760 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-13 18:08:36,760 INFO L341 Elim1Store]: treesize reduction 15, result has 86.6 percent of original size [2019-10-13 18:08:36,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 170 treesize of output 160 [2019-10-13 18:08:36,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:36,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:36,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:36,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:36,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:36,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:36,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:36,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:36,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:36,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:36,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:36,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:36,790 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-13 18:08:36,931 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-10-13 18:08:36,932 INFO L567 ElimStorePlain]: treesize reduction 91, result has 52.4 percent of original size [2019-10-13 18:08:36,933 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-13 18:08:36,933 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:366, output treesize:106 [2019-10-13 18:08:37,019 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_int_46|], 19=[|v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.base_52|]} [2019-10-13 18:08:37,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:37,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:37,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-10-13 18:08:37,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:37,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:37,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:37,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:37,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:37,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:37,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:37,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:37,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2019-10-13 18:08:37,119 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:37,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:37,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:37,216 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:37,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 121 [2019-10-13 18:08:37,219 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:37,327 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-10-13 18:08:37,328 INFO L567 ElimStorePlain]: treesize reduction 168, result has 40.6 percent of original size [2019-10-13 18:08:37,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:37,329 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:157, output treesize:115 [2019-10-13 18:08:37,439 INFO L392 ElimStorePlain]: Different costs {11=[|v_#memory_int_47|], 17=[|v_#memory_$Pointer$.offset_45|, |v_#memory_$Pointer$.base_53|]} [2019-10-13 18:08:37,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:37,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:37,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 69 [2019-10-13 18:08:37,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:37,584 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-13 18:08:37,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:37,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:37,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:37,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:37,691 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:37,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 287 treesize of output 463 [2019-10-13 18:08:37,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:37,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:37,780 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:37,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 146 [2019-10-13 18:08:37,784 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:37,879 INFO L567 ElimStorePlain]: treesize reduction 240, result has 38.6 percent of original size [2019-10-13 18:08:37,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:37,880 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:396, output treesize:151 [2019-10-13 18:08:38,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:38,164 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:38,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-10-13 18:08:38,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626965994] [2019-10-13 18:08:38,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-13 18:08:38,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:38,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-13 18:08:38,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-10-13 18:08:38,167 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 20 states. [2019-10-13 18:08:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:39,293 INFO L93 Difference]: Finished difference Result 149 states and 179 transitions. [2019-10-13 18:08:39,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 18:08:39,294 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2019-10-13 18:08:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:39,295 INFO L225 Difference]: With dead ends: 149 [2019-10-13 18:08:39,296 INFO L226 Difference]: Without dead ends: 139 [2019-10-13 18:08:39,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2019-10-13 18:08:39,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-13 18:08:39,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 120. [2019-10-13 18:08:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-13 18:08:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 144 transitions. [2019-10-13 18:08:39,309 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 144 transitions. Word has length 35 [2019-10-13 18:08:39,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:39,310 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 144 transitions. [2019-10-13 18:08:39,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-13 18:08:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 144 transitions. [2019-10-13 18:08:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 18:08:39,315 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:39,315 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:39,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:39,524 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:39,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:39,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1744704133, now seen corresponding path program 3 times [2019-10-13 18:08:39,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:39,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464622019] [2019-10-13 18:08:39,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:39,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:39,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:39,675 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 18:08:39,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464622019] [2019-10-13 18:08:39,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766721337] [2019-10-13 18:08:39,676 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 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-13 18:08:40,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 18:08:40,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 18:08:40,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-13 18:08:40,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:40,120 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-13 18:08:40,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:40,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:40,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:40,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-13 18:08:40,151 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:40,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 39 [2019-10-13 18:08:40,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:40,186 INFO L567 ElimStorePlain]: treesize reduction 14, result has 77.8 percent of original size [2019-10-13 18:08:40,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:40,192 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:40,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:40,206 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-13 18:08:40,206 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:36 [2019-10-13 18:08:40,240 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 18:08:40,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:40,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:40,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:40,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:40,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2019-10-13 18:08:40,294 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:40,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-13 18:08:40,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:40,360 INFO L567 ElimStorePlain]: treesize reduction 40, result has 72.4 percent of original size [2019-10-13 18:08:40,453 INFO L341 Elim1Store]: treesize reduction 16, result has 78.7 percent of original size [2019-10-13 18:08:40,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 88 treesize of output 89 [2019-10-13 18:08:40,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:40,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:40,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:40,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:40,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:40,461 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:40,521 INFO L567 ElimStorePlain]: treesize reduction 166, result has 29.7 percent of original size [2019-10-13 18:08:40,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:40,523 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:69 [2019-10-13 18:08:40,607 INFO L341 Elim1Store]: treesize reduction 62, result has 37.4 percent of original size [2019-10-13 18:08:40,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 70 [2019-10-13 18:08:40,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:40,659 INFO L567 ElimStorePlain]: treesize reduction 34, result has 67.0 percent of original size [2019-10-13 18:08:40,660 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-13 18:08:40,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:69 [2019-10-13 18:08:40,744 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:40,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 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-13 18:08:40,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:40,854 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-10-13 18:08:40,855 INFO L567 ElimStorePlain]: treesize reduction 78, result has 69.5 percent of original size [2019-10-13 18:08:41,023 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-10-13 18:08:41,023 INFO L341 Elim1Store]: treesize reduction 39, result has 75.6 percent of original size [2019-10-13 18:08:41,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 161 treesize of output 171 [2019-10-13 18:08:41,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:41,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,086 INFO L496 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:41,298 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 64 [2019-10-13 18:08:41,299 INFO L567 ElimStorePlain]: treesize reduction 345, result has 33.8 percent of original size [2019-10-13 18:08:41,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:41,301 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:160, output treesize:234 [2019-10-13 18:08:41,505 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-10-13 18:08:41,505 INFO L341 Elim1Store]: treesize reduction 98, result has 44.3 percent of original size [2019-10-13 18:08:41,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 128 treesize of output 131 [2019-10-13 18:08:41,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:41,518 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-13 18:08:41,627 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-10-13 18:08:41,628 INFO L567 ElimStorePlain]: treesize reduction 76, result has 56.1 percent of original size [2019-10-13 18:08:41,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:41,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:145, output treesize:126 [2019-10-13 18:08:41,685 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:41,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 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-13 18:08:41,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:41,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:42,013 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-10-13 18:08:42,014 INFO L341 Elim1Store]: treesize reduction 62, result has 75.9 percent of original size [2019-10-13 18:08:42,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 235 treesize of output 254 [2019-10-13 18:08:42,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:42,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,227 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:42,346 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 49 [2019-10-13 18:08:42,347 INFO L567 ElimStorePlain]: treesize reduction 198, result has 33.6 percent of original size [2019-10-13 18:08:42,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:42,348 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:251, output treesize:174 [2019-10-13 18:08:42,593 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 79 [2019-10-13 18:08:42,593 INFO L341 Elim1Store]: treesize reduction 134, result has 49.4 percent of original size [2019-10-13 18:08:42,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 186 treesize of output 193 [2019-10-13 18:08:42,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,659 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-13 18:08:42,757 INFO L567 ElimStorePlain]: treesize reduction 130, result has 43.5 percent of original size [2019-10-13 18:08:42,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:42,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:193, output treesize:174 [2019-10-13 18:08:42,783 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 30=[|v_#memory_$Pointer$.base_62|]} [2019-10-13 18:08:42,785 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-13 18:08:42,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:42,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:42,901 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 280 treesize of output 208 [2019-10-13 18:08:42,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:42,950 INFO L496 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:43,025 INFO L567 ElimStorePlain]: treesize reduction 119, result has 27.4 percent of original size [2019-10-13 18:08:43,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:43,026 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:266, output treesize:4 [2019-10-13 18:08:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:43,039 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:43,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-10-13 18:08:43,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93468971] [2019-10-13 18:08:43,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 18:08:43,039 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:43,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 18:08:43,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-13 18:08:43,040 INFO L87 Difference]: Start difference. First operand 120 states and 144 transitions. Second operand 12 states. [2019-10-13 18:08:43,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:43,569 INFO L93 Difference]: Finished difference Result 170 states and 206 transitions. [2019-10-13 18:08:43,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 18:08:43,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-10-13 18:08:43,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:43,571 INFO L225 Difference]: With dead ends: 170 [2019-10-13 18:08:43,571 INFO L226 Difference]: Without dead ends: 168 [2019-10-13 18:08:43,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-10-13 18:08:43,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-13 18:08:43,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 99. [2019-10-13 18:08:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-13 18:08:43,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2019-10-13 18:08:43,582 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 35 [2019-10-13 18:08:43,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:43,582 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2019-10-13 18:08:43,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 18:08:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2019-10-13 18:08:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 18:08:43,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:43,583 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:43,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:43,789 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:43,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:43,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1826398334, now seen corresponding path program 1 times [2019-10-13 18:08:43,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:43,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874368365] [2019-10-13 18:08:43,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:43,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:43,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:44,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874368365] [2019-10-13 18:08:44,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669763217] [2019-10-13 18:08:44,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:44,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 74 conjunts are in the unsatisfiable core [2019-10-13 18:08:44,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:44,760 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-13 18:08:44,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:44,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:44,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:44,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-13 18:08:44,791 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:44,792 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-13 18:08:44,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:44,841 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-10-13 18:08:44,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:44,846 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:44,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:44,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:44,869 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:44,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:44,888 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-13 18:08:44,888 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-10-13 18:08:44,983 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_50|], 6=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_64|]} [2019-10-13 18:08:44,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-13 18:08:44,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:45,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:45,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:45,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:45,021 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:45,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:45,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:45,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:45,051 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:45,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:45,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:45,073 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:103, output treesize:58 [2019-10-13 18:08:45,180 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:45,180 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-13 18:08:45,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:45,381 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-10-13 18:08:45,381 INFO L567 ElimStorePlain]: treesize reduction 40, result has 84.3 percent of original size [2019-10-13 18:08:45,386 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_51|], 2=[|v_#memory_int_48|], 9=[|v_#memory_$Pointer$.offset_48|, |v_#memory_$Pointer$.base_65|]} [2019-10-13 18:08:45,400 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 39 treesize of output 15 [2019-10-13 18:08:45,400 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:45,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:45,475 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 27 treesize of output 15 [2019-10-13 18:08:45,475 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:45,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:45,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2019-10-13 18:08:45,536 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:45,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:45,607 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:45,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 95 [2019-10-13 18:08:45,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:45,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:45,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:45,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:45,610 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:45,690 INFO L567 ElimStorePlain]: treesize reduction 32, result has 73.3 percent of original size [2019-10-13 18:08:45,690 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-13 18:08:45,690 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:208, output treesize:88 [2019-10-13 18:08:45,808 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_52|], 12=[|v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_66|]} [2019-10-13 18:08:45,823 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 25 treesize of output 24 [2019-10-13 18:08:45,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:45,920 INFO L567 ElimStorePlain]: treesize reduction 8, result has 94.2 percent of original size [2019-10-13 18:08:45,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:45,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:45,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:45,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:45,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-13 18:08:45,936 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:45,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:45,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:45,996 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:45,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 74 [2019-10-13 18:08:45,998 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:46,071 INFO L567 ElimStorePlain]: treesize reduction 40, result has 69.7 percent of original size [2019-10-13 18:08:46,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:46,072 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:92 [2019-10-13 18:08:46,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:46,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:46,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:46,183 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:46,183 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-13 18:08:46,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:46,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:46,283 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_int_53|], 2=[|v_#memory_int_49|], 15=[|v_#memory_$Pointer$.base_67|, |v_#memory_$Pointer$.offset_50|]} [2019-10-13 18:08:46,304 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:46,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 53 [2019-10-13 18:08:46,305 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:46,446 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-10-13 18:08:46,447 INFO L567 ElimStorePlain]: treesize reduction 40, result has 85.8 percent of original size [2019-10-13 18:08:46,468 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:46,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 53 [2019-10-13 18:08:46,468 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:46,572 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-10-13 18:08:46,573 INFO L567 ElimStorePlain]: treesize reduction 40, result has 85.0 percent of original size [2019-10-13 18:08:46,697 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-13 18:08:46,697 INFO L341 Elim1Store]: treesize reduction 15, result has 86.6 percent of original size [2019-10-13 18:08:46,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 206 treesize of output 176 [2019-10-13 18:08:46,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:46,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:46,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:46,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:46,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:46,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:46,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:46,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:46,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:46,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:46,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:46,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:46,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:46,741 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-13 18:08:46,878 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 53 [2019-10-13 18:08:46,878 INFO L567 ElimStorePlain]: treesize reduction 322, result has 25.5 percent of original size [2019-10-13 18:08:46,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:46,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:46,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:46,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:46,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:46,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 82 [2019-10-13 18:08:46,891 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:46,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:46,918 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-13 18:08:46,919 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:288, output treesize:110 [2019-10-13 18:08:46,982 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_int_54|], 6=[|v_#memory_$Pointer$.base_68|, |v_#memory_$Pointer$.offset_51|]} [2019-10-13 18:08:46,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:46,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:46,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:46,994 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 74 treesize of output 52 [2019-10-13 18:08:46,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:47,070 INFO L567 ElimStorePlain]: treesize reduction 12, result has 95.3 percent of original size [2019-10-13 18:08:47,100 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:47,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 161 [2019-10-13 18:08:47,102 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:47,188 INFO L567 ElimStorePlain]: treesize reduction 192, result has 50.3 percent of original size [2019-10-13 18:08:47,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:47,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:47,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:47,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:47,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:47,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:47,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 65 [2019-10-13 18:08:47,206 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:47,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:47,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:47,231 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:273, output treesize:143 [2019-10-13 18:08:47,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:47,304 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:47,304 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:47,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2019-10-13 18:08:47,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100683336] [2019-10-13 18:08:47,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 18:08:47,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:47,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 18:08:47,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-10-13 18:08:47,306 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand 22 states. [2019-10-13 18:08:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:48,469 INFO L93 Difference]: Finished difference Result 174 states and 208 transitions. [2019-10-13 18:08:48,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 18:08:48,470 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 35 [2019-10-13 18:08:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:48,472 INFO L225 Difference]: With dead ends: 174 [2019-10-13 18:08:48,472 INFO L226 Difference]: Without dead ends: 145 [2019-10-13 18:08:48,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2019-10-13 18:08:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-13 18:08:48,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 107. [2019-10-13 18:08:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-13 18:08:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2019-10-13 18:08:48,483 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 35 [2019-10-13 18:08:48,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:48,483 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2019-10-13 18:08:48,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 18:08:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2019-10-13 18:08:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 18:08:48,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:48,484 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:48,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:48,688 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:48,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:48,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1393926006, now seen corresponding path program 2 times [2019-10-13 18:08:48,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:48,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121935160] [2019-10-13 18:08:48,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:48,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:48,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 18:08:48,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121935160] [2019-10-13 18:08:48,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842182398] [2019-10-13 18:08:48,879 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:49,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 18:08:49,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 18:08:49,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-13 18:08:49,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:49,023 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-13 18:08:49,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,036 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-13 18:08:49,037 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,046 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-13 18:08:49,046 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-13 18:08:49,094 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,095 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-13 18:08:49,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,187 INFO L567 ElimStorePlain]: treesize reduction 14, result has 89.1 percent of original size [2019-10-13 18:08:49,189 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_69|, |v_#memory_$Pointer$.offset_52|], 2=[|v_#memory_int_56|, |v_#memory_int_58|]} [2019-10-13 18:08:49,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:49,196 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:49,235 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,273 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-13 18:08:49,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:49,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 20 [2019-10-13 18:08:49,307 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,333 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-13 18:08:49,333 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:116, output treesize:58