java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:10:33,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:10:33,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:10:33,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:10:33,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:10:33,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:10:33,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:10:33,598 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:10:33,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:10:33,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:10:33,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:10:33,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:10:33,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:10:33,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:10:33,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:10:33,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:10:33,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:10:33,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:10:33,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:10:33,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:10:33,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:10:33,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:10:33,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:10:33,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:10:33,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:10:33,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:10:33,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:10:33,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:10:33,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:10:33,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:10:33,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:10:33,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:10:33,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:10:33,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:10:33,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:10:33,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:10:33,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:10:33,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:10:33,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:10:33,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:10:33,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:10:33,629 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:10:33,643 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:10:33,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:10:33,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:10:33,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:10:33,645 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:10:33,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:10:33,646 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:10:33,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:10:33,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:10:33,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:10:33,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:10:33,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:10:33,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:10:33,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:10:33,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:10:33,647 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:10:33,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:10:33,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:10:33,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:10:33,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:10:33,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:10:33,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:10:33,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:10:33,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:10:33,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:10:33,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:10:33,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:10:33,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:10:33,650 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:10:33,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:10:33,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:10:33,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:10:33,952 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:10:33,952 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:10:33,953 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2019-10-14 23:10:34,014 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1852a84/39bb66e7aebb46beb6438ca0ce289ad6/FLAGb8d84a7ae [2019-10-14 23:10:34,537 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:10:34,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2019-10-14 23:10:34,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1852a84/39bb66e7aebb46beb6438ca0ce289ad6/FLAGb8d84a7ae [2019-10-14 23:10:34,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1852a84/39bb66e7aebb46beb6438ca0ce289ad6 [2019-10-14 23:10:34,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:10:34,881 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:10:34,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:10:34,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:10:34,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:10:34,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:10:34" (1/1) ... [2019-10-14 23:10:34,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad58572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:34, skipping insertion in model container [2019-10-14 23:10:34,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:10:34" (1/1) ... [2019-10-14 23:10:34,898 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:10:34,943 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:10:35,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:10:35,370 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:10:35,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:10:35,494 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:10:35,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:35 WrapperNode [2019-10-14 23:10:35,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:10:35,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:10:35,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:10:35,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:10:35,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:35" (1/1) ... [2019-10-14 23:10:35,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:35" (1/1) ... [2019-10-14 23:10:35,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:35" (1/1) ... [2019-10-14 23:10:35,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:35" (1/1) ... [2019-10-14 23:10:35,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:35" (1/1) ... [2019-10-14 23:10:35,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:35" (1/1) ... [2019-10-14 23:10:35,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:35" (1/1) ... [2019-10-14 23:10:35,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:10:35,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:10:35,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:10:35,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:10:35,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:10:35,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:10:35,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:10:35,626 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 23:10:35,626 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 23:10:35,626 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-14 23:10:35,627 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die [2019-10-14 23:10:35,627 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sl_with_head_and_tail [2019-10-14 23:10:35,628 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_random_insert [2019-10-14 23:10:35,629 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_sl [2019-10-14 23:10:35,629 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:10:35,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:10:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:10:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 23:10:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 23:10:35,631 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 23:10:35,631 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 23:10:35,632 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 23:10:35,632 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 23:10:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 23:10:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 23:10:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 23:10:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 23:10:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 23:10:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 23:10:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 23:10:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 23:10:35,634 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 23:10:35,634 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 23:10:35,634 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 23:10:35,634 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 23:10:35,634 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 23:10:35,634 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 23:10:35,634 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 23:10:35,635 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 23:10:35,635 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 23:10:35,635 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 23:10:35,635 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 23:10:35,635 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 23:10:35,635 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 23:10:35,635 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 23:10:35,635 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 23:10:35,636 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 23:10:35,636 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 23:10:35,636 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 23:10:35,636 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 23:10:35,636 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 23:10:35,636 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 23:10:35,636 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 23:10:35,636 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 23:10:35,636 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 23:10:35,637 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 23:10:35,637 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 23:10:35,637 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 23:10:35,637 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 23:10:35,637 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 23:10:35,639 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 23:10:35,639 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 23:10:35,639 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 23:10:35,640 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 23:10:35,640 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 23:10:35,640 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 23:10:35,640 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 23:10:35,640 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 23:10:35,640 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 23:10:35,640 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:10:35,641 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 23:10:35,641 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 23:10:35,641 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 23:10:35,642 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 23:10:35,642 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 23:10:35,643 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 23:10:35,643 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 23:10:35,643 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 23:10:35,643 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 23:10:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 23:10:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 23:10:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 23:10:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:10:35,645 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 23:10:35,645 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 23:10:35,645 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 23:10:35,645 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 23:10:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 23:10:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 23:10:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 23:10:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 23:10:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 23:10:35,648 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 23:10:35,648 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 23:10:35,648 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 23:10:35,649 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 23:10:35,649 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 23:10:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 23:10:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 23:10:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 23:10:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 23:10:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 23:10:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 23:10:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 23:10:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 23:10:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 23:10:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 23:10:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 23:10:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 23:10:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 23:10:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 23:10:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 23:10:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 23:10:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 23:10:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 23:10:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 23:10:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 23:10:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 23:10:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 23:10:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 23:10:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 23:10:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 23:10:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-14 23:10:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die [2019-10-14 23:10:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:10:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure create_sl_with_head_and_tail [2019-10-14 23:10:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 23:10:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 23:10:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure sl_random_insert [2019-10-14 23:10:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_sl [2019-10-14 23:10:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:10:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:10:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:10:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:10:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:10:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:10:36,050 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-14 23:10:36,383 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:10:36,384 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-14 23:10:36,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:10:36 BoogieIcfgContainer [2019-10-14 23:10:36,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:10:36,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:10:36,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:10:36,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:10:36,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:10:34" (1/3) ... [2019-10-14 23:10:36,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d24f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:10:36, skipping insertion in model container [2019-10-14 23:10:36,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:35" (2/3) ... [2019-10-14 23:10:36,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d24f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:10:36, skipping insertion in model container [2019-10-14 23:10:36,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:10:36" (3/3) ... [2019-10-14 23:10:36,394 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl-2.i [2019-10-14 23:10:36,403 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:10:36,411 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:10:36,422 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:10:36,447 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:10:36,447 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:10:36,447 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:10:36,448 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:10:36,448 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:10:36,448 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:10:36,448 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:10:36,448 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:10:36,466 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-10-14 23:10:36,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-14 23:10:36,473 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:36,474 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:36,476 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:36,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:36,482 INFO L82 PathProgramCache]: Analyzing trace with hash 407034730, now seen corresponding path program 1 times [2019-10-14 23:10:36,490 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:36,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034528394] [2019-10-14 23:10:36,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:36,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:36,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:36,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034528394] [2019-10-14 23:10:36,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:36,656 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:10:36,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152434392] [2019-10-14 23:10:36,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:10:36,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:36,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:10:36,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:10:36,681 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2019-10-14 23:10:36,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:36,905 INFO L93 Difference]: Finished difference Result 95 states and 129 transitions. [2019-10-14 23:10:36,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:10:36,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-14 23:10:36,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:36,915 INFO L225 Difference]: With dead ends: 95 [2019-10-14 23:10:36,915 INFO L226 Difference]: Without dead ends: 18 [2019-10-14 23:10:36,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:10:36,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-14 23:10:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-14 23:10:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-14 23:10:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-14 23:10:36,956 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-10-14 23:10:36,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:36,957 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-14 23:10:36,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:10:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-14 23:10:36,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 23:10:36,958 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:36,958 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:36,958 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:36,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:36,959 INFO L82 PathProgramCache]: Analyzing trace with hash -709462780, now seen corresponding path program 1 times [2019-10-14 23:10:36,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:36,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281683513] [2019-10-14 23:10:36,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:36,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:36,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:37,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:37,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281683513] [2019-10-14 23:10:37,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:37,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:10:37,080 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210684760] [2019-10-14 23:10:37,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:10:37,081 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:37,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:10:37,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:10:37,082 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2019-10-14 23:10:37,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:37,228 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-10-14 23:10:37,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:10:37,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-10-14 23:10:37,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:37,230 INFO L225 Difference]: With dead ends: 33 [2019-10-14 23:10:37,230 INFO L226 Difference]: Without dead ends: 31 [2019-10-14 23:10:37,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:10:37,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-14 23:10:37,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-10-14 23:10:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-14 23:10:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-14 23:10:37,237 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 14 [2019-10-14 23:10:37,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:37,237 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-14 23:10:37,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:10:37,238 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-14 23:10:37,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 23:10:37,238 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:37,238 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:37,239 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:37,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:37,239 INFO L82 PathProgramCache]: Analyzing trace with hash -66753378, now seen corresponding path program 1 times [2019-10-14 23:10:37,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:37,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121130413] [2019-10-14 23:10:37,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:37,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:37,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:37,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121130413] [2019-10-14 23:10:37,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294062187] [2019-10-14 23:10:37,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:37,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-14 23:10:37,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:37,558 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 11 treesize of output 7 [2019-10-14 23:10:37,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:37,571 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 11 treesize of output 7 [2019-10-14 23:10:37,571 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:37,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,580 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-10-14 23:10:37,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 23:10:37,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:37,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 23:10:37,608 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:37,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,614 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-14 23:10:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:37,617 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:37,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2019-10-14 23:10:37,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216447049] [2019-10-14 23:10:37,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:10:37,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:37,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:10:37,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:10:37,619 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 7 states. [2019-10-14 23:10:37,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:37,723 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-10-14 23:10:37,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:10:37,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-10-14 23:10:37,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:37,724 INFO L225 Difference]: With dead ends: 37 [2019-10-14 23:10:37,725 INFO L226 Difference]: Without dead ends: 27 [2019-10-14 23:10:37,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:10:37,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-14 23:10:37,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-10-14 23:10:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-14 23:10:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-10-14 23:10:37,730 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-10-14 23:10:37,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:37,730 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-10-14 23:10:37,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:10:37,730 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-10-14 23:10:37,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:10:37,731 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:37,731 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:37,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:37,942 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:37,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:37,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1381959275, now seen corresponding path program 1 times [2019-10-14 23:10:37,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:37,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838740500] [2019-10-14 23:10:37,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:37,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:37,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:38,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:38,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838740500] [2019-10-14 23:10:38,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478271741] [2019-10-14 23:10:38,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:38,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-14 23:10:38,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:38,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:38,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:38,291 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:38,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,320 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 11 treesize of output 7 [2019-10-14 23:10:38,320 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,332 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-10-14 23:10:38,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:38,371 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 27 treesize of output 11 [2019-10-14 23:10:38,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-10-14 23:10:38,412 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:10:38,412 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 1 case distinctions, treesize of input 30 treesize of output 18 [2019-10-14 23:10:38,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,422 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-14 23:10:38,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-10-14 23:10:38,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-14 23:10:38,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-10-14 23:10:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:38,467 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:38,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-10-14 23:10:38,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497469043] [2019-10-14 23:10:38,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 23:10:38,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:38,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 23:10:38,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:10:38,469 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 14 states. [2019-10-14 23:10:38,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:38,770 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-10-14 23:10:38,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:10:38,770 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-10-14 23:10:38,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:38,771 INFO L225 Difference]: With dead ends: 37 [2019-10-14 23:10:38,771 INFO L226 Difference]: Without dead ends: 35 [2019-10-14 23:10:38,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:10:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-14 23:10:38,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-10-14 23:10:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-14 23:10:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-14 23:10:38,780 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2019-10-14 23:10:38,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:38,780 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-14 23:10:38,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 23:10:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-14 23:10:38,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:10:38,782 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:38,782 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:38,986 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:38,987 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:38,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:38,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1602875945, now seen corresponding path program 1 times [2019-10-14 23:10:38,988 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:38,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042856154] [2019-10-14 23:10:38,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:38,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:38,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:39,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042856154] [2019-10-14 23:10:39,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115722261] [2019-10-14 23:10:39,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:39,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-14 23:10:39,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:39,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:39,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:39,382 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:39,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-10-14 23:10:39,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:39,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:39,443 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,458 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2019-10-14 23:10:39,499 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:39,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,527 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:39,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2019-10-14 23:10:39,551 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2019-10-14 23:10:39,573 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,603 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,603 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 66 [2019-10-14 23:10:39,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:39,607 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,644 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.2 percent of original size [2019-10-14 23:10:39,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,645 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:141, output treesize:52 [2019-10-14 23:10:39,702 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,703 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 49 treesize of output 36 [2019-10-14 23:10:39,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,723 INFO L567 ElimStorePlain]: treesize reduction 8, result has 80.5 percent of original size [2019-10-14 23:10:39,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-14 23:10:39,726 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,732 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:11 [2019-10-14 23:10:39,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 23:10:39,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-14 23:10:39,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:39,751 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:39,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-10-14 23:10:39,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041830227] [2019-10-14 23:10:39,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:10:39,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:39,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:10:39,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:10:39,752 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 11 states. [2019-10-14 23:10:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:40,002 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-10-14 23:10:40,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:10:40,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-10-14 23:10:40,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:40,004 INFO L225 Difference]: With dead ends: 40 [2019-10-14 23:10:40,004 INFO L226 Difference]: Without dead ends: 38 [2019-10-14 23:10:40,005 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:10:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-14 23:10:40,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-10-14 23:10:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 23:10:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-10-14 23:10:40,013 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 21 [2019-10-14 23:10:40,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:40,013 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-10-14 23:10:40,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:10:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-10-14 23:10:40,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:10:40,015 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:40,015 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:40,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:40,219 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:40,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:40,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1006799954, now seen corresponding path program 2 times [2019-10-14 23:10:40,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:40,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56075257] [2019-10-14 23:10:40,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:40,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:40,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:40,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56075257] [2019-10-14 23:10:40,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96922594] [2019-10-14 23:10:40,389 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-14 23:10:40,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:10:40,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:40,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-14 23:10:40,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:40,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:40,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:40,525 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:40,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:40,562 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,571 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-10-14 23:10:40,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:40,589 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 27 treesize of output 11 [2019-10-14 23:10:40,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-10-14 23:10:40,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:40,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:10:40,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-10-14 23:10:40,668 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:10:40,669 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 23:10:40,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,687 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-14 23:10:40,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-10-14 23:10:40,780 INFO L341 Elim1Store]: treesize reduction 27, result has 69.7 percent of original size [2019-10-14 23:10:40,780 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 2 case distinctions, treesize of input 33 treesize of output 75 [2019-10-14 23:10:40,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,823 INFO L567 ElimStorePlain]: treesize reduction 39, result has 48.7 percent of original size [2019-10-14 23:10:40,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:40,826 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-14 23:10:40,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:37 [2019-10-14 23:10:40,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:40,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:40,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-10-14 23:10:40,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,878 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2019-10-14 23:10:40,879 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,891 INFO L567 ElimStorePlain]: treesize reduction 17, result has 32.0 percent of original size [2019-10-14 23:10:40,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,892 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:3 [2019-10-14 23:10:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:40,895 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:40,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2019-10-14 23:10:40,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445978043] [2019-10-14 23:10:40,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 23:10:40,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:40,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 23:10:40,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:10:40,897 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 14 states. [2019-10-14 23:10:41,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:41,330 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-10-14 23:10:41,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:10:41,330 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-10-14 23:10:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:41,331 INFO L225 Difference]: With dead ends: 47 [2019-10-14 23:10:41,331 INFO L226 Difference]: Without dead ends: 45 [2019-10-14 23:10:41,332 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-10-14 23:10:41,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-14 23:10:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2019-10-14 23:10:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-14 23:10:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-10-14 23:10:41,340 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 22 [2019-10-14 23:10:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:41,340 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-10-14 23:10:41,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 23:10:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-10-14 23:10:41,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:10:41,341 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:41,341 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:41,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:41,545 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:41,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:41,546 INFO L82 PathProgramCache]: Analyzing trace with hash 173981419, now seen corresponding path program 2 times [2019-10-14 23:10:41,546 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:41,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128343223] [2019-10-14 23:10:41,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:41,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:41,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:41,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128343223] [2019-10-14 23:10:41,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904448082] [2019-10-14 23:10:41,762 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:41,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:10:41,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:41,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-14 23:10:41,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:41,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:41,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:41,898 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:41,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-10-14 23:10:41,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:41,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:41,939 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,951 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2019-10-14 23:10:41,970 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:42,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,015 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 71 [2019-10-14 23:10:42,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,020 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-14 23:10:42,086 INFO L567 ElimStorePlain]: treesize reduction 85, result has 50.9 percent of original size [2019-10-14 23:10:42,089 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:42,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2019-10-14 23:10:42,110 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,127 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:111, output treesize:41 [2019-10-14 23:10:42,188 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:10:42,201 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-14 23:10:42,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 45 [2019-10-14 23:10:42,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:42,204 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:42,225 INFO L567 ElimStorePlain]: treesize reduction 8, result has 81.4 percent of original size [2019-10-14 23:10:42,235 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2019-10-14 23:10:42,236 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,244 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:7 [2019-10-14 23:10:42,248 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:42,248 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:42,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-10-14 23:10:42,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348992113] [2019-10-14 23:10:42,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:10:42,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:42,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:10:42,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:10:42,250 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 12 states. [2019-10-14 23:10:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:42,519 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-10-14 23:10:42,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:10:42,519 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-10-14 23:10:42,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:42,520 INFO L225 Difference]: With dead ends: 49 [2019-10-14 23:10:42,520 INFO L226 Difference]: Without dead ends: 36 [2019-10-14 23:10:42,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:10:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-14 23:10:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-10-14 23:10:42,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-14 23:10:42,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-10-14 23:10:42,527 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 24 [2019-10-14 23:10:42,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:42,528 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-10-14 23:10:42,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:10:42,528 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-10-14 23:10:42,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:10:42,529 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:42,529 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:42,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:42,734 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:42,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:42,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1825663632, now seen corresponding path program 3 times [2019-10-14 23:10:42,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:42,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999699034] [2019-10-14 23:10:42,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:42,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:42,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:43,037 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-14 23:10:43,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999699034] [2019-10-14 23:10:43,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130809538] [2019-10-14 23:10:43,039 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:43,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 23:10:43,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:43,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-14 23:10:43,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:43,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:43,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:43,287 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:43,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,325 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-14 23:10:43,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-14 23:10:43,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:43,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:43,388 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,403 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-10-14 23:10:43,429 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 23:10:43,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,462 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_48|], 2=[|v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_50|]} [2019-10-14 23:10:43,467 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 11 treesize of output 7 [2019-10-14 23:10:43,467 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,497 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 23 treesize of output 11 [2019-10-14 23:10:43,498 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,524 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 23 treesize of output 11 [2019-10-14 23:10:43,524 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,540 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:43 [2019-10-14 23:10:43,597 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_49|], 1=[|v_#memory_$Pointer$.base_51|, |v_#memory_$Pointer$.offset_50|]} [2019-10-14 23:10:43,608 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-14 23:10:43,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,649 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,650 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 74 [2019-10-14 23:10:43,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,654 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,705 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.5 percent of original size [2019-10-14 23:10:43,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:43,713 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 22 [2019-10-14 23:10:43,714 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,731 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-14 23:10:43,731 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:129, output treesize:83 [2019-10-14 23:10:43,773 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_47|], 4=[|v_#memory_int_50|], 5=[|v_#memory_$Pointer$.offset_51|, |v_#memory_$Pointer$.base_52|]} [2019-10-14 23:10:43,776 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:43,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,818 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:43,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:43,856 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 82 treesize of output 38 [2019-10-14 23:10:43,856 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:43,921 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,922 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 134 [2019-10-14 23:10:43,923 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:43,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,973 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:43,974 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 3 case distinctions, treesize of input 126 treesize of output 118 [2019-10-14 23:10:43,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:43,980 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,071 INFO L567 ElimStorePlain]: treesize reduction 184, result has 42.7 percent of original size [2019-10-14 23:10:44,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,072 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:315, output treesize:106 [2019-10-14 23:10:44,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,143 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 103 treesize of output 73 [2019-10-14 23:10:44,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,148 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:44,185 INFO L567 ElimStorePlain]: treesize reduction 20, result has 73.3 percent of original size [2019-10-14 23:10:44,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-14 23:10:44,191 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:44,207 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:22 [2019-10-14 23:10:44,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-14 23:10:44,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-10-14 23:10:44,252 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-14 23:10:44,252 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:44,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2019-10-14 23:10:44,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957420043] [2019-10-14 23:10:44,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 23:10:44,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:44,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 23:10:44,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:10:44,254 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 16 states. [2019-10-14 23:10:44,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:44,763 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-10-14 23:10:44,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:10:44,769 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-10-14 23:10:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:44,770 INFO L225 Difference]: With dead ends: 47 [2019-10-14 23:10:44,770 INFO L226 Difference]: Without dead ends: 45 [2019-10-14 23:10:44,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2019-10-14 23:10:44,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-14 23:10:44,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2019-10-14 23:10:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-14 23:10:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-10-14 23:10:44,776 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 25 [2019-10-14 23:10:44,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:44,777 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-10-14 23:10:44,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 23:10:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-10-14 23:10:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:10:44,778 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:44,778 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:44,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:44,985 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:44,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:44,986 INFO L82 PathProgramCache]: Analyzing trace with hash -82655559, now seen corresponding path program 3 times [2019-10-14 23:10:44,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:44,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876436113] [2019-10-14 23:10:44,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:44,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:44,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:45,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876436113] [2019-10-14 23:10:45,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437950326] [2019-10-14 23:10:45,210 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:45,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-14 23:10:45,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:45,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-14 23:10:45,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:45,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:45,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:45,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:45,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:45,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:45,412 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:45,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:45,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:45,446 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-10-14 23:10:45,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:45,451 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:45,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:45,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:45,464 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-10-14 23:10:45,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:45,510 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 27 treesize of output 11 [2019-10-14 23:10:45,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:45,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:45,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:45,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-14 23:10:45,565 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:45,566 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 50 [2019-10-14 23:10:45,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:45,610 INFO L567 ElimStorePlain]: treesize reduction 28, result has 61.1 percent of original size [2019-10-14 23:10:45,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:10:45,615 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:45,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:45,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:45,628 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:40 [2019-10-14 23:10:45,670 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:10:45,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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-14 23:10:45,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:45,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:45,686 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-14 23:10:45,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:40 [2019-10-14 23:10:45,747 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:45,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2019-10-14 23:10:45,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:45,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:45,800 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:45,800 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 2 case distinctions, treesize of input 26 treesize of output 68 [2019-10-14 23:10:45,801 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:45,857 INFO L567 ElimStorePlain]: treesize reduction 40, result has 54.0 percent of original size [2019-10-14 23:10:45,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:45,858 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:47 [2019-10-14 23:10:45,952 INFO L341 Elim1Store]: treesize reduction 20, result has 64.3 percent of original size [2019-10-14 23:10:45,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 59 [2019-10-14 23:10:45,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,002 INFO L567 ElimStorePlain]: treesize reduction 32, result has 61.9 percent of original size [2019-10-14 23:10:46,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,005 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-14 23:10:46,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:52 [2019-10-14 23:10:46,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:46,161 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 77 [2019-10-14 23:10:46,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,175 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 48 treesize of output 43 [2019-10-14 23:10:46,175 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,255 INFO L567 ElimStorePlain]: treesize reduction 28, result has 75.4 percent of original size [2019-10-14 23:10:46,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-10-14 23:10:46,257 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:108, output treesize:86 [2019-10-14 23:10:46,327 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 36 [2019-10-14 23:10:46,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,350 INFO L567 ElimStorePlain]: treesize reduction 8, result has 71.4 percent of original size [2019-10-14 23:10:46,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:52, output treesize:3 [2019-10-14 23:10:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:46,356 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:46,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2019-10-14 23:10:46,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960944682] [2019-10-14 23:10:46,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-14 23:10:46,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:46,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-14 23:10:46,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:10:46,358 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 20 states. [2019-10-14 23:10:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:47,218 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-10-14 23:10:47,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 23:10:47,219 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-10-14 23:10:47,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:47,220 INFO L225 Difference]: With dead ends: 44 [2019-10-14 23:10:47,220 INFO L226 Difference]: Without dead ends: 42 [2019-10-14 23:10:47,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2019-10-14 23:10:47,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-14 23:10:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2019-10-14 23:10:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-14 23:10:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-10-14 23:10:47,226 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 26 [2019-10-14 23:10:47,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:47,226 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-10-14 23:10:47,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-14 23:10:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-10-14 23:10:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:10:47,227 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:47,227 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:47,431 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:47,432 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:47,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:47,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1370635575, now seen corresponding path program 4 times [2019-10-14 23:10:47,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:47,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473322465] [2019-10-14 23:10:47,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:47,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:47,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:47,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473322465] [2019-10-14 23:10:47,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791458425] [2019-10-14 23:10:47,825 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:47,937 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 23:10:47,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:47,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 67 conjunts are in the unsatisfiable core [2019-10-14 23:10:47,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:47,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:47,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:47,977 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:47,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,002 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-14 23:10:48,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-14 23:10:48,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:48,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:48,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:48,032 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:48,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,049 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-10-14 23:10:48,091 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:48,091 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 22 treesize of output 69 [2019-10-14 23:10:48,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,173 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.1 percent of original size [2019-10-14 23:10:48,174 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_58|], 2=[|v_#memory_$Pointer$.base_58|, |v_#memory_$Pointer$.offset_56|]} [2019-10-14 23:10:48,179 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 11 treesize of output 7 [2019-10-14 23:10:48,179 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:48,215 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 23 treesize of output 11 [2019-10-14 23:10:48,215 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:48,247 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 23 treesize of output 11 [2019-10-14 23:10:48,248 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:48,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,292 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:87, output treesize:55 [2019-10-14 23:10:48,339 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_59|], 1=[|v_#memory_$Pointer$.base_59|, |v_#memory_$Pointer$.offset_57|]} [2019-10-14 23:10:48,344 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-14 23:10:48,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:48,389 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:48,389 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 72 [2019-10-14 23:10:48,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:48,391 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,449 INFO L567 ElimStorePlain]: treesize reduction 24, result has 79.7 percent of original size [2019-10-14 23:10:48,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:48,454 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 22 [2019-10-14 23:10:48,455 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:48,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,483 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:137, output treesize:88 [2019-10-14 23:10:48,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:48,568 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:48,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-10-14 23:10:48,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:48,605 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_60|, |v_#memory_$Pointer$.offset_58|], 5=[|v_#memory_$Pointer$.base_60|]} [2019-10-14 23:10:48,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:48,613 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 23 treesize of output 22 [2019-10-14 23:10:48,614 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:48,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:48,676 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 23 treesize of output 11 [2019-10-14 23:10:48,677 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:48,757 INFO L341 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-10-14 23:10:48,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 68 [2019-10-14 23:10:48,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:48,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:48,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:48,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:48,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:48,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:48,762 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:48,816 INFO L567 ElimStorePlain]: treesize reduction 24, result has 71.1 percent of original size [2019-10-14 23:10:48,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,817 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:134, output treesize:68 [2019-10-14 23:10:48,862 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_59|], 5=[|v_#memory_$Pointer$.base_61|], 6=[|v_#memory_int_61|]} [2019-10-14 23:10:48,872 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 37 treesize of output 28 [2019-10-14 23:10:48,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:48,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:48,954 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:48,954 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 3 case distinctions, treesize of input 181 treesize of output 161 [2019-10-14 23:10:48,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:48,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:48,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:48,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:48,960 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-14 23:10:49,077 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-10-14 23:10:49,078 INFO L567 ElimStorePlain]: treesize reduction 260, result has 41.4 percent of original size [2019-10-14 23:10:49,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:49,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 132 [2019-10-14 23:10:49,085 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:49,114 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:207, output treesize:148 [2019-10-14 23:10:49,173 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_60|, |v_#memory_$Pointer$.offset_54|], 10=[|v_#memory_int_62|], 11=[|v_#memory_$Pointer$.base_62|]} [2019-10-14 23:10:49,177 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:49,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,240 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 65 treesize of output 11 [2019-10-14 23:10:49,240 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,295 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 49 treesize of output 34 [2019-10-14 23:10:49,296 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:49,356 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 91 treesize of output 54 [2019-10-14 23:10:49,357 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,622 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-10-14 23:10:49,622 INFO L341 Elim1Store]: treesize reduction 101, result has 64.1 percent of original size [2019-10-14 23:10:49,623 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 6 new quantified variables, introduced 7 case distinctions, treesize of input 209 treesize of output 248 [2019-10-14 23:10:49,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:49,702 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 15 xjuncts. [2019-10-14 23:10:49,938 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-10-14 23:10:49,939 INFO L567 ElimStorePlain]: treesize reduction 7138, result has 3.0 percent of original size [2019-10-14 23:10:49,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:49,941 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:391, output treesize:198 [2019-10-14 23:10:50,031 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 11=[|#memory_$Pointer$.base|]} [2019-10-14 23:10:50,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 10 [2019-10-14 23:10:50,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:50,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:50,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:50,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 172 treesize of output 137 [2019-10-14 23:10:50,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:50,171 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-14 23:10:50,244 INFO L567 ElimStorePlain]: treesize reduction 76, result has 39.2 percent of original size [2019-10-14 23:10:50,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:50,246 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:209, output treesize:37 [2019-10-14 23:10:50,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-14 23:10:50,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:50,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:50,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:50,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-10-14 23:10:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:50,393 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:50,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 20 [2019-10-14 23:10:50,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768904714] [2019-10-14 23:10:50,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-14 23:10:50,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:50,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-14 23:10:50,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:10:50,395 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 20 states. [2019-10-14 23:10:50,797 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-10-14 23:10:51,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:51,783 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2019-10-14 23:10:51,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 23:10:51,784 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2019-10-14 23:10:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:51,793 INFO L225 Difference]: With dead ends: 66 [2019-10-14 23:10:51,793 INFO L226 Difference]: Without dead ends: 64 [2019-10-14 23:10:51,794 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2019-10-14 23:10:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-14 23:10:51,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2019-10-14 23:10:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-14 23:10:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-10-14 23:10:51,817 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 29 [2019-10-14 23:10:51,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:51,818 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-10-14 23:10:51,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-14 23:10:51,818 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-10-14 23:10:51,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:10:51,822 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:51,822 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:52,036 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:52,036 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:52,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:52,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1682132144, now seen corresponding path program 5 times [2019-10-14 23:10:52,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:52,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761228208] [2019-10-14 23:10:52,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:52,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:52,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:52,595 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:52,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761228208] [2019-10-14 23:10:52,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277972779] [2019-10-14 23:10:52,595 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:52,714 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-14 23:10:52,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:52,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-14 23:10:52,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:52,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:52,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:52,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:52,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:52,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:10:52,784 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:52,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:52,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:52,805 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-10-14 23:10:52,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:52,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-10-14 23:10:52,838 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-14 23:10:52,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:52,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:52,857 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-14 23:10:52,858 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:52,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:52,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:52,875 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:54 [2019-10-14 23:10:52,930 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:52,931 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 22 treesize of output 32 [2019-10-14 23:10:52,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:52,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:52,982 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-10-14 23:10:52,982 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 1 case distinctions, treesize of input 45 treesize of output 31 [2019-10-14 23:10:52,983 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,050 INFO L567 ElimStorePlain]: treesize reduction 10, result has 85.3 percent of original size [2019-10-14 23:10:53,059 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 34 treesize of output 16 [2019-10-14 23:10:53,059 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,071 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:92, output treesize:37 [2019-10-14 23:10:53,142 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,142 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 83 [2019-10-14 23:10:53,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,179 INFO L567 ElimStorePlain]: treesize reduction 26, result has 78.7 percent of original size [2019-10-14 23:10:53,190 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 26 [2019-10-14 23:10:53,191 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,216 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:93 [2019-10-14 23:10:53,260 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_61|, |v_#memory_$Pointer$.base_63|], 6=[|v_#memory_$Pointer$.base_67|, |v_#memory_$Pointer$.offset_65|]} [2019-10-14 23:10:53,263 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:53,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,294 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:53,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,464 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-10-14 23:10:53,464 INFO L341 Elim1Store]: treesize reduction 52, result has 70.5 percent of original size [2019-10-14 23:10:53,465 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 6 new quantified variables, introduced 4 case distinctions, treesize of input 170 treesize of output 196 [2019-10-14 23:10:53,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:53,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:53,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:53,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:53,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:53,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:53,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:53,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:53,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:53,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:53,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:53,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:53,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:53,477 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 6 xjuncts. [2019-10-14 23:10:53,600 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-10-14 23:10:53,601 INFO L567 ElimStorePlain]: treesize reduction 1512, result has 10.6 percent of original size [2019-10-14 23:10:53,614 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,615 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 177 [2019-10-14 23:10:53,616 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:53,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:53,636 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:283, output treesize:101 [2019-10-14 23:10:53,782 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:10:53,925 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-10-14 23:10:53,926 INFO L341 Elim1Store]: treesize reduction 8, result has 93.8 percent of original size [2019-10-14 23:10:53,926 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 182 treesize of output 199 [2019-10-14 23:10:53,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:53,975 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:54,034 INFO L567 ElimStorePlain]: treesize reduction 165, result has 26.7 percent of original size [2019-10-14 23:10:54,045 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 39 [2019-10-14 23:10:54,046 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,055 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:191, output treesize:7 [2019-10-14 23:10:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:54,063 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:54,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-10-14 23:10:54,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482079785] [2019-10-14 23:10:54,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 23:10:54,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:54,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 23:10:54,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-10-14 23:10:54,065 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 22 states. [2019-10-14 23:10:54,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:54,616 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-10-14 23:10:54,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:10:54,617 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2019-10-14 23:10:54,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:54,617 INFO L225 Difference]: With dead ends: 61 [2019-10-14 23:10:54,618 INFO L226 Difference]: Without dead ends: 45 [2019-10-14 23:10:54,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2019-10-14 23:10:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-14 23:10:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-10-14 23:10:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-14 23:10:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-10-14 23:10:54,624 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 31 [2019-10-14 23:10:54,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:54,625 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-10-14 23:10:54,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 23:10:54,625 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-10-14 23:10:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:10:54,626 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:54,626 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:54,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:54,830 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:54,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:54,831 INFO L82 PathProgramCache]: Analyzing trace with hash -345469767, now seen corresponding path program 6 times [2019-10-14 23:10:54,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:54,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208813692] [2019-10-14 23:10:54,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:54,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:54,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:55,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208813692] [2019-10-14 23:10:55,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464965365] [2019-10-14 23:10:55,355 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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-14 23:10:55,485 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-10-14 23:10:55,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:55,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 79 conjunts are in the unsatisfiable core [2019-10-14 23:10:55,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:55,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:55,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:55,520 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:55,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,553 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-14 23:10:55,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-14 23:10:55,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:55,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:55,588 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,603 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-10-14 23:10:55,645 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,645 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 22 treesize of output 69 [2019-10-14 23:10:55,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,739 INFO L567 ElimStorePlain]: treesize reduction 28, result has 74.3 percent of original size [2019-10-14 23:10:55,747 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 23 treesize of output 11 [2019-10-14 23:10:55,747 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,799 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 23 treesize of output 11 [2019-10-14 23:10:55,800 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,828 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:79, output treesize:51 [2019-10-14 23:10:55,908 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 22 [2019-10-14 23:10:55,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,975 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,975 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2019-10-14 23:10:55,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:55,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:55,978 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,040 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.5 percent of original size [2019-10-14 23:10:56,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,042 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:99 [2019-10-14 23:10:56,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:56,145 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-10-14 23:10:56,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,206 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_63|], 5=[|v_#memory_$Pointer$.offset_70|, |v_#memory_$Pointer$.base_72|]} [2019-10-14 23:10:56,213 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 11 treesize of output 7 [2019-10-14 23:10:56,213 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:56,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:56,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:56,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 28 [2019-10-14 23:10:56,264 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,304 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,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, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 52 [2019-10-14 23:10:56,305 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,353 INFO L567 ElimStorePlain]: treesize reduction 24, result has 80.3 percent of original size [2019-10-14 23:10:56,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,354 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:148, output treesize:98 [2019-10-14 23:10:56,410 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_64|], 3=[|v_#memory_$Pointer$.offset_71|, |v_#memory_$Pointer$.base_73|]} [2019-10-14 23:10:56,415 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 55 treesize of output 19 [2019-10-14 23:10:56,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:56,456 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 46 treesize of output 40 [2019-10-14 23:10:56,457 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,512 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,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, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 112 [2019-10-14 23:10:56,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:56,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:56,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:56,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:56,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:56,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:56,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:56,517 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,567 INFO L567 ElimStorePlain]: treesize reduction 36, result has 74.6 percent of original size [2019-10-14 23:10:56,568 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-14 23:10:56,568 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:197, output treesize:127 [2019-10-14 23:10:56,622 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_68|, |v_#memory_$Pointer$.offset_66|], 4=[|v_#memory_int_65|], 9=[|v_#memory_$Pointer$.base_74|, |v_#memory_$Pointer$.offset_72|]} [2019-10-14 23:10:56,626 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:56,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,682 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:56,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:56,728 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 74 treesize of output 38 [2019-10-14 23:10:56,728 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,959 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-10-14 23:10:56,959 INFO L341 Elim1Store]: treesize reduction 95, result has 62.5 percent of original size [2019-10-14 23:10:56,960 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 6 new quantified variables, introduced 7 case distinctions, treesize of input 201 treesize of output 232 [2019-10-14 23:10:56,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:56,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:56,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:56,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:56,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:56,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:56,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:56,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:56,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:56,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:56,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:56,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:56,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:56,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:56,973 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2019-10-14 23:10:57,146 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-10-14 23:10:57,147 INFO L567 ElimStorePlain]: treesize reduction 784, result has 21.3 percent of original size [2019-10-14 23:10:57,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:57,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:57,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:57,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:57,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 217 [2019-10-14 23:10:57,163 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:57,213 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:346, output treesize:173 [2019-10-14 23:10:57,402 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:10:57,499 INFO L341 Elim1Store]: treesize reduction 16, result has 84.9 percent of original size [2019-10-14 23:10:57,500 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 8 new quantified variables, introduced 10 case distinctions, treesize of input 197 treesize of output 167 [2019-10-14 23:10:57,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:57,541 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:57,612 INFO L567 ElimStorePlain]: treesize reduction 74, result has 52.6 percent of original size [2019-10-14 23:10:57,619 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 29 [2019-10-14 23:10:57,620 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:57,637 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:204, output treesize:22 [2019-10-14 23:10:57,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-14 23:10:57,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-10-14 23:10:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:57,699 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:57,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 22 [2019-10-14 23:10:57,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735453904] [2019-10-14 23:10:57,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 23:10:57,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:57,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 23:10:57,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-10-14 23:10:57,701 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 22 states. [2019-10-14 23:10:58,098 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-10-14 23:10:58,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:58,593 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-10-14 23:10:58,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 23:10:58,593 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-14 23:10:58,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:58,595 INFO L225 Difference]: With dead ends: 57 [2019-10-14 23:10:58,595 INFO L226 Difference]: Without dead ends: 55 [2019-10-14 23:10:58,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2019-10-14 23:10:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-14 23:10:58,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2019-10-14 23:10:58,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-14 23:10:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-10-14 23:10:58,603 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 32 [2019-10-14 23:10:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:58,604 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-10-14 23:10:58,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 23:10:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-10-14 23:10:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 23:10:58,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:58,605 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:58,809 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:58,810 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:58,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:58,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1143325495, now seen corresponding path program 7 times [2019-10-14 23:10:58,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:58,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527607687] [2019-10-14 23:10:58,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:58,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:58,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:59,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527607687] [2019-10-14 23:10:59,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569908815] [2019-10-14 23:10:59,420 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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-14 23:10:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:59,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 83 conjunts are in the unsatisfiable core [2019-10-14 23:10:59,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:59,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:59,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:59,607 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:59,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,635 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-14 23:10:59,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,635 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-14 23:10:59,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:59,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:59,664 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,680 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-10-14 23:10:59,723 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,723 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 22 treesize of output 69 [2019-10-14 23:10:59,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,798 INFO L567 ElimStorePlain]: treesize reduction 28, result has 74.3 percent of original size [2019-10-14 23:10:59,812 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 23 treesize of output 11 [2019-10-14 23:10:59,812 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,839 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 23 treesize of output 11 [2019-10-14 23:10:59,839 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,865 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:79, output treesize:51 [2019-10-14 23:10:59,919 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,920 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 72 [2019-10-14 23:10:59,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:59,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,974 INFO L567 ElimStorePlain]: treesize reduction 24, result has 79.7 percent of original size [2019-10-14 23:10:59,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:59,982 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 22 [2019-10-14 23:10:59,982 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:99 [2019-10-14 23:11:00,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:00,101 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-10-14 23:11:00,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,184 INFO L341 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-10-14 23:11:00,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 75 [2019-10-14 23:11:00,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,189 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:00,252 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.2 percent of original size [2019-10-14 23:11:00,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:00,257 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 37 treesize of output 24 [2019-10-14 23:11:00,257 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,289 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:137, output treesize:67 [2019-10-14 23:11:00,368 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,369 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 3 case distinctions, treesize of input 144 treesize of output 116 [2019-10-14 23:11:00,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,428 INFO L567 ElimStorePlain]: treesize reduction 64, result has 64.8 percent of original size [2019-10-14 23:11:00,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:00,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:00,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:00,440 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 46 treesize of output 40 [2019-10-14 23:11:00,440 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,464 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:158, output treesize:127 [2019-10-14 23:11:00,531 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_66|], 2=[|v_#memory_$Pointer$.offset_73|, |v_#memory_$Pointer$.base_75|], 9=[|v_#memory_$Pointer$.base_81|, |v_#memory_$Pointer$.offset_79|]} [2019-10-14 23:11:00,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:00,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 31 [2019-10-14 23:11:00,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,587 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:00,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,625 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:00,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,864 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-10-14 23:11:00,864 INFO L341 Elim1Store]: treesize reduction 69, result has 70.1 percent of original size [2019-10-14 23:11:00,865 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 8 new quantified variables, introduced 7 case distinctions, treesize of input 246 treesize of output 255 [2019-10-14 23:11:00,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:00,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:00,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:00,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:00,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:00,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:00,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:00,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:00,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:00,875 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,097 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2019-10-14 23:11:01,097 INFO L567 ElimStorePlain]: treesize reduction 26905, result has 0.9 percent of original size [2019-10-14 23:11:01,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:01,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:01,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:01,122 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,123 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 236 [2019-10-14 23:11:01,124 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,154 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:439, output treesize:154 [2019-10-14 23:11:01,354 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:01,509 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-10-14 23:11:01,510 INFO L341 Elim1Store]: treesize reduction 24, result has 83.1 percent of original size [2019-10-14 23:11:01,510 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 218 treesize of output 210 [2019-10-14 23:11:01,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,697 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:01,790 INFO L567 ElimStorePlain]: treesize reduction 155, result has 34.6 percent of original size [2019-10-14 23:11:01,802 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 42 [2019-10-14 23:11:01,803 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,820 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:225, output treesize:11 [2019-10-14 23:11:01,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 23:11:01,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-14 23:11:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:01,859 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:01,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 24 [2019-10-14 23:11:01,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382365180] [2019-10-14 23:11:01,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-14 23:11:01,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:01,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-14 23:11:01,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2019-10-14 23:11:01,860 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 24 states. [2019-10-14 23:11:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:02,698 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-10-14 23:11:02,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 23:11:02,698 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2019-10-14 23:11:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:02,699 INFO L225 Difference]: With dead ends: 60 [2019-10-14 23:11:02,699 INFO L226 Difference]: Without dead ends: 58 [2019-10-14 23:11:02,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2019-10-14 23:11:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-14 23:11:02,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2019-10-14 23:11:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-14 23:11:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-10-14 23:11:02,708 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 35 [2019-10-14 23:11:02,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:02,709 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-10-14 23:11:02,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-14 23:11:02,709 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-10-14 23:11:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-14 23:11:02,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:02,710 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:02,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:02,914 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:02,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:02,914 INFO L82 PathProgramCache]: Analyzing trace with hash -822332832, now seen corresponding path program 8 times [2019-10-14 23:11:02,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:02,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994361894] [2019-10-14 23:11:02,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:02,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:02,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:03,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994361894] [2019-10-14 23:11:03,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750764117] [2019-10-14 23:11:03,544 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:03,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:11:03,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:03,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 84 conjunts are in the unsatisfiable core [2019-10-14 23:11:03,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:03,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:03,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:03,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:03,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:03,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:03,702 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:03,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:03,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:03,731 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-14 23:11:03,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:03,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-14 23:11:03,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:03,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:03,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:03,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:03,761 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:03,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:03,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:03,798 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-10-14 23:11:03,837 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:03,837 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 22 treesize of output 69 [2019-10-14 23:11:03,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:03,921 INFO L567 ElimStorePlain]: treesize reduction 28, result has 73.6 percent of original size [2019-10-14 23:11:03,926 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 23 treesize of output 11 [2019-10-14 23:11:03,926 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:03,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:03,962 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 23 treesize of output 11 [2019-10-14 23:11:03,962 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:03,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:03,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:03,979 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:76, output treesize:48 [2019-10-14 23:11:04,038 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,039 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 72 [2019-10-14 23:11:04,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,095 INFO L567 ElimStorePlain]: treesize reduction 24, result has 79.7 percent of original size [2019-10-14 23:11:04,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,102 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 22 [2019-10-14 23:11:04,102 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,126 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:110, output treesize:88 [2019-10-14 23:11:04,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,230 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 159 [2019-10-14 23:11:04,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,353 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-10-14 23:11:04,354 INFO L567 ElimStorePlain]: treesize reduction 78, result has 66.9 percent of original size [2019-10-14 23:11:04,357 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_67|], 5=[|v_#memory_$Pointer$.offset_84|, |v_#memory_$Pointer$.base_86|]} [2019-10-14 23:11:04,361 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 11 treesize of output 7 [2019-10-14 23:11:04,361 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2019-10-14 23:11:04,421 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,512 INFO L341 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-10-14 23:11:04,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, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 78 [2019-10-14 23:11:04,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,515 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:04,588 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.7 percent of original size [2019-10-14 23:11:04,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,589 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:140, output treesize:92 [2019-10-14 23:11:04,657 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_68|], 5=[|v_#memory_$Pointer$.base_87|, |v_#memory_$Pointer$.offset_85|]} [2019-10-14 23:11:04,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,663 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 83 treesize of output 27 [2019-10-14 23:11:04,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,751 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,752 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 193 treesize of output 160 [2019-10-14 23:11:04,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:04,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:04,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:04,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:04,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,763 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-10-14 23:11:04,915 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-10-14 23:11:04,916 INFO L567 ElimStorePlain]: treesize reduction 609, result has 25.3 percent of original size [2019-10-14 23:11:04,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,924 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 161 [2019-10-14 23:11:04,924 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,963 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:276, output treesize:231 [2019-10-14 23:11:05,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:05,074 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:05,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 82 [2019-10-14 23:11:05,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:05,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:05,128 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_69|], 5=[|v_#memory_$Pointer$.offset_86|], 11=[|v_#memory_$Pointer$.base_88|]} [2019-10-14 23:11:05,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:05,135 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 35 treesize of output 34 [2019-10-14 23:11:05,135 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:05,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:05,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:05,233 INFO L341 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2019-10-14 23:11:05,234 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 2 case distinctions, treesize of input 187 treesize of output 158 [2019-10-14 23:11:05,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:05,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:05,236 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:05,334 INFO L567 ElimStorePlain]: treesize reduction 20, result has 91.4 percent of original size [2019-10-14 23:11:05,446 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-10-14 23:11:05,446 INFO L341 Elim1Store]: treesize reduction 64, result has 57.3 percent of original size [2019-10-14 23:11:05,447 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 6 case distinctions, treesize of input 191 treesize of output 141 [2019-10-14 23:11:05,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:05,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:05,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:05,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:05,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:05,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:05,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:05,451 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:05,542 INFO L567 ElimStorePlain]: treesize reduction 40, result has 73.0 percent of original size [2019-10-14 23:11:05,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:05,543 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:277, output treesize:146 [2019-10-14 23:11:05,618 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.offset_87|], 6=[|v_#memory_int_70|], 11=[|v_#memory_$Pointer$.base_89|]} [2019-10-14 23:11:05,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:05,653 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:05,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 406 treesize of output 361 [2019-10-14 23:11:05,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:05,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:05,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:05,782 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-10-14 23:11:05,782 INFO L567 ElimStorePlain]: treesize reduction 88, result has 83.2 percent of original size [2019-10-14 23:11:05,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:05,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 59 [2019-10-14 23:11:05,789 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:05,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:05,921 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:05,921 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 336 treesize of output 233 [2019-10-14 23:11:05,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:05,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:05,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:05,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:05,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:05,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:05,927 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:06,097 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-10-14 23:11:06,098 INFO L567 ElimStorePlain]: treesize reduction 984, result has 24.8 percent of original size [2019-10-14 23:11:06,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:06,099 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:461, output treesize:374 [2019-10-14 23:11:06,192 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_80|, |v_#memory_$Pointer$.base_82|], 5=[|v_#memory_$Pointer$.offset_88|], 10=[|v_#memory_int_71|], 19=[|v_#memory_$Pointer$.base_90|]} [2019-10-14 23:11:06,195 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:06,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:06,273 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:06,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:06,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:06,445 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-10-14 23:11:06,445 INFO L341 Elim1Store]: treesize reduction 82, result has 57.7 percent of original size [2019-10-14 23:11:06,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 562 treesize of output 509 [2019-10-14 23:11:06,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:06,448 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:06,604 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-10-14 23:11:06,604 INFO L567 ElimStorePlain]: treesize reduction 173, result has 77.4 percent of original size [2019-10-14 23:11:06,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:06,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 94 [2019-10-14 23:11:06,612 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:06,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,055 WARN L191 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 103 [2019-10-14 23:11:07,056 INFO L341 Elim1Store]: treesize reduction 126, result has 67.4 percent of original size [2019-10-14 23:11:07,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 512 treesize of output 367 [2019-10-14 23:11:07,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:07,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:07,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:07,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:07,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:07,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:07,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:07,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:07,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:07,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:07,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:07,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:07,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:07,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:07,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:07,079 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,507 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 69 [2019-10-14 23:11:07,507 INFO L567 ElimStorePlain]: treesize reduction 53832, result has 1.0 percent of original size [2019-10-14 23:11:07,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:07,509 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:785, output treesize:452 [2019-10-14 23:11:07,682 INFO L392 ElimStorePlain]: Different costs {11=[|#memory_$Pointer$.offset|], 29=[|#memory_$Pointer$.base|]} [2019-10-14 23:11:07,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:07,730 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 455 treesize of output 389 [2019-10-14 23:11:07,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,816 INFO L567 ElimStorePlain]: treesize reduction 38, result has 89.4 percent of original size [2019-10-14 23:11:07,909 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,909 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 320 treesize of output 216 [2019-10-14 23:11:07,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:07,961 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-14 23:11:08,047 INFO L567 ElimStorePlain]: treesize reduction 136, result has 31.3 percent of original size [2019-10-14 23:11:08,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:08,048 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:483, output treesize:34 [2019-10-14 23:11:08,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-14 23:11:08,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:08,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2019-10-14 23:11:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:08,162 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:08,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 26 [2019-10-14 23:11:08,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920025219] [2019-10-14 23:11:08,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-14 23:11:08,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:08,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-14 23:11:08,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2019-10-14 23:11:08,164 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 26 states. [2019-10-14 23:11:08,586 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-10-14 23:11:09,002 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-10-14 23:11:09,241 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 88 [2019-10-14 23:11:09,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:09,963 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-10-14 23:11:09,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-14 23:11:09,963 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-10-14 23:11:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:09,964 INFO L225 Difference]: With dead ends: 73 [2019-10-14 23:11:09,965 INFO L226 Difference]: Without dead ends: 71 [2019-10-14 23:11:09,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=196, Invalid=1526, Unknown=0, NotChecked=0, Total=1722 [2019-10-14 23:11:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-14 23:11:09,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2019-10-14 23:11:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-14 23:11:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-14 23:11:09,975 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 36 [2019-10-14 23:11:09,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:09,975 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-14 23:11:09,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-14 23:11:09,975 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-14 23:11:09,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-14 23:11:09,976 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:09,977 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:10,178 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:10,179 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:10,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:10,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1004692923, now seen corresponding path program 9 times [2019-10-14 23:11:10,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:10,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146774205] [2019-10-14 23:11:10,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:10,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:10,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-14 23:11:10,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146774205] [2019-10-14 23:11:10,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406172647] [2019-10-14 23:11:10,512 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:10,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-14 23:11:10,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:10,950 WARN L254 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 106 conjunts are in the unsatisfiable core [2019-10-14 23:11:10,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:10,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:10,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:10,989 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:10,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,019 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-14 23:11:11,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-14 23:11:11,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:11,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:11,059 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-10-14 23:11:11,120 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,121 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 22 treesize of output 69 [2019-10-14 23:11:11,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,229 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-14 23:11:11,230 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.7 percent of original size [2019-10-14 23:11:11,231 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_72|], 2=[|v_#memory_$Pointer$.offset_91|, |v_#memory_$Pointer$.base_93|]} [2019-10-14 23:11:11,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:11,236 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,283 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 23 treesize of output 11 [2019-10-14 23:11:11,283 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,315 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 23 treesize of output 11 [2019-10-14 23:11:11,315 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,338 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:58 [2019-10-14 23:11:11,387 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_73|], 1=[|v_#memory_$Pointer$.offset_92|, |v_#memory_$Pointer$.base_94|]} [2019-10-14 23:11:11,391 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-14 23:11:11,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,429 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 22 [2019-10-14 23:11:11,430 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,477 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,478 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 75 [2019-10-14 23:11:11,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,479 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,539 INFO L567 ElimStorePlain]: treesize reduction 24, result has 80.2 percent of original size [2019-10-14 23:11:11,540 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-14 23:11:11,541 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:148, output treesize:110 [2019-10-14 23:11:11,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:11,626 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-10-14 23:11:11,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,672 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_74|], 5=[|v_#memory_$Pointer$.offset_93|, |v_#memory_$Pointer$.base_95|]} [2019-10-14 23:11:11,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:11,677 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 23 treesize of output 22 [2019-10-14 23:11:11,678 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:11,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:11,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:11,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 28 [2019-10-14 23:11:11,730 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,815 INFO L341 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-10-14 23:11:11,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 82 [2019-10-14 23:11:11,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,819 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:11,891 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.0 percent of original size [2019-10-14 23:11:11,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,892 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:159, output treesize:93 [2019-10-14 23:11:11,943 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_96|, |v_#memory_$Pointer$.offset_94|], 6=[|v_#memory_int_75|]} [2019-10-14 23:11:11,981 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,982 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 277 treesize of output 204 [2019-10-14 23:11:11,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:11,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:11,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:12,155 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-10-14 23:11:12,155 INFO L567 ElimStorePlain]: treesize reduction 1279, result has 16.5 percent of original size [2019-10-14 23:11:12,242 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:12,243 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 3 case distinctions, treesize of input 225 treesize of output 270 [2019-10-14 23:11:12,244 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:12,355 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-10-14 23:11:12,356 INFO L567 ElimStorePlain]: treesize reduction 76, result has 69.2 percent of original size [2019-10-14 23:11:12,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:12,363 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 66 treesize of output 33 [2019-10-14 23:11:12,363 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:12,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:12,395 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-14 23:11:12,395 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:291, output treesize:153 [2019-10-14 23:11:12,447 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_int_76|], 9=[|v_#memory_$Pointer$.base_97|, |v_#memory_$Pointer$.offset_95|]} [2019-10-14 23:11:12,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:12,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:12,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:12,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-10-14 23:11:12,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:12,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:12,591 INFO L341 Elim1Store]: treesize reduction 60, result has 53.8 percent of original size [2019-10-14 23:11:12,591 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 126 [2019-10-14 23:11:12,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,597 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:12,682 INFO L567 ElimStorePlain]: treesize reduction 48, result has 70.9 percent of original size [2019-10-14 23:11:12,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:12,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:12,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:12,691 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 52 treesize of output 38 [2019-10-14 23:11:12,691 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:12,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:12,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:12,726 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:197, output treesize:127 [2019-10-14 23:11:12,781 INFO L392 ElimStorePlain]: Different costs {9=[|v_#memory_$Pointer$.base_98|, |v_#memory_$Pointer$.offset_96|], 11=[|v_#memory_int_77|]} [2019-10-14 23:11:12,846 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:12,846 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 354 treesize of output 251 [2019-10-14 23:11:12,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:12,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:12,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:12,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:12,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:12,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 23:11:13,067 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-10-14 23:11:13,067 INFO L567 ElimStorePlain]: treesize reduction 5725, result has 5.8 percent of original size [2019-10-14 23:11:13,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:13,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:13,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:13,074 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 345 treesize of output 269 [2019-10-14 23:11:13,075 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:13,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:13,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:13,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 67 [2019-10-14 23:11:13,129 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:13,170 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-14 23:11:13,170 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:364, output treesize:220 [2019-10-14 23:11:13,229 INFO L392 ElimStorePlain]: Different costs {9=[|v_#memory_$Pointer$.base_99|], 11=[|v_#memory_int_78|], 17=[|v_#memory_$Pointer$.offset_97|]} [2019-10-14 23:11:13,317 INFO L341 Elim1Store]: treesize reduction 60, result has 53.8 percent of original size [2019-10-14 23:11:13,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 225 treesize of output 153