/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 19:23:25,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 19:23:25,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 19:23:25,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 19:23:25,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 19:23:25,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 19:23:25,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 19:23:25,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 19:23:25,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 19:23:25,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 19:23:25,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 19:23:25,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 19:23:25,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 19:23:25,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 19:23:25,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 19:23:25,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 19:23:25,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 19:23:25,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 19:23:25,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 19:23:25,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 19:23:25,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 19:23:25,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 19:23:25,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 19:23:25,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 19:23:25,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 19:23:25,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 19:23:25,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 19:23:25,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 19:23:25,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 19:23:25,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 19:23:25,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 19:23:25,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 19:23:25,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 19:23:25,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 19:23:25,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 19:23:25,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 19:23:25,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 19:23:25,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 19:23:25,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 19:23:25,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 19:23:25,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 19:23:25,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 19:23:25,571 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 19:23:25,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 19:23:25,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 19:23:25,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 19:23:25,575 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 19:23:25,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 19:23:25,576 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 19:23:25,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 19:23:25,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 19:23:25,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 19:23:25,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 19:23:25,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 19:23:25,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 19:23:25,578 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 19:23:25,579 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 19:23:25,579 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 19:23:25,579 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 19:23:25,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 19:23:25,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 19:23:25,580 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 19:23:25,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 19:23:25,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 19:23:25,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 19:23:25,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 19:23:25,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 19:23:25,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 19:23:25,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 19:23:25,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 19:23:25,585 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 19:23:25,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 19:23:25,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 19:23:25,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 19:23:25,911 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 19:23:25,912 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 19:23:25,913 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-1.i [2019-11-06 19:23:25,978 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f64caa816/785604b7b4b840f2b34677d2205c94a4/FLAGc2bffd159 [2019-11-06 19:23:26,503 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 19:23:26,503 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-1.i [2019-11-06 19:23:26,516 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f64caa816/785604b7b4b840f2b34677d2205c94a4/FLAGc2bffd159 [2019-11-06 19:23:26,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f64caa816/785604b7b4b840f2b34677d2205c94a4 [2019-11-06 19:23:26,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 19:23:26,855 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 19:23:26,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 19:23:26,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 19:23:26,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 19:23:26,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:23:26" (1/1) ... [2019-11-06 19:23:26,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ba0a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:26, skipping insertion in model container [2019-11-06 19:23:26,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:23:26" (1/1) ... [2019-11-06 19:23:26,872 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 19:23:26,916 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 19:23:27,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:23:27,405 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 19:23:27,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:23:27,546 INFO L192 MainTranslator]: Completed translation [2019-11-06 19:23:27,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:27 WrapperNode [2019-11-06 19:23:27,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 19:23:27,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 19:23:27,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 19:23:27,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 19:23:27,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:27" (1/1) ... [2019-11-06 19:23:27,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:27" (1/1) ... [2019-11-06 19:23:27,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:27" (1/1) ... [2019-11-06 19:23:27,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:27" (1/1) ... [2019-11-06 19:23:27,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:27" (1/1) ... [2019-11-06 19:23:27,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:27" (1/1) ... [2019-11-06 19:23:27,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:27" (1/1) ... [2019-11-06 19:23:27,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 19:23:27,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 19:23:27,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 19:23:27,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 19:23:27,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 19:23:27,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 19:23:27,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 19:23:27,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 19:23:27,669 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 19:23:27,669 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 19:23:27,669 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 19:23:27,669 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 19:23:27,669 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 19:23:27,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 19:23:27,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 19:23:27,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 19:23:27,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 19:23:27,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 19:23:27,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 19:23:27,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 19:23:27,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 19:23:27,672 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 19:23:27,672 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 19:23:27,672 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 19:23:27,672 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 19:23:27,672 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 19:23:27,672 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 19:23:27,673 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 19:23:27,673 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 19:23:27,673 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 19:23:27,673 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 19:23:27,673 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 19:23:27,673 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 19:23:27,673 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 19:23:27,674 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 19:23:27,674 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 19:23:27,674 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 19:23:27,674 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 19:23:27,674 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 19:23:27,674 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 19:23:27,675 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 19:23:27,675 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 19:23:27,675 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 19:23:27,675 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 19:23:27,675 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 19:23:27,675 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 19:23:27,675 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 19:23:27,676 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 19:23:27,676 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 19:23:27,676 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 19:23:27,676 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 19:23:27,676 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 19:23:27,676 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 19:23:27,677 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 19:23:27,677 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 19:23:27,677 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 19:23:27,677 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 19:23:27,677 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 19:23:27,677 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 19:23:27,677 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 19:23:27,678 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 19:23:27,678 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 19:23:27,678 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 19:23:27,678 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 19:23:27,678 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 19:23:27,678 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 19:23:27,678 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 19:23:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 19:23:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 19:23:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 19:23:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 19:23:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 19:23:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 19:23:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 19:23:27,680 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 19:23:27,680 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 19:23:27,680 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 19:23:27,680 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 19:23:27,680 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 19:23:27,680 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 19:23:27,681 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 19:23:27,681 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 19:23:27,681 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 19:23:27,681 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 19:23:27,681 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 19:23:27,681 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 19:23:27,682 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 19:23:27,682 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 19:23:27,682 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 19:23:27,682 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 19:23:27,682 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 19:23:27,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 19:23:27,682 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 19:23:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 19:23:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 19:23:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 19:23:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 19:23:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 19:23:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 19:23:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 19:23:27,684 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 19:23:27,684 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 19:23:27,684 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 19:23:27,684 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 19:23:27,684 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 19:23:27,684 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 19:23:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 19:23:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 19:23:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 19:23:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 19:23:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 19:23:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 19:23:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 19:23:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 19:23:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 19:23:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 19:23:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 19:23:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 19:23:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 19:23:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 19:23:27,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 19:23:27,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 19:23:28,216 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 19:23:28,217 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-06 19:23:28,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:23:28 BoogieIcfgContainer [2019-11-06 19:23:28,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 19:23:28,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 19:23:28,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 19:23:28,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 19:23:28,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:23:26" (1/3) ... [2019-11-06 19:23:28,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118ab64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:23:28, skipping insertion in model container [2019-11-06 19:23:28,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:27" (2/3) ... [2019-11-06 19:23:28,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118ab64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:23:28, skipping insertion in model container [2019-11-06 19:23:28,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:23:28" (3/3) ... [2019-11-06 19:23:28,227 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-1.i [2019-11-06 19:23:28,237 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 19:23:28,244 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-06 19:23:28,256 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-06 19:23:28,280 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 19:23:28,281 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 19:23:28,281 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 19:23:28,281 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 19:23:28,281 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 19:23:28,281 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 19:23:28,282 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 19:23:28,282 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 19:23:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-11-06 19:23:28,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-06 19:23:28,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:28,306 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:28,307 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:28,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:28,313 INFO L82 PathProgramCache]: Analyzing trace with hash -742552803, now seen corresponding path program 1 times [2019-11-06 19:23:28,321 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:28,321 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705031142] [2019-11-06 19:23:28,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:28,524 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705031142] [2019-11-06 19:23:28,526 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:28,527 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 19:23:28,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492523004] [2019-11-06 19:23:28,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 19:23:28,534 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:28,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 19:23:28,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 19:23:28,552 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-11-06 19:23:28,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:28,692 INFO L93 Difference]: Finished difference Result 67 states and 104 transitions. [2019-11-06 19:23:28,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 19:23:28,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-06 19:23:28,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:28,711 INFO L225 Difference]: With dead ends: 67 [2019-11-06 19:23:28,711 INFO L226 Difference]: Without dead ends: 31 [2019-11-06 19:23:28,720 INFO L630 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-11-06 19:23:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-06 19:23:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-06 19:23:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-06 19:23:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-11-06 19:23:28,777 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 10 [2019-11-06 19:23:28,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:28,778 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-11-06 19:23:28,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 19:23:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-11-06 19:23:28,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-06 19:23:28,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:28,779 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:28,780 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:28,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:28,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1556669446, now seen corresponding path program 1 times [2019-11-06 19:23:28,781 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:28,781 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275789488] [2019-11-06 19:23:28,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:28,920 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275789488] [2019-11-06 19:23:28,920 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:28,920 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 19:23:28,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090024084] [2019-11-06 19:23:28,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 19:23:28,922 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:28,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 19:23:28,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 19:23:28,923 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2019-11-06 19:23:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:29,054 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-11-06 19:23:29,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 19:23:29,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-06 19:23:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:29,056 INFO L225 Difference]: With dead ends: 34 [2019-11-06 19:23:29,056 INFO L226 Difference]: Without dead ends: 32 [2019-11-06 19:23:29,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:23:29,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-06 19:23:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-11-06 19:23:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-06 19:23:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-11-06 19:23:29,069 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2019-11-06 19:23:29,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:29,069 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-11-06 19:23:29,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 19:23:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-11-06 19:23:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 19:23:29,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:29,073 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:29,073 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:29,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:29,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1973625457, now seen corresponding path program 1 times [2019-11-06 19:23:29,074 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:29,074 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249001881] [2019-11-06 19:23:29,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:29,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:29,233 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249001881] [2019-11-06 19:23:29,234 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:29,234 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:23:29,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400669353] [2019-11-06 19:23:29,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:23:29,235 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:29,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:23:29,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:23:29,235 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 6 states. [2019-11-06 19:23:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:29,397 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-11-06 19:23:29,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:23:29,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-06 19:23:29,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:29,398 INFO L225 Difference]: With dead ends: 54 [2019-11-06 19:23:29,399 INFO L226 Difference]: Without dead ends: 52 [2019-11-06 19:23:29,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 19:23:29,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-06 19:23:29,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2019-11-06 19:23:29,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-06 19:23:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-06 19:23:29,407 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 14 [2019-11-06 19:23:29,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:29,408 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-06 19:23:29,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:23:29,408 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-06 19:23:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 19:23:29,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:29,409 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:29,409 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:29,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:29,410 INFO L82 PathProgramCache]: Analyzing trace with hash -954667545, now seen corresponding path program 1 times [2019-11-06 19:23:29,410 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:29,410 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452554833] [2019-11-06 19:23:29,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:29,697 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452554833] [2019-11-06 19:23:29,697 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295473402] [2019-11-06 19:23:29,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:29,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-06 19:23:29,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:29,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:23:29,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:29,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:29,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:23:29,943 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:29,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:29,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:29,957 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-11-06 19:23:30,024 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,025 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-11-06 19:23:30,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,074 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2019-11-06 19:23:30,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:30,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-06 19:23:30,086 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-06 19:23:30,108 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,133 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:59, output treesize:27 [2019-11-06 19:23:30,210 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,210 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-11-06 19:23:30,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,250 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_26|, |v_#memory_int_27|], 4=[|v_#memory_int_29|]} [2019-11-06 19:23:30,258 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:30,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,290 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:30,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:30,349 INFO L341 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2019-11-06 19:23:30,349 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 2 case distinctions, treesize of input 52 treesize of output 45 [2019-11-06 19:23:30,350 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:30,371 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:80, output treesize:43 [2019-11-06 19:23:30,477 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 33 treesize of output 13 [2019-11-06 19:23:30,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-11-06 19:23:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:30,490 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:30,491 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-06 19:23:30,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615935646] [2019-11-06 19:23:30,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 19:23:30,492 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:30,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 19:23:30,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-06 19:23:30,493 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 12 states. [2019-11-06 19:23:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:31,098 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2019-11-06 19:23:31,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 19:23:31,098 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-11-06 19:23:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:31,100 INFO L225 Difference]: With dead ends: 62 [2019-11-06 19:23:31,101 INFO L226 Difference]: Without dead ends: 60 [2019-11-06 19:23:31,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-11-06 19:23:31,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-06 19:23:31,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 27. [2019-11-06 19:23:31,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-06 19:23:31,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-06 19:23:31,108 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2019-11-06 19:23:31,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:31,108 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-06 19:23:31,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 19:23:31,109 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-11-06 19:23:31,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 19:23:31,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:31,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:31,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:31,320 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:31,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:31,321 INFO L82 PathProgramCache]: Analyzing trace with hash 903516662, now seen corresponding path program 1 times [2019-11-06 19:23:31,321 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:31,321 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537637108] [2019-11-06 19:23:31,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:31,444 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537637108] [2019-11-06 19:23:31,444 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:31,445 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:23:31,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445550072] [2019-11-06 19:23:31,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:23:31,446 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:31,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:23:31,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:23:31,446 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2019-11-06 19:23:31,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:31,547 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-11-06 19:23:31,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 19:23:31,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-06 19:23:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:31,548 INFO L225 Difference]: With dead ends: 42 [2019-11-06 19:23:31,548 INFO L226 Difference]: Without dead ends: 30 [2019-11-06 19:23:31,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:23:31,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-06 19:23:31,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-11-06 19:23:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-06 19:23:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-11-06 19:23:31,553 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 18 [2019-11-06 19:23:31,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:31,554 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-11-06 19:23:31,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:23:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-11-06 19:23:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 19:23:31,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:31,555 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:31,555 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:31,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:31,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1223911862, now seen corresponding path program 1 times [2019-11-06 19:23:31,556 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:31,556 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507048141] [2019-11-06 19:23:31,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:31,630 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507048141] [2019-11-06 19:23:31,630 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69091469] [2019-11-06 19:23:31,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:31,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-06 19:23:31,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:31,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:31,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-11-06 19:23:31,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:31,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:31,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:31,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-11-06 19:23:31,776 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:31,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:31,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:31,784 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:18 [2019-11-06 19:23:31,827 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-11-06 19:23:31,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:31,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:31,839 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-11-06 19:23:31,840 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:31,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:31,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:31,846 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-06 19:23:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:31,849 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:31,849 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-11-06 19:23:31,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416903457] [2019-11-06 19:23:31,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 19:23:31,851 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:31,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 19:23:31,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-06 19:23:31,852 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2019-11-06 19:23:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:32,011 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2019-11-06 19:23:32,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:23:32,012 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-06 19:23:32,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:32,012 INFO L225 Difference]: With dead ends: 53 [2019-11-06 19:23:32,012 INFO L226 Difference]: Without dead ends: 31 [2019-11-06 19:23:32,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-06 19:23:32,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-06 19:23:32,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-06 19:23:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-06 19:23:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-11-06 19:23:32,017 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 21 [2019-11-06 19:23:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:32,018 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-11-06 19:23:32,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 19:23:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-11-06 19:23:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 19:23:32,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:32,019 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:32,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:32,223 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:32,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:32,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1223476830, now seen corresponding path program 1 times [2019-11-06 19:23:32,224 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:32,224 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870880039] [2019-11-06 19:23:32,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:32,427 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870880039] [2019-11-06 19:23:32,427 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597432427] [2019-11-06 19:23:32,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:32,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-06 19:23:32,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:32,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:23:32,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:32,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:32,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:32,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:23:32,574 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:32,574 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-11-06 19:23:32,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:32,642 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-11-06 19:23:32,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:32,650 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:32,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:32,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:32,679 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:32,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:32,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:32,700 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-11-06 19:23:32,780 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:32,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-06 19:23:32,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:32,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:32,873 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.base_22|], 4=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_24|]} [2019-11-06 19:23:32,877 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:32,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:32,942 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:32,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:33,075 INFO L341 Elim1Store]: treesize reduction 16, result has 80.5 percent of original size [2019-11-06 19:23:33,076 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 5 case distinctions, treesize of input 151 treesize of output 134 [2019-11-06 19:23:33,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,086 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:33,180 INFO L567 ElimStorePlain]: treesize reduction 182, result has 38.9 percent of original size [2019-11-06 19:23:33,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:33,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:33,190 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 97 treesize of output 65 [2019-11-06 19:23:33,191 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:33,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:33,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:33,217 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:218, output treesize:76 [2019-11-06 19:23:33,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:33,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:33,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2019-11-06 19:23:33,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:33,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:33,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:33,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:50 [2019-11-06 19:23:33,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:33,382 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 59 treesize of output 49 [2019-11-06 19:23:33,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:33,403 INFO L567 ElimStorePlain]: treesize reduction 27, result has 25.0 percent of original size [2019-11-06 19:23:33,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:33,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:4 [2019-11-06 19:23:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:33,411 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:33,411 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-11-06 19:23:33,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683117368] [2019-11-06 19:23:33,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 19:23:33,412 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:33,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 19:23:33,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-06 19:23:33,413 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 15 states. [2019-11-06 19:23:34,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:34,287 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2019-11-06 19:23:34,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-06 19:23:34,288 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-11-06 19:23:34,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:34,289 INFO L225 Difference]: With dead ends: 88 [2019-11-06 19:23:34,289 INFO L226 Difference]: Without dead ends: 86 [2019-11-06 19:23:34,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2019-11-06 19:23:34,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-06 19:23:34,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 46. [2019-11-06 19:23:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-06 19:23:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-11-06 19:23:34,298 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 24 [2019-11-06 19:23:34,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:34,298 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-11-06 19:23:34,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 19:23:34,299 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-11-06 19:23:34,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 19:23:34,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:34,299 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:34,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:34,504 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:34,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:34,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2050422112, now seen corresponding path program 1 times [2019-11-06 19:23:34,505 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:34,505 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921224253] [2019-11-06 19:23:34,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:34,779 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921224253] [2019-11-06 19:23:34,780 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848410210] [2019-11-06 19:23:34,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:34,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-06 19:23:34,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:34,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:23:34,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:34,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:34,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:34,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-06 19:23:34,949 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:34,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 19:23:34,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:34,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:34,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:34,974 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:34,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:34,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:34,993 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:35,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:35,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:35,006 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-11-06 19:23:35,043 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_30|], 4=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_26|]} [2019-11-06 19:23:35,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-06 19:23:35,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:35,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:35,107 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:35,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 105 [2019-11-06 19:23:35,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:35,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:35,113 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-06 19:23:35,158 INFO L567 ElimStorePlain]: treesize reduction 117, result has 39.7 percent of original size [2019-11-06 19:23:35,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 55 [2019-11-06 19:23:35,164 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:35,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:35,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:35,174 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:111, output treesize:49 [2019-11-06 19:23:35,267 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:35,268 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 40 [2019-11-06 19:23:35,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:35,289 INFO L567 ElimStorePlain]: treesize reduction 12, result has 73.3 percent of original size [2019-11-06 19:23:35,292 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-11-06 19:23:35,293 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:35,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:35,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:35,299 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:11 [2019-11-06 19:23:35,325 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-11-06 19:23:35,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:35,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:35,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:35,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-06 19:23:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:35,363 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:35,363 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2019-11-06 19:23:35,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183248907] [2019-11-06 19:23:35,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-06 19:23:35,364 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:35,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-06 19:23:35,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-11-06 19:23:35,365 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 19 states. [2019-11-06 19:23:36,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:36,411 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2019-11-06 19:23:36,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 19:23:36,411 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-11-06 19:23:36,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:36,415 INFO L225 Difference]: With dead ends: 87 [2019-11-06 19:23:36,415 INFO L226 Difference]: Without dead ends: 75 [2019-11-06 19:23:36,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2019-11-06 19:23:36,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-06 19:23:36,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2019-11-06 19:23:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-06 19:23:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-11-06 19:23:36,425 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 24 [2019-11-06 19:23:36,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:36,426 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-11-06 19:23:36,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-06 19:23:36,426 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-11-06 19:23:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 19:23:36,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:36,427 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:36,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:36,631 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:36,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:36,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1509760762, now seen corresponding path program 1 times [2019-11-06 19:23:36,632 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:36,632 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239648384] [2019-11-06 19:23:36,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:36,933 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239648384] [2019-11-06 19:23:36,933 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338137714] [2019-11-06 19:23:36,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:37,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-06 19:23:37,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:37,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:23:37,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:23:37,113 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,114 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-11-06 19:23:37,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,170 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-11-06 19:23:37,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:37,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:37,205 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,227 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-11-06 19:23:37,288 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-06 19:23:37,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,369 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 1=[|v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_27|], 4=[|v_#memory_$Pointer$.offset_29|, |v_#memory_$Pointer$.base_29|]} [2019-11-06 19:23:37,375 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-11-06 19:23:37,376 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,445 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:37,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,506 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:37,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,555 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 75 treesize of output 43 [2019-11-06 19:23:37,556 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,653 INFO L341 Elim1Store]: treesize reduction 16, result has 80.5 percent of original size [2019-11-06 19:23:37,653 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 5 case distinctions, treesize of input 106 treesize of output 101 [2019-11-06 19:23:37,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:37,656 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,721 INFO L567 ElimStorePlain]: treesize reduction 76, result has 53.7 percent of original size [2019-11-06 19:23:37,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,723 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:225, output treesize:95 [2019-11-06 19:23:37,956 INFO L341 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2019-11-06 19:23:37,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 84 [2019-11-06 19:23:37,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:37,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:37,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:37,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:37,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:37,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:37,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:37,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:37,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:37,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:37,976 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:38,027 INFO L567 ElimStorePlain]: treesize reduction 20, result has 73.7 percent of original size [2019-11-06 19:23:38,037 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:38,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-11-06 19:23:38,038 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:38,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:38,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:38,051 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:130, output treesize:11 [2019-11-06 19:23:38,069 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-11-06 19:23:38,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:38,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:38,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:38,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-06 19:23:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:38,081 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:38,081 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2019-11-06 19:23:38,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576764496] [2019-11-06 19:23:38,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 19:23:38,083 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:38,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 19:23:38,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-06 19:23:38,084 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 16 states. [2019-11-06 19:23:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:39,233 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2019-11-06 19:23:39,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-06 19:23:39,234 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-11-06 19:23:39,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:39,235 INFO L225 Difference]: With dead ends: 105 [2019-11-06 19:23:39,236 INFO L226 Difference]: Without dead ends: 103 [2019-11-06 19:23:39,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2019-11-06 19:23:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-06 19:23:39,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2019-11-06 19:23:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-06 19:23:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2019-11-06 19:23:39,247 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 27 [2019-11-06 19:23:39,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:39,247 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2019-11-06 19:23:39,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-06 19:23:39,247 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2019-11-06 19:23:39,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 19:23:39,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:39,249 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:39,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:39,453 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:39,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:39,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1670120370, now seen corresponding path program 2 times [2019-11-06 19:23:39,454 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:39,454 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170489892] [2019-11-06 19:23:39,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:39,743 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170489892] [2019-11-06 19:23:39,744 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601709031] [2019-11-06 19:23:39,744 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 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-11-06 19:23:39,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 19:23:39,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:23:39,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-06 19:23:39,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:39,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:23:39,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:39,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:39,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:39,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:23:39,900 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:39,900 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-11-06 19:23:39,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:39,963 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-11-06 19:23:39,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:39,972 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:39,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:39,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:39,997 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:40,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:40,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:40,016 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-11-06 19:23:40,105 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:40,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-06 19:23:40,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:40,233 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-06 19:23:40,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:40,238 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_34|], 2=[|v_#memory_int_33|, |v_#memory_int_32|], 4=[|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.base_32|, |v_#memory_$Pointer$.offset_30|]} [2019-11-06 19:23:40,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2019-11-06 19:23:40,270 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:40,372 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-06 19:23:40,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:40,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 27 treesize of output 15 [2019-11-06 19:23:40,391 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:40,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:40,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-06 19:23:40,483 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:40,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:40,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2019-11-06 19:23:40,571 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:40,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:40,634 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:40,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:40,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:40,835 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-11-06 19:23:40,836 INFO L341 Elim1Store]: treesize reduction 66, result has 62.9 percent of original size [2019-11-06 19:23:40,836 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 5 case distinctions, treesize of input 164 treesize of output 185 [2019-11-06 19:23:40,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:40,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:40,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:40,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:40,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:40,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:40,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:40,842 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:40,963 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-11-06 19:23:40,964 INFO L567 ElimStorePlain]: treesize reduction 497, result has 21.7 percent of original size [2019-11-06 19:23:40,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:40,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:40,972 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 114 treesize of output 73 [2019-11-06 19:23:40,973 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:40,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:40,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:40,998 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:280, output treesize:97 [2019-11-06 19:23:41,094 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 5=[|#memory_$Pointer$.base|]} [2019-11-06 19:23:41,097 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 30 treesize of output 10 [2019-11-06 19:23:41,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:41,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:41,137 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:41,138 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 79 treesize of output 69 [2019-11-06 19:23:41,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:41,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:41,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:41,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:41,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:41,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:41,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:41,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:41,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:41,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:41,143 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:41,176 INFO L567 ElimStorePlain]: treesize reduction 28, result has 53.3 percent of original size [2019-11-06 19:23:41,177 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-11-06 19:23:41,178 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:108, output treesize:24 [2019-11-06 19:23:41,213 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 24 treesize of output 10 [2019-11-06 19:23:41,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:41,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:41,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:41,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-11-06 19:23:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:41,249 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:41,249 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2019-11-06 19:23:41,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321744362] [2019-11-06 19:23:41,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 19:23:41,250 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:41,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 19:23:41,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-11-06 19:23:41,251 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand 16 states. [2019-11-06 19:23:41,582 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2019-11-06 19:23:41,903 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-11-06 19:23:42,348 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2019-11-06 19:23:42,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:42,805 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2019-11-06 19:23:42,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-06 19:23:42,805 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-11-06 19:23:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:42,807 INFO L225 Difference]: With dead ends: 108 [2019-11-06 19:23:42,809 INFO L226 Difference]: Without dead ends: 86 [2019-11-06 19:23:42,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2019-11-06 19:23:42,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-06 19:23:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2019-11-06 19:23:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-06 19:23:42,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2019-11-06 19:23:42,833 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 27 [2019-11-06 19:23:42,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:42,833 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2019-11-06 19:23:42,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-06 19:23:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2019-11-06 19:23:42,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 19:23:42,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:42,837 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:43,043 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:43,043 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:43,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:43,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1148340406, now seen corresponding path program 3 times [2019-11-06 19:23:43,044 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:43,044 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576957849] [2019-11-06 19:23:43,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:43,295 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576957849] [2019-11-06 19:23:43,295 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561116057] [2019-11-06 19:23:43,296 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-11-06 19:23:43,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 19:23:43,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:23:43,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 66 conjunts are in the unsatisfiable core [2019-11-06 19:23:43,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:43,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:23:43,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:23:43,511 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,512 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-11-06 19:23:43,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,582 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-11-06 19:23:43,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:43,590 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:43,616 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,656 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-11-06 19:23:43,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-06 19:23:43,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,828 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,828 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 201 treesize of output 146 [2019-11-06 19:23:43,829 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,932 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-06 19:23:43,932 INFO L567 ElimStorePlain]: treesize reduction 24, result has 88.9 percent of original size [2019-11-06 19:23:43,943 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 46 treesize of output 25 [2019-11-06 19:23:43,943 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:43,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 32 [2019-11-06 19:23:43,994 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:44,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:44,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:44,118 INFO L341 Elim1Store]: treesize reduction 33, result has 68.6 percent of original size [2019-11-06 19:23:44,118 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 4 case distinctions, treesize of input 93 treesize of output 100 [2019-11-06 19:23:44,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,124 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:44,195 INFO L567 ElimStorePlain]: treesize reduction 229, result has 21.8 percent of original size [2019-11-06 19:23:44,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:44,196 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:226, output treesize:52 [2019-11-06 19:23:44,235 INFO L392 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.offset_37|], 18=[|v_#memory_$Pointer$.base_37|]} [2019-11-06 19:23:44,279 INFO L341 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2019-11-06 19:23:44,279 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 3 case distinctions, treesize of input 82 treesize of output 52 [2019-11-06 19:23:44,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:44,343 INFO L567 ElimStorePlain]: treesize reduction 16, result has 90.4 percent of original size [2019-11-06 19:23:44,507 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-11-06 19:23:44,507 INFO L341 Elim1Store]: treesize reduction 38, result has 76.5 percent of original size [2019-11-06 19:23:44,508 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 7 case distinctions, treesize of input 130 treesize of output 159 [2019-11-06 19:23:44,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:44,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,581 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:44,701 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-11-06 19:23:44,701 INFO L567 ElimStorePlain]: treesize reduction 82, result has 51.8 percent of original size [2019-11-06 19:23:44,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:44,709 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:202, output treesize:121 [2019-11-06 19:23:44,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,826 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_35|], 6=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_34|], 20=[|v_#memory_$Pointer$.base_38|], 63=[|v_#memory_$Pointer$.offset_38|]} [2019-11-06 19:23:44,931 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 233 treesize of output 229 [2019-11-06 19:23:44,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,177 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 177 treesize of output 173 [2019-11-06 19:23:45,177 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:45,197 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 201 treesize of output 197 [2019-11-06 19:23:45,198 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:50,507 WARN L191 SmtUtils]: Spent 5.31 s on a formula simplification. DAG size of input: 156 DAG size of output: 154 [2019-11-06 19:23:50,507 INFO L567 ElimStorePlain]: treesize reduction 19, result has 96.8 percent of original size [2019-11-06 19:23:50,536 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:50,546 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:50,556 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:52,457 WARN L191 SmtUtils]: Spent 1.90 s on a formula simplification that was a NOOP. DAG size: 144 [2019-11-06 19:23:52,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:52,478 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:52,491 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:52,500 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:54,121 WARN L191 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 134 [2019-11-06 19:23:54,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:54,357 INFO L341 Elim1Store]: treesize reduction 31, result has 69.0 percent of original size [2019-11-06 19:23:54,357 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 5 case distinctions, treesize of input 144 treesize of output 159 [2019-11-06 19:23:54,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:54,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:54,361 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:54,556 INFO L341 Elim1Store]: treesize reduction 16, result has 84.0 percent of original size [2019-11-06 19:23:54,557 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 5 case distinctions, treesize of input 187 treesize of output 188 [2019-11-06 19:23:54,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:54,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:54,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:54,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:54,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:54,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:54,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:54,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:54,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,572 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:54,937 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-11-06 19:23:54,938 INFO L341 Elim1Store]: treesize reduction 31, result has 80.3 percent of original size [2019-11-06 19:23:54,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 171 treesize of output 226 [2019-11-06 19:23:54,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:54,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:54,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:54,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:54,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:54,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:54,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:54,969 INFO L496 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:56,328 WARN L191 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 177 DAG size of output: 152 [2019-11-06 19:23:56,328 INFO L567 ElimStorePlain]: treesize reduction 143, result has 74.4 percent of original size [2019-11-06 19:23:56,591 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-11-06 19:23:56,592 INFO L341 Elim1Store]: treesize reduction 129, result has 50.0 percent of original size [2019-11-06 19:23:56,592 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 7 case distinctions, treesize of input 158 treesize of output 241 [2019-11-06 19:23:56,594 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,727 INFO L341 Elim1Store]: treesize reduction 59, result has 49.1 percent of original size [2019-11-06 19:23:56,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 140 [2019-11-06 19:23:56,728 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,862 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-11-06 19:23:56,863 INFO L341 Elim1Store]: treesize reduction 59, result has 57.6 percent of original size [2019-11-06 19:23:56,863 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 5 case distinctions, treesize of input 132 treesize of output 166 [2019-11-06 19:23:56,864 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:57,422 WARN L191 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 149 [2019-11-06 19:23:57,423 INFO L567 ElimStorePlain]: treesize reduction 123, result has 75.6 percent of original size [2019-11-06 19:23:57,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:57,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:57,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:57,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:57,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:57,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 5 dim-2 vars, End of recursive call: 39 dim-0 vars, and 3 xjuncts. [2019-11-06 19:23:57,561 INFO L221 ElimStorePlain]: Needed 16 recursive calls to eliminate 10 variables, input treesize:612, output treesize:2507 [2019-11-06 19:23:57,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:01,118 WARN L191 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 609 DAG size of output: 137 [2019-11-06 19:24:01,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:01,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:01,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:01,729 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-11-06 19:24:01,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 19:24:01,774 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_39], 2=[v_prenex_36], 5=[v_prenex_41, |#memory_$Pointer$.offset|, v_prenex_34]} [2019-11-06 19:24:01,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:01,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 86 treesize of output 70 [2019-11-06 19:24:01,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,053 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 157 [2019-11-06 19:24:02,053 INFO L567 ElimStorePlain]: treesize reduction 28, result has 93.7 percent of original size [2019-11-06 19:24:02,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 75 treesize of output 59 [2019-11-06 19:24:02,064 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,205 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-11-06 19:24:02,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:02,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 94 treesize of output 70 [2019-11-06 19:24:02,219 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,338 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-11-06 19:24:02,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,383 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 102 [2019-11-06 19:24:02,384 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,488 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-06 19:24:02,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:02,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 86 treesize of output 66 [2019-11-06 19:24:02,499 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:02,600 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-11-06 19:24:02,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:02,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 5 dim-2 vars, End of recursive call: 8 dim-0 vars, and 5 xjuncts. [2019-11-06 19:24:02,603 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 19 variables, input treesize:468, output treesize:269 [2019-11-06 19:24:04,777 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2019-11-06 19:24:04,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 19:24:04,794 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:24:04,795 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:24:04,796 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2019-11-06 19:24:04,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:04,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:04,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 86 treesize of output 76 [2019-11-06 19:24:04,805 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:04,816 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-06 19:24:04,817 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:04,820 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-06 19:24:04,821 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:04,881 INFO L567 ElimStorePlain]: treesize reduction 8, result has 92.6 percent of original size [2019-11-06 19:24:04,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-06 19:24:04,883 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:265, output treesize:100 [2019-11-06 19:24:04,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:04,985 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_$Pointer$.base|], 3=[v_prenex_42]} [2019-11-06 19:24:04,988 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-06 19:24:04,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:05,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:05,018 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:05,018 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 3 case distinctions, treesize of input 67 treesize of output 50 [2019-11-06 19:24:05,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:05,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:05,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:05,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:05,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:05,021 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:05,037 INFO L567 ElimStorePlain]: treesize reduction 9, result has 65.4 percent of original size [2019-11-06 19:24:05,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:05,038 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:106, output treesize:4 [2019-11-06 19:24:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:05,056 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:24:05,056 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2019-11-06 19:24:05,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246812586] [2019-11-06 19:24:05,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-06 19:24:05,057 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:05,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-06 19:24:05,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-11-06 19:24:05,058 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 19 states. [2019-11-06 19:24:05,663 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 91 [2019-11-06 19:24:06,602 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 112 [2019-11-06 19:24:06,950 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 88 [2019-11-06 19:24:07,297 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 69 [2019-11-06 19:24:07,536 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 47 [2019-11-06 19:24:07,999 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 112