/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-circular-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 19:23:03,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 19:23:03,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 19:23:03,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 19:23:03,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 19:23:03,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 19:23:03,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 19:23:03,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 19:23:03,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 19:23:03,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 19:23:03,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 19:23:03,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 19:23:03,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 19:23:03,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 19:23:03,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 19:23:03,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 19:23:03,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 19:23:03,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 19:23:03,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 19:23:03,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 19:23:03,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 19:23:03,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 19:23:03,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 19:23:03,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 19:23:03,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 19:23:03,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 19:23:03,626 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 19:23:03,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 19:23:03,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 19:23:03,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 19:23:03,628 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 19:23:03,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 19:23:03,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 19:23:03,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 19:23:03,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 19:23:03,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 19:23:03,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 19:23:03,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 19:23:03,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 19:23:03,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 19:23:03,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 19:23:03,637 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:03,663 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 19:23:03,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 19:23:03,667 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 19:23:03,667 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 19:23:03,667 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 19:23:03,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 19:23:03,668 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 19:23:03,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 19:23:03,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 19:23:03,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 19:23:03,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 19:23:03,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 19:23:03,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 19:23:03,670 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 19:23:03,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 19:23:03,671 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 19:23:03,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 19:23:03,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 19:23:03,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 19:23:03,672 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 19:23:03,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 19:23:03,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 19:23:03,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 19:23:03,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 19:23:03,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 19:23:03,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 19:23:03,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 19:23:03,674 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 19:23:03,674 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 19:23:04,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 19:23:04,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 19:23:04,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 19:23:04,038 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 19:23:04,039 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 19:23:04,040 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-circular-1.i [2019-11-06 19:23:04,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1440a58ff/852efcd7c76c45d2b929c3aaa7961adb/FLAGbda5efb04 [2019-11-06 19:23:04,658 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 19:23:04,659 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-circular-1.i [2019-11-06 19:23:04,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1440a58ff/852efcd7c76c45d2b929c3aaa7961adb/FLAGbda5efb04 [2019-11-06 19:23:04,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1440a58ff/852efcd7c76c45d2b929c3aaa7961adb [2019-11-06 19:23:04,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 19:23:04,939 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 19:23:04,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 19:23:04,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 19:23:04,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 19:23:04,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:23:04" (1/1) ... [2019-11-06 19:23:04,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e13c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:04, skipping insertion in model container [2019-11-06 19:23:04,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:23:04" (1/1) ... [2019-11-06 19:23:04,956 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 19:23:05,010 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 19:23:05,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:23:05,482 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 19:23:05,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:23:05,575 INFO L192 MainTranslator]: Completed translation [2019-11-06 19:23:05,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:05 WrapperNode [2019-11-06 19:23:05,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 19:23:05,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 19:23:05,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 19:23:05,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 19:23:05,590 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:05" (1/1) ... [2019-11-06 19:23:05,591 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:05" (1/1) ... [2019-11-06 19:23:05,606 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:05" (1/1) ... [2019-11-06 19:23:05,607 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:05" (1/1) ... [2019-11-06 19:23:05,623 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:05" (1/1) ... [2019-11-06 19:23:05,629 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:05" (1/1) ... [2019-11-06 19:23:05,632 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:05" (1/1) ... [2019-11-06 19:23:05,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 19:23:05,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 19:23:05,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 19:23:05,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 19:23:05,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:05" (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:05,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 19:23:05,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 19:23:05,718 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 19:23:05,719 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 19:23:05,719 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 19:23:05,720 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 19:23:05,720 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 19:23:05,720 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 19:23:05,721 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 19:23:05,722 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 19:23:05,722 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 19:23:05,722 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 19:23:05,723 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 19:23:05,723 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 19:23:05,725 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 19:23:05,725 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 19:23:05,728 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 19:23:05,728 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 19:23:05,728 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 19:23:05,728 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 19:23:05,728 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 19:23:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 19:23:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 19:23:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 19:23:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 19:23:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 19:23:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 19:23:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 19:23:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 19:23:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 19:23:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 19:23:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 19:23:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 19:23:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 19:23:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 19:23:05,731 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 19:23:05,731 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 19:23:05,731 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 19:23:05,731 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 19:23:05,731 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 19:23:05,731 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 19:23:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 19:23:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 19:23:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 19:23:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 19:23:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 19:23:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 19:23:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 19:23:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 19:23:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 19:23:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 19:23:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 19:23:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 19:23:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 19:23:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 19:23:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 19:23:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 19:23:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 19:23:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 19:23:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 19:23:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 19:23:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 19:23:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 19:23:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 19:23:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 19:23:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 19:23:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 19:23:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 19:23:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 19:23:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 19:23:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 19:23:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 19:23:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 19:23:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 19:23:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 19:23:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 19:23:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 19:23:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 19:23:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 19:23:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 19:23:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 19:23:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 19:23:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 19:23:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 19:23:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 19:23:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 19:23:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 19:23:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 19:23:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 19:23:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 19:23:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 19:23:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 19:23:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 19:23:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 19:23:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 19:23:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 19:23:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 19:23:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 19:23:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 19:23:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 19:23:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 19:23:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 19:23:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 19:23:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 19:23:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 19:23:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 19:23:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 19:23:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 19:23:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 19:23:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 19:23:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 19:23:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 19:23:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 19:23:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 19:23:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 19:23:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 19:23:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 19:23:06,396 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 19:23:06,397 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-06 19:23:06,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:23:06 BoogieIcfgContainer [2019-11-06 19:23:06,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 19:23:06,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 19:23:06,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 19:23:06,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 19:23:06,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:23:04" (1/3) ... [2019-11-06 19:23:06,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b9a303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:23:06, skipping insertion in model container [2019-11-06 19:23:06,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:05" (2/3) ... [2019-11-06 19:23:06,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b9a303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:23:06, skipping insertion in model container [2019-11-06 19:23:06,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:23:06" (3/3) ... [2019-11-06 19:23:06,423 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2019-11-06 19:23:06,432 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 19:23:06,440 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-06 19:23:06,452 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-06 19:23:06,478 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 19:23:06,479 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 19:23:06,479 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 19:23:06,479 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 19:23:06,479 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 19:23:06,480 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 19:23:06,480 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 19:23:06,481 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 19:23:06,496 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-11-06 19:23:06,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-06 19:23:06,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:06,503 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:06,505 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:06,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:06,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1483997276, now seen corresponding path program 1 times [2019-11-06 19:23:06,520 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:06,520 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480366050] [2019-11-06 19:23:06,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:06,684 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:06,684 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480366050] [2019-11-06 19:23:06,685 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:06,685 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 19:23:06,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552599348] [2019-11-06 19:23:06,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 19:23:06,692 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:06,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 19:23:06,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 19:23:06,705 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-11-06 19:23:06,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:06,858 INFO L93 Difference]: Finished difference Result 70 states and 106 transitions. [2019-11-06 19:23:06,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 19:23:06,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-06 19:23:06,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:06,870 INFO L225 Difference]: With dead ends: 70 [2019-11-06 19:23:06,870 INFO L226 Difference]: Without dead ends: 30 [2019-11-06 19:23:06,874 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:06,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-06 19:23:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-06 19:23:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-06 19:23:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-11-06 19:23:06,915 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2019-11-06 19:23:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:06,916 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-11-06 19:23:06,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 19:23:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-11-06 19:23:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-06 19:23:06,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:06,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:06,917 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:06,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:06,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1199756337, now seen corresponding path program 1 times [2019-11-06 19:23:06,918 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:06,918 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073049004] [2019-11-06 19:23:06,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:07,142 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:07,142 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073049004] [2019-11-06 19:23:07,142 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:07,143 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 19:23:07,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731974292] [2019-11-06 19:23:07,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 19:23:07,144 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:07,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 19:23:07,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 19:23:07,145 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2019-11-06 19:23:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:07,282 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-11-06 19:23:07,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 19:23:07,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-06 19:23:07,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:07,284 INFO L225 Difference]: With dead ends: 46 [2019-11-06 19:23:07,285 INFO L226 Difference]: Without dead ends: 42 [2019-11-06 19:23:07,285 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:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-06 19:23:07,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-11-06 19:23:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-06 19:23:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-11-06 19:23:07,293 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2019-11-06 19:23:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:07,294 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-06 19:23:07,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 19:23:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-11-06 19:23:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 19:23:07,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:07,295 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:07,295 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:07,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:07,296 INFO L82 PathProgramCache]: Analyzing trace with hash -97127833, now seen corresponding path program 1 times [2019-11-06 19:23:07,296 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:07,296 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105080546] [2019-11-06 19:23:07,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:07,394 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:07,394 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105080546] [2019-11-06 19:23:07,397 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:07,397 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:23:07,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339836051] [2019-11-06 19:23:07,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:23:07,398 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:07,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:23:07,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:23:07,399 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 4 states. [2019-11-06 19:23:07,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:07,484 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-11-06 19:23:07,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:23:07,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-06 19:23:07,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:07,487 INFO L225 Difference]: With dead ends: 75 [2019-11-06 19:23:07,488 INFO L226 Difference]: Without dead ends: 53 [2019-11-06 19:23:07,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:23:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-06 19:23:07,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2019-11-06 19:23:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-06 19:23:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-11-06 19:23:07,497 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 14 [2019-11-06 19:23:07,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:07,497 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-11-06 19:23:07,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:23:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-11-06 19:23:07,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 19:23:07,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:07,499 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:07,499 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:07,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:07,499 INFO L82 PathProgramCache]: Analyzing trace with hash 2075944349, now seen corresponding path program 1 times [2019-11-06 19:23:07,500 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:07,500 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335409548] [2019-11-06 19:23:07,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:07,586 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:07,586 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335409548] [2019-11-06 19:23:07,586 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:07,586 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:23:07,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372007643] [2019-11-06 19:23:07,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:23:07,591 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:07,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:23:07,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:23:07,591 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 4 states. [2019-11-06 19:23:07,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:07,668 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-11-06 19:23:07,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:23:07,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-06 19:23:07,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:07,670 INFO L225 Difference]: With dead ends: 42 [2019-11-06 19:23:07,670 INFO L226 Difference]: Without dead ends: 40 [2019-11-06 19:23:07,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:23:07,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-06 19:23:07,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-06 19:23:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-06 19:23:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-11-06 19:23:07,680 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2019-11-06 19:23:07,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:07,681 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-06 19:23:07,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:23:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-11-06 19:23:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 19:23:07,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:07,682 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:07,683 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:07,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:07,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2075946271, now seen corresponding path program 1 times [2019-11-06 19:23:07,683 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:07,684 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903279105] [2019-11-06 19:23:07,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:07,949 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:07,950 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903279105] [2019-11-06 19:23:07,950 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:07,951 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:23:07,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855177187] [2019-11-06 19:23:07,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:23:07,953 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:07,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:23:07,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:23:07,954 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2019-11-06 19:23:08,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:08,199 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-11-06 19:23:08,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:23:08,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-06 19:23:08,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:08,201 INFO L225 Difference]: With dead ends: 51 [2019-11-06 19:23:08,201 INFO L226 Difference]: Without dead ends: 38 [2019-11-06 19:23:08,206 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:08,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-06 19:23:08,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-06 19:23:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-06 19:23:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-11-06 19:23:08,221 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 17 [2019-11-06 19:23:08,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:08,221 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-06 19:23:08,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:23:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-11-06 19:23:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 19:23:08,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:08,223 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:08,223 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:08,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:08,223 INFO L82 PathProgramCache]: Analyzing trace with hash -351040154, now seen corresponding path program 1 times [2019-11-06 19:23:08,224 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:08,225 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110227525] [2019-11-06 19:23:08,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:08,328 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:08,328 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110227525] [2019-11-06 19:23:08,329 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172724725] [2019-11-06 19:23:08,329 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:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:08,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-06 19:23:08,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:08,531 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:08,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:08,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:08,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:08,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-06 19:23:08,583 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:08,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 19:23:08,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:08,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:08,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:08,608 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:08,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:08,618 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:08,618 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-11-06 19:23:08,651 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 19:23:08,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:08,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:08,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:08,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:08,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-11-06 19:23:08,671 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[|v_#memory_$Pointer$.base_20|]} [2019-11-06 19:23:08,677 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:08,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:08,706 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:08,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2019-11-06 19:23:08,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:08,711 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:08,724 INFO L567 ElimStorePlain]: treesize reduction 23, result has 28.1 percent of original size [2019-11-06 19:23:08,725 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:23:08,725 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:4 [2019-11-06 19:23:08,727 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:08,727 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:08,728 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-06 19:23:08,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777783301] [2019-11-06 19:23:08,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 19:23:08,729 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:08,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 19:23:08,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:23:08,729 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2019-11-06 19:23:08,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:08,880 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-11-06 19:23:08,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:23:08,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-06 19:23:08,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:08,882 INFO L225 Difference]: With dead ends: 65 [2019-11-06 19:23:08,883 INFO L226 Difference]: Without dead ends: 63 [2019-11-06 19:23:08,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-06 19:23:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-06 19:23:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2019-11-06 19:23:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-06 19:23:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2019-11-06 19:23:08,897 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 17 [2019-11-06 19:23:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:08,897 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-11-06 19:23:08,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 19:23:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2019-11-06 19:23:08,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 19:23:08,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:08,900 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:09,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:09,104 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:09,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:09,105 INFO L82 PathProgramCache]: Analyzing trace with hash 2111834143, now seen corresponding path program 1 times [2019-11-06 19:23:09,105 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:09,106 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288313008] [2019-11-06 19:23:09,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:09,152 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288313008] [2019-11-06 19:23:09,152 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:09,153 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:23:09,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220368877] [2019-11-06 19:23:09,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:23:09,153 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:09,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:23:09,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:23:09,154 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 4 states. [2019-11-06 19:23:09,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:09,255 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2019-11-06 19:23:09,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:23:09,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-06 19:23:09,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:09,257 INFO L225 Difference]: With dead ends: 100 [2019-11-06 19:23:09,257 INFO L226 Difference]: Without dead ends: 77 [2019-11-06 19:23:09,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:23:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-06 19:23:09,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2019-11-06 19:23:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-06 19:23:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2019-11-06 19:23:09,266 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 21 [2019-11-06 19:23:09,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:09,266 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2019-11-06 19:23:09,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:23:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2019-11-06 19:23:09,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 19:23:09,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:09,268 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, 1, 1] [2019-11-06 19:23:09,268 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:09,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:09,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2016892268, now seen corresponding path program 1 times [2019-11-06 19:23:09,269 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:09,269 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353387076] [2019-11-06 19:23:09,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:09,517 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:09,517 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353387076] [2019-11-06 19:23:09,517 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035583520] [2019-11-06 19:23:09,518 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:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:09,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-06 19:23:09,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:09,647 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:09,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:09,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:09,670 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:09,670 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:09,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:09,682 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:09,682 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2019-11-06 19:23:09,727 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:09,727 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:09,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:09,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:09,761 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_21|], 2=[|v_#memory_int_20|, |v_#memory_int_21|]} [2019-11-06 19:23:09,770 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:09,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:09,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:09,806 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:09,806 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:09,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:09,837 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:09,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:09,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:09,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 20 [2019-11-06 19:23:09,870 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:09,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:09,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:09,886 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:107, output treesize:45 [2019-11-06 19:23:09,920 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_22|], 6=[|v_#memory_$Pointer$.offset_19|, |v_#memory_$Pointer$.base_22|]} [2019-11-06 19:23:09,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-06 19:23:09,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:09,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:09,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:09,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:09,967 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:09,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:09,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:09,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:09,996 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:10,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:10,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:10,026 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:96, output treesize:54 [2019-11-06 19:23:10,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:10,105 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:10,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 179 [2019-11-06 19:23:10,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:10,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:10,158 INFO L567 ElimStorePlain]: treesize reduction 76, result has 65.9 percent of original size [2019-11-06 19:23:10,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2019-11-06 19:23:10,165 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:10,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:10,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:10,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 95 [2019-11-06 19:23:10,203 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:10,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:10,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:10,220 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:186, output treesize:61 [2019-11-06 19:23:10,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:10,273 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:23:10,274 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:23:10,275 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:23:10,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 56 [2019-11-06 19:23:10,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:10,283 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:23:10,283 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:23:10,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 1 [2019-11-06 19:23:10,285 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:10,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:10,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:10,312 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:161, output treesize:53 [2019-11-06 19:23:10,371 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:10,371 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:10,372 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-06 19:23:10,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103935524] [2019-11-06 19:23:10,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 19:23:10,373 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:10,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 19:23:10,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-06 19:23:10,373 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 13 states. [2019-11-06 19:23:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:10,914 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-11-06 19:23:10,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 19:23:10,915 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-06 19:23:10,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:10,916 INFO L225 Difference]: With dead ends: 86 [2019-11-06 19:23:10,917 INFO L226 Difference]: Without dead ends: 76 [2019-11-06 19:23:10,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-11-06 19:23:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-06 19:23:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-11-06 19:23:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-06 19:23:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2019-11-06 19:23:10,926 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 23 [2019-11-06 19:23:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:10,926 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2019-11-06 19:23:10,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 19:23:10,926 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2019-11-06 19:23:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 19:23:10,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:10,927 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:11,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:11,131 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:11,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:11,132 INFO L82 PathProgramCache]: Analyzing trace with hash -148911397, now seen corresponding path program 2 times [2019-11-06 19:23:11,132 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:11,133 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250952287] [2019-11-06 19:23:11,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:11,250 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250952287] [2019-11-06 19:23:11,251 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515267185] [2019-11-06 19:23:11,251 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:11,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 19:23:11,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:23:11,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-06 19:23:11,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:11,367 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:11,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:11,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:11,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:11,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:23:11,415 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:11,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 19:23:11,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:11,455 INFO L567 ElimStorePlain]: treesize reduction 14, result has 77.8 percent of original size [2019-11-06 19:23:11,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:11,464 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:11,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:11,478 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:11,478 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:36 [2019-11-06 19:23:11,514 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 19:23:11,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:11,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:11,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:11,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:11,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2019-11-06 19:23:11,547 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:11,548 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:11,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:11,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:11,642 INFO L341 Elim1Store]: treesize reduction 16, result has 78.7 percent of original size [2019-11-06 19:23:11,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 84 [2019-11-06 19:23:11,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,653 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:11,706 INFO L567 ElimStorePlain]: treesize reduction 124, result has 29.1 percent of original size [2019-11-06 19:23:11,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:11,707 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:50 [2019-11-06 19:23:11,786 INFO L341 Elim1Store]: treesize reduction 62, result has 37.4 percent of original size [2019-11-06 19:23:11,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 65 [2019-11-06 19:23:11,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:11,824 INFO L567 ElimStorePlain]: treesize reduction 34, result has 59.5 percent of original size [2019-11-06 19:23:11,825 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:11,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:50 [2019-11-06 19:23:11,842 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 12=[|v_#memory_$Pointer$.base_28|]} [2019-11-06 19:23:11,846 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:11,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:11,907 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:11,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 90 [2019-11-06 19:23:11,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,918 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:11,949 INFO L567 ElimStorePlain]: treesize reduction 35, result has 32.7 percent of original size [2019-11-06 19:23:11,950 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:23:11,950 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:94, output treesize:4 [2019-11-06 19:23:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:11,956 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:11,956 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-06 19:23:11,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468253353] [2019-11-06 19:23:11,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 19:23:11,957 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:11,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 19:23:11,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-06 19:23:11,957 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 9 states. [2019-11-06 19:23:12,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:12,266 INFO L93 Difference]: Finished difference Result 136 states and 164 transitions. [2019-11-06 19:23:12,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 19:23:12,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-06 19:23:12,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:12,268 INFO L225 Difference]: With dead ends: 136 [2019-11-06 19:23:12,269 INFO L226 Difference]: Without dead ends: 134 [2019-11-06 19:23:12,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-06 19:23:12,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-06 19:23:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 110. [2019-11-06 19:23:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-06 19:23:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2019-11-06 19:23:12,281 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 23 [2019-11-06 19:23:12,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:12,282 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2019-11-06 19:23:12,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 19:23:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2019-11-06 19:23:12,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 19:23:12,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:12,283 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:12,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:12,496 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:12,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:12,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1680620617, now seen corresponding path program 2 times [2019-11-06 19:23:12,497 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:12,497 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950412738] [2019-11-06 19:23:12,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:12,934 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950412738] [2019-11-06 19:23:12,935 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117175443] [2019-11-06 19:23:12,935 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:13,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 19:23:13,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:23:13,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-06 19:23:13,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:13,052 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:13,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:23:13,117 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,117 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:13,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,188 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-11-06 19:23:13,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:13,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,233 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:13,233 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,249 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:13,250 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-11-06 19:23:13,286 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_25|], 6=[|v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.base_30|]} [2019-11-06 19:23:13,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:23:13,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:13,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:13,337 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:13,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:13,371 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,399 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:100, output treesize:58 [2019-11-06 19:23:13,473 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,473 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:13,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,532 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_26|, |v_#memory_int_24|], 10=[|v_#memory_$Pointer$.offset_23|, |v_#memory_$Pointer$.base_31|]} [2019-11-06 19:23:13,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:13,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2019-11-06 19:23:13,543 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2019-11-06 19:23:13,601 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 102 [2019-11-06 19:23:13,639 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,706 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 124 [2019-11-06 19:23:13,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:13,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:13,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:13,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:13,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:13,713 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,810 INFO L567 ElimStorePlain]: treesize reduction 384, result has 18.1 percent of original size [2019-11-06 19:23:13,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,811 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:237, output treesize:84 [2019-11-06 19:23:13,857 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_27|], 12=[|v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.base_32|]} [2019-11-06 19:23:13,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-11-06 19:23:13,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:13,913 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 78 [2019-11-06 19:23:13,915 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,973 INFO L567 ElimStorePlain]: treesize reduction 36, result has 75.7 percent of original size [2019-11-06 19:23:13,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:14,035 INFO L341 Elim1Store]: treesize reduction 32, result has 61.0 percent of original size [2019-11-06 19:23:14,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 101 [2019-11-06 19:23:14,036 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:14,091 INFO L567 ElimStorePlain]: treesize reduction 58, result has 61.6 percent of original size [2019-11-06 19:23:14,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:14,092 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:135, output treesize:93 [2019-11-06 19:23:14,149 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_28|], 12=[|v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.base_33|]} [2019-11-06 19:23:14,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 54 [2019-11-06 19:23:14,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:14,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:14,278 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:14,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 311 treesize of output 350 [2019-11-06 19:23:14,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,311 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:14,561 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 46 [2019-11-06 19:23:14,561 INFO L567 ElimStorePlain]: treesize reduction 2686, result has 6.6 percent of original size [2019-11-06 19:23:14,637 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:14,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 233 [2019-11-06 19:23:14,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,674 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:14,778 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 37 [2019-11-06 19:23:14,778 INFO L567 ElimStorePlain]: treesize reduction 1945, result has 6.3 percent of original size [2019-11-06 19:23:14,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:14,779 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:388, output treesize:129 [2019-11-06 19:23:14,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:14,861 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:14,862 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-11-06 19:23:14,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738490686] [2019-11-06 19:23:14,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 19:23:14,864 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:14,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 19:23:14,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-11-06 19:23:14,864 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand 15 states. [2019-11-06 19:23:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:16,056 INFO L93 Difference]: Finished difference Result 172 states and 203 transitions. [2019-11-06 19:23:16,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-06 19:23:16,056 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-11-06 19:23:16,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:16,058 INFO L225 Difference]: With dead ends: 172 [2019-11-06 19:23:16,058 INFO L226 Difference]: Without dead ends: 170 [2019-11-06 19:23:16,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2019-11-06 19:23:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-06 19:23:16,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 122. [2019-11-06 19:23:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-06 19:23:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2019-11-06 19:23:16,090 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 29 [2019-11-06 19:23:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:16,090 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2019-11-06 19:23:16,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 19:23:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2019-11-06 19:23:16,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 19:23:16,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:16,095 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:16,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:16,303 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:16,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:16,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1307682849, now seen corresponding path program 1 times [2019-11-06 19:23:16,303 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:16,303 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010160114] [2019-11-06 19:23:16,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:16,461 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010160114] [2019-11-06 19:23:16,461 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787542829] [2019-11-06 19:23:16,461 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:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:16,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-06 19:23:16,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:16,577 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:16,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:16,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:16,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:16,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:23:16,620 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:16,620 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:16,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:16,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:16,643 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:16,643 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:16,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:16,665 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:16,665 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:16,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:16,680 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:16,681 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:71, output treesize:39 [2019-11-06 19:23:16,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:16,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:16,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:16,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:16,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:16,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:16,752 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:16,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:16,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:16,766 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2019-11-06 19:23:16,779 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_29|], 4=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_28|]} [2019-11-06 19:23:16,783 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:16,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:16,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:16,838 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:16,838 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:16,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:16,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:16,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:16,841 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-06 19:23:16,903 INFO L567 ElimStorePlain]: treesize reduction 242, result has 27.3 percent of original size [2019-11-06 19:23:16,917 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:16,918 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:16,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:16,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:16,930 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:125, output treesize:63 [2019-11-06 19:23:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:17,190 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:17,190 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-06 19:23:17,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042972560] [2019-11-06 19:23:17,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-06 19:23:17,191 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:17,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-06 19:23:17,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-11-06 19:23:17,192 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand 17 states. [2019-11-06 19:23:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:17,912 INFO L93 Difference]: Finished difference Result 150 states and 178 transitions. [2019-11-06 19:23:17,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-06 19:23:17,912 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-11-06 19:23:17,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:17,913 INFO L225 Difference]: With dead ends: 150 [2019-11-06 19:23:17,913 INFO L226 Difference]: Without dead ends: 116 [2019-11-06 19:23:17,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2019-11-06 19:23:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-06 19:23:17,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-11-06 19:23:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-06 19:23:17,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-11-06 19:23:17,923 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 30 [2019-11-06 19:23:17,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:17,924 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-11-06 19:23:17,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-06 19:23:17,924 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-11-06 19:23:17,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 19:23:17,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:17,925 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:18,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:18,130 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:18,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash 432046418, now seen corresponding path program 1 times [2019-11-06 19:23:18,131 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:18,131 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113113947] [2019-11-06 19:23:18,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:18,559 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113113947] [2019-11-06 19:23:18,560 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14924063] [2019-11-06 19:23:18,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:18,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-06 19:23:18,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:18,694 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:18,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:18,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:18,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:18,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-11-06 19:23:18,751 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:18,752 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:18,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:18,810 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.8 percent of original size [2019-11-06 19:23:18,818 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:18,819 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:18,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:18,842 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:18,842 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:18,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:18,863 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:18,863 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:80, output treesize:52 [2019-11-06 19:23:18,905 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 6=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_30|]} [2019-11-06 19:23:18,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:23:18,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:18,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:18,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:18,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:18,951 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:18,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:18,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:18,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:18,986 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:19,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:19,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:19,009 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:103, output treesize:58 [2019-11-06 19:23:19,074 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:19,075 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:19,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:19,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:19,153 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|], 2=[|v_#memory_int_30|], 9=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_31|]} [2019-11-06 19:23:19,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-11-06 19:23:19,165 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:19,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:19,219 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:19,220 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:19,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:19,285 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:19,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 117 [2019-11-06 19:23:19,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,291 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:19,382 INFO L567 ElimStorePlain]: treesize reduction 117, result has 47.5 percent of original size [2019-11-06 19:23:19,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:19,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:19,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 62 [2019-11-06 19:23:19,390 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:19,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:19,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:19,410 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:202, output treesize:69 [2019-11-06 19:23:19,511 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_33|], 12=[|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_40|]} [2019-11-06 19:23:19,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:19,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-06 19:23:19,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:19,597 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.3 percent of original size [2019-11-06 19:23:19,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:19,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:19,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:19,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:19,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-06 19:23:19,614 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:19,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:19,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:19,663 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:19,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 69 [2019-11-06 19:23:19,664 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:19,730 INFO L567 ElimStorePlain]: treesize reduction 48, result has 60.3 percent of original size [2019-11-06 19:23:19,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:19,731 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:73 [2019-11-06 19:23:19,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:19,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:19,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:19,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 43 [2019-11-06 19:23:19,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:19,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:19,857 INFO L341 Elim1Store]: treesize reduction 44, result has 42.1 percent of original size [2019-11-06 19:23:19,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 53 [2019-11-06 19:23:19,858 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:19,905 INFO L567 ElimStorePlain]: treesize reduction 40, result has 76.2 percent of original size [2019-11-06 19:23:19,920 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:19,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 94 [2019-11-06 19:23:19,922 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:19,961 INFO L567 ElimStorePlain]: treesize reduction 96, result has 48.1 percent of original size [2019-11-06 19:23:19,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:19,962 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:206, output treesize:89 [2019-11-06 19:23:20,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:20,039 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:20,039 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-11-06 19:23:20,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445318216] [2019-11-06 19:23:20,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-06 19:23:20,040 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:20,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-06 19:23:20,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-11-06 19:23:20,041 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 17 states. [2019-11-06 19:23:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:21,010 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2019-11-06 19:23:21,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 19:23:21,011 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-11-06 19:23:21,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:21,013 INFO L225 Difference]: With dead ends: 130 [2019-11-06 19:23:21,013 INFO L226 Difference]: Without dead ends: 128 [2019-11-06 19:23:21,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-11-06 19:23:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-06 19:23:21,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2019-11-06 19:23:21,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-06 19:23:21,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2019-11-06 19:23:21,021 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 30 [2019-11-06 19:23:21,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:21,022 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2019-11-06 19:23:21,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-06 19:23:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2019-11-06 19:23:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 19:23:21,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:21,023 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:21,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:21,227 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:21,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:21,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1176084370, now seen corresponding path program 1 times [2019-11-06 19:23:21,228 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:21,228 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172963157] [2019-11-06 19:23:21,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:21,858 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2019-11-06 19:23:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:22,021 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172963157] [2019-11-06 19:23:22,021 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791859844] [2019-11-06 19:23:22,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:22,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-06 19:23:22,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:22,123 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:22,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:22,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:22,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:22,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-06 19:23:22,176 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:22,177 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:22,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:22,226 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-06 19:23:22,232 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:22,233 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:22,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:22,259 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:22,259 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:22,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:22,273 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:22,273 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-06 19:23:22,345 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_36|], 6=[|v_#memory_$Pointer$.offset_35|, |v_#memory_$Pointer$.base_43|]} [2019-11-06 19:23:22,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:23:22,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:22,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:22,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:22,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:22,392 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:22,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:22,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:22,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:22,424 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:22,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:22,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:22,443 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:100, output treesize:55 [2019-11-06 19:23:22,512 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:22,513 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:22,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:22,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:22,562 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_37|], 2=[|v_#memory_int_35|], 9=[|v_#memory_$Pointer$.offset_36|, |v_#memory_$Pointer$.base_44|]} [2019-11-06 19:23:22,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-11-06 19:23:22,571 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:22,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:22,647 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:22,648 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:22,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:22,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2019-11-06 19:23:22,689 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:22,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:22,771 INFO L341 Elim1Store]: treesize reduction 16, result has 76.1 percent of original size [2019-11-06 19:23:22,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 86 [2019-11-06 19:23:22,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:22,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:22,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:22,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:22,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:22,775 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:22,837 INFO L567 ElimStorePlain]: treesize reduction 94, result has 43.0 percent of original size [2019-11-06 19:23:22,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:22,838 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:199, output treesize:70 [2019-11-06 19:23:22,953 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_38|], 12=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_37|]} [2019-11-06 19:23:22,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:22,959 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:22,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:23,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:23,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:23,030 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:23,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 69 [2019-11-06 19:23:23,031 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:23,109 INFO L567 ElimStorePlain]: treesize reduction 52, result has 66.0 percent of original size [2019-11-06 19:23:23,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:23,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:23,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-06 19:23:23,121 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:23,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:23,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:23,150 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:124, output treesize:82 [2019-11-06 19:23:23,219 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_int_39|], 7=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_38|]} [2019-11-06 19:23:23,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:23,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 33 [2019-11-06 19:23:23,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:23,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:23,311 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:23,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 166 treesize of output 153 [2019-11-06 19:23:23,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:23,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:23,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:23,315 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-06 19:23:23,401 INFO L567 ElimStorePlain]: treesize reduction 371, result has 28.7 percent of original size [2019-11-06 19:23:23,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:23,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 104 [2019-11-06 19:23:23,413 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:23,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:23,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:23,435 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:226, output treesize:109 [2019-11-06 19:23:23,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:23,519 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:23,519 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-11-06 19:23:23,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337536965] [2019-11-06 19:23:23,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-06 19:23:23,520 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:23,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-06 19:23:23,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-11-06 19:23:23,521 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 20 states. [2019-11-06 19:23:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:24,754 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2019-11-06 19:23:24,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 19:23:24,755 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2019-11-06 19:23:24,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:24,757 INFO L225 Difference]: With dead ends: 130 [2019-11-06 19:23:24,757 INFO L226 Difference]: Without dead ends: 128 [2019-11-06 19:23:24,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2019-11-06 19:23:24,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-06 19:23:24,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2019-11-06 19:23:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-06 19:23:24,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2019-11-06 19:23:24,765 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 32 [2019-11-06 19:23:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:24,766 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2019-11-06 19:23:24,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-06 19:23:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2019-11-06 19:23:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 19:23:24,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:24,767 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:24,971 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:24,971 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:24,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash -123276738, now seen corresponding path program 3 times [2019-11-06 19:23:24,972 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:24,973 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317325181] [2019-11-06 19:23:24,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:25,525 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-11-06 19:23:25,657 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-11-06 19:23:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:25,796 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317325181] [2019-11-06 19:23:25,796 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261754093] [2019-11-06 19:23:25,796 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:25,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-06 19:23:25,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:23:25,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 81 conjunts are in the unsatisfiable core [2019-11-06 19:23:25,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:26,006 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:26,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:26,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:26,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:26,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-11-06 19:23:26,045 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:26,045 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:26,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:26,105 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.8 percent of original size [2019-11-06 19:23:26,116 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:26,116 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:26,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:26,142 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:26,142 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:26,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:26,164 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:26,164 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:80, output treesize:52 [2019-11-06 19:23:26,208 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 6=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_40|]} [2019-11-06 19:23:26,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:23:26,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:26,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:26,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:26,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:26,281 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:26,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:26,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:26,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:26,324 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:26,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:26,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:26,352 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:103, output treesize:61 [2019-11-06 19:23:26,508 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:26,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-06 19:23:26,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:26,814 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-11-06 19:23:26,814 INFO L567 ElimStorePlain]: treesize reduction 40, result has 86.4 percent of original size [2019-11-06 19:23:26,815 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_40|, |v_#memory_int_43|], 10=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_41|]} [2019-11-06 19:23:26,819 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:26,968 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-06 19:23:26,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:26,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:26,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 36 [2019-11-06 19:23:26,979 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:27,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:27,075 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:27,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, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 190 treesize of output 159 [2019-11-06 19:23:27,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:27,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:27,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:27,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:27,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:27,080 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:27,252 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-11-06 19:23:27,252 INFO L567 ElimStorePlain]: treesize reduction 469, result has 26.0 percent of original size [2019-11-06 19:23:27,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:27,276 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:27,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 123 [2019-11-06 19:23:27,278 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:27,353 INFO L567 ElimStorePlain]: treesize reduction 48, result has 71.4 percent of original size [2019-11-06 19:23:27,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:27,354 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:249, output treesize:105 [2019-11-06 19:23:27,412 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_44|], 12=[|v_#memory_$Pointer$.base_50|, |v_#memory_$Pointer$.offset_42|]} [2019-11-06 19:23:27,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:27,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-11-06 19:23:27,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:27,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:27,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:27,509 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:27,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 92 [2019-11-06 19:23:27,511 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:27,604 INFO L567 ElimStorePlain]: treesize reduction 48, result has 73.5 percent of original size [2019-11-06 19:23:27,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:27,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:27,665 INFO L341 Elim1Store]: treesize reduction 32, result has 56.8 percent of original size [2019-11-06 19:23:27,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 92 [2019-11-06 19:23:27,667 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:27,741 INFO L567 ElimStorePlain]: treesize reduction 38, result has 75.0 percent of original size [2019-11-06 19:23:27,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:27,742 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:156, output treesize:114 [2019-11-06 19:23:27,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:27,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:27,893 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:27,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2019-11-06 19:23:27,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:28,011 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-06 19:23:28,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:28,013 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_41|], 4=[|v_#memory_int_45|], 17=[|v_#memory_$Pointer$.offset_43|, |v_#memory_$Pointer$.base_51|]} [2019-11-06 19:23:28,016 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:28,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:28,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:28,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 62 [2019-11-06 19:23:28,117 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:28,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:28,255 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:28,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 282 treesize of output 277 [2019-11-06 19:23:28,257 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:28,392 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-11-06 19:23:28,392 INFO L567 ElimStorePlain]: treesize reduction 152, result has 56.4 percent of original size [2019-11-06 19:23:28,512 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-11-06 19:23:28,513 INFO L341 Elim1Store]: treesize reduction 15, result has 86.6 percent of original size [2019-11-06 19:23:28,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 170 treesize of output 160 [2019-11-06 19:23:28,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:28,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:28,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:28,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:28,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:28,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:28,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:28,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:28,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:28,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:28,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:28,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:28,550 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:28,693 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-11-06 19:23:28,694 INFO L567 ElimStorePlain]: treesize reduction 91, result has 52.4 percent of original size [2019-11-06 19:23:28,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:28,695 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:366, output treesize:106 [2019-11-06 19:23:28,779 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_int_46|], 19=[|v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.base_52|]} [2019-11-06 19:23:28,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:28,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:28,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-11-06 19:23:28,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:28,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:28,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:28,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:28,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:28,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:28,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:28,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:28,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2019-11-06 19:23:28,891 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:28,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:28,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:28,997 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:28,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 121 [2019-11-06 19:23:29,001 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:29,109 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-11-06 19:23:29,110 INFO L567 ElimStorePlain]: treesize reduction 168, result has 40.6 percent of original size [2019-11-06 19:23:29,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:29,111 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:157, output treesize:115 [2019-11-06 19:23:29,220 INFO L392 ElimStorePlain]: Different costs {11=[|v_#memory_int_47|], 17=[|v_#memory_$Pointer$.offset_45|, |v_#memory_$Pointer$.base_53|]} [2019-11-06 19:23:29,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:29,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:29,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 69 [2019-11-06 19:23:29,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:29,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:29,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:29,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:29,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:29,424 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:29,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 287 treesize of output 463 [2019-11-06 19:23:29,427 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:29,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:29,511 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:29,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 146 [2019-11-06 19:23:29,514 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:29,616 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2019-11-06 19:23:29,616 INFO L567 ElimStorePlain]: treesize reduction 240, result has 38.6 percent of original size [2019-11-06 19:23:29,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:29,618 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:396, output treesize:151 [2019-11-06 19:23:29,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:29,979 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:29,979 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-11-06 19:23:29,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412722777] [2019-11-06 19:23:29,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-06 19:23:29,981 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:29,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-06 19:23:29,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-11-06 19:23:29,982 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 20 states. [2019-11-06 19:23:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:31,147 INFO L93 Difference]: Finished difference Result 149 states and 179 transitions. [2019-11-06 19:23:31,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-06 19:23:31,148 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2019-11-06 19:23:31,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:31,150 INFO L225 Difference]: With dead ends: 149 [2019-11-06 19:23:31,150 INFO L226 Difference]: Without dead ends: 139 [2019-11-06 19:23:31,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2019-11-06 19:23:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-06 19:23:31,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 120. [2019-11-06 19:23:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-06 19:23:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 144 transitions. [2019-11-06 19:23:31,164 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 144 transitions. Word has length 35 [2019-11-06 19:23:31,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:31,165 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 144 transitions. [2019-11-06 19:23:31,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-06 19:23:31,165 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 144 transitions. [2019-11-06 19:23:31,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 19:23:31,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:31,171 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:31,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:31,377 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:31,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:31,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1744704133, now seen corresponding path program 3 times [2019-11-06 19:23:31,378 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:31,378 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948865463] [2019-11-06 19:23:31,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 19:23:31,507 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948865463] [2019-11-06 19:23:31,507 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830059402] [2019-11-06 19:23:31,508 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:31,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-06 19:23:31,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:23:31,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-06 19:23:31,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:31,793 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:31,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:31,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:31,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:31,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:23:31,821 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:31,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 19:23:31,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:31,859 INFO L567 ElimStorePlain]: treesize reduction 14, result has 77.8 percent of original size [2019-11-06 19:23:31,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:31,865 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:31,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:31,878 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:31,878 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:36 [2019-11-06 19:23:31,908 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 19:23:31,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:31,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:31,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:31,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:31,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2019-11-06 19:23:31,972 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:31,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-06 19:23:31,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:32,043 INFO L567 ElimStorePlain]: treesize reduction 40, result has 72.4 percent of original size [2019-11-06 19:23:32,110 INFO L341 Elim1Store]: treesize reduction 16, result has 78.7 percent of original size [2019-11-06 19:23:32,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 88 treesize of output 89 [2019-11-06 19:23:32,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,113 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:32,168 INFO L567 ElimStorePlain]: treesize reduction 166, result has 29.7 percent of original size [2019-11-06 19:23:32,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:32,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:69 [2019-11-06 19:23:32,255 INFO L341 Elim1Store]: treesize reduction 62, result has 37.4 percent of original size [2019-11-06 19:23:32,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 70 [2019-11-06 19:23:32,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:32,308 INFO L567 ElimStorePlain]: treesize reduction 34, result has 67.0 percent of original size [2019-11-06 19:23:32,309 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:32,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:69 [2019-11-06 19:23:32,377 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:32,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 159 [2019-11-06 19:23:32,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:32,481 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-11-06 19:23:32,482 INFO L567 ElimStorePlain]: treesize reduction 78, result has 69.5 percent of original size [2019-11-06 19:23:32,648 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-11-06 19:23:32,649 INFO L341 Elim1Store]: treesize reduction 39, result has 75.6 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, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 161 treesize of output 171 [2019-11-06 19:23:32,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:32,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:32,705 INFO L496 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:32,907 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 64 [2019-11-06 19:23:32,908 INFO L567 ElimStorePlain]: treesize reduction 345, result has 33.8 percent of original size [2019-11-06 19:23:32,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:32,910 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:160, output treesize:234 [2019-11-06 19:23:33,124 INFO L341 Elim1Store]: treesize reduction 98, result has 44.3 percent of original size [2019-11-06 19:23:33,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 128 treesize of output 131 [2019-11-06 19:23:33,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,137 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:33,218 INFO L567 ElimStorePlain]: treesize reduction 76, result has 56.1 percent of original size [2019-11-06 19:23:33,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:33,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:145, output treesize:126 [2019-11-06 19:23:33,275 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:33,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 72 [2019-11-06 19:23:33,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:33,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:33,595 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-11-06 19:23:33,596 INFO L341 Elim1Store]: treesize reduction 62, result has 75.9 percent of original size [2019-11-06 19:23:33,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 235 treesize of output 254 [2019-11-06 19:23:33,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:33,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,780 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:33,931 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 49 [2019-11-06 19:23:33,931 INFO L567 ElimStorePlain]: treesize reduction 198, result has 33.6 percent of original size [2019-11-06 19:23:33,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:33,933 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:251, output treesize:174 [2019-11-06 19:23:34,195 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 79 [2019-11-06 19:23:34,196 INFO L341 Elim1Store]: treesize reduction 134, result has 49.4 percent of original size [2019-11-06 19:23:34,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 186 treesize of output 193 [2019-11-06 19:23:34,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,236 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:34,350 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2019-11-06 19:23:34,350 INFO L567 ElimStorePlain]: treesize reduction 130, result has 43.5 percent of original size [2019-11-06 19:23:34,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:34,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:193, output treesize:174 [2019-11-06 19:23:34,365 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 30=[|v_#memory_$Pointer$.base_62|]} [2019-11-06 19:23:34,377 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:34,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:34,517 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-06 19:23:34,517 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:34,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 280 treesize of output 208 [2019-11-06 19:23:34,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:34,576 INFO L496 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:34,663 INFO L567 ElimStorePlain]: treesize reduction 119, result has 27.4 percent of original size [2019-11-06 19:23:34,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:34,664 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:266, output treesize:4 [2019-11-06 19:23:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:34,676 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:34,676 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-06 19:23:34,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593545747] [2019-11-06 19:23:34,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 19:23:34,677 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:34,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 19:23:34,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-06 19:23:34,677 INFO L87 Difference]: Start difference. First operand 120 states and 144 transitions. Second operand 12 states. [2019-11-06 19:23:35,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:35,233 INFO L93 Difference]: Finished difference Result 170 states and 206 transitions. [2019-11-06 19:23:35,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 19:23:35,233 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-11-06 19:23:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:35,235 INFO L225 Difference]: With dead ends: 170 [2019-11-06 19:23:35,235 INFO L226 Difference]: Without dead ends: 168 [2019-11-06 19:23:35,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-11-06 19:23:35,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-06 19:23:35,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 99. [2019-11-06 19:23:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-06 19:23:35,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2019-11-06 19:23:35,247 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 35 [2019-11-06 19:23:35,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:35,248 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2019-11-06 19:23:35,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 19:23:35,248 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2019-11-06 19:23:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 19:23:35,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:35,249 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:35,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:35,455 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:35,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1826398334, now seen corresponding path program 1 times [2019-11-06 19:23:35,455 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:35,456 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621203684] [2019-11-06 19:23:35,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:36,236 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621203684] [2019-11-06 19:23:36,236 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010053829] [2019-11-06 19:23:36,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:36,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 74 conjunts are in the unsatisfiable core [2019-11-06 19:23:36,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:36,374 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:36,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:36,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:36,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:36,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:23:36,413 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:36,413 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:36,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:36,471 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-11-06 19:23:36,476 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:36,476 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:36,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:36,498 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:36,499 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:36,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:36,518 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:36,519 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-11-06 19:23:36,600 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_50|], 6=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_64|]} [2019-11-06 19:23:36,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:23:36,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:36,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:36,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:36,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:36,648 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:36,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:36,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:36,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:36,684 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:36,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:36,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:36,711 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:103, output treesize:58 [2019-11-06 19:23:36,818 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:36,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-06 19:23:36,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,018 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-11-06 19:23:37,018 INFO L567 ElimStorePlain]: treesize reduction 40, result has 84.3 percent of original size [2019-11-06 19:23:37,020 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_51|], 2=[|v_#memory_int_48|], 9=[|v_#memory_$Pointer$.offset_48|, |v_#memory_$Pointer$.base_65|]} [2019-11-06 19:23:37,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-11-06 19:23:37,034 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,104 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:37,105 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2019-11-06 19:23:37,170 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,238 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 95 [2019-11-06 19:23:37,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:37,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:37,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:37,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:37,241 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,302 INFO L567 ElimStorePlain]: treesize reduction 32, result has 73.3 percent of original size [2019-11-06 19:23:37,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,303 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:208, output treesize:88 [2019-11-06 19:23:37,420 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_52|], 12=[|v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_66|]} [2019-11-06 19:23:37,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-06 19:23:37,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,510 INFO L567 ElimStorePlain]: treesize reduction 8, result has 94.2 percent of original size [2019-11-06 19:23:37,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:37,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:37,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:37,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:37,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-06 19:23:37,528 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:37,586 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 74 [2019-11-06 19:23:37,587 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,657 INFO L567 ElimStorePlain]: treesize reduction 40, result has 69.7 percent of original size [2019-11-06 19:23:37,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,657 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:92 [2019-11-06 19:23:37,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:37,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:37,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:37,777 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-06 19:23:37,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,885 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-06 19:23:37,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,886 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_int_53|], 2=[|v_#memory_int_49|], 15=[|v_#memory_$Pointer$.base_67|, |v_#memory_$Pointer$.offset_50|]} [2019-11-06 19:23:37,906 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 53 [2019-11-06 19:23:37,907 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:38,042 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-06 19:23:38,042 INFO L567 ElimStorePlain]: treesize reduction 40, result has 85.8 percent of original size [2019-11-06 19:23:38,053 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:38,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 53 [2019-11-06 19:23:38,054 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:38,162 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-06 19:23:38,163 INFO L567 ElimStorePlain]: treesize reduction 40, result has 85.0 percent of original size [2019-11-06 19:23:38,284 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-11-06 19:23:38,285 INFO L341 Elim1Store]: treesize reduction 15, result has 86.6 percent of original size [2019-11-06 19:23:38,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 206 treesize of output 176 [2019-11-06 19:23:38,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:38,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:38,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:38,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:38,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:38,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:38,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:38,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:38,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:38,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:38,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:38,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:38,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,318 INFO L496 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:38,457 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 53 [2019-11-06 19:23:38,458 INFO L567 ElimStorePlain]: treesize reduction 322, result has 25.5 percent of original size [2019-11-06 19:23:38,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:38,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:38,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:38,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:38,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:38,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 82 [2019-11-06 19:23:38,468 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:38,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:38,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:38,497 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:288, output treesize:110 [2019-11-06 19:23:38,566 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_int_54|], 6=[|v_#memory_$Pointer$.base_68|, |v_#memory_$Pointer$.offset_51|]} [2019-11-06 19:23:38,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:38,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:38,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:38,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-11-06 19:23:38,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:38,674 INFO L567 ElimStorePlain]: treesize reduction 12, result has 95.3 percent of original size [2019-11-06 19:23:38,706 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:38,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 161 [2019-11-06 19:23:38,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:38,791 INFO L567 ElimStorePlain]: treesize reduction 192, result has 50.3 percent of original size [2019-11-06 19:23:38,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:38,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:38,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:38,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:38,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:38,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:38,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 65 [2019-11-06 19:23:38,808 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:38,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:38,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:38,832 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:273, output treesize:143 [2019-11-06 19:23:38,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:38,916 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:38,917 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2019-11-06 19:23:38,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176320900] [2019-11-06 19:23:38,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-06 19:23:38,917 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:38,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-06 19:23:38,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-11-06 19:23:38,918 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand 22 states. [2019-11-06 19:23:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:40,125 INFO L93 Difference]: Finished difference Result 174 states and 208 transitions. [2019-11-06 19:23:40,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-06 19:23:40,126 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 35 [2019-11-06 19:23:40,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:40,128 INFO L225 Difference]: With dead ends: 174 [2019-11-06 19:23:40,128 INFO L226 Difference]: Without dead ends: 145 [2019-11-06 19:23:40,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2019-11-06 19:23:40,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-06 19:23:40,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 107. [2019-11-06 19:23:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-06 19:23:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2019-11-06 19:23:40,139 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 35 [2019-11-06 19:23:40,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:40,139 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2019-11-06 19:23:40,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-06 19:23:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2019-11-06 19:23:40,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-06 19:23:40,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:40,140 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:40,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:40,344 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:40,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:40,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1393926006, now seen corresponding path program 2 times [2019-11-06 19:23:40,345 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:40,345 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521544076] [2019-11-06 19:23:40,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 19:23:40,553 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521544076] [2019-11-06 19:23:40,553 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483182149] [2019-11-06 19:23:40,553 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:40,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 19:23:40,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:23:40,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 66 conjunts are in the unsatisfiable core [2019-11-06 19:23:40,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:40,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:23:40,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:40,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:40,693 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:40,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:40,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:40,702 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:40,702 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-11-06 19:23:40,795 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:40,795 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:40,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:40,887 INFO L567 ElimStorePlain]: treesize reduction 14, result has 89.1 percent of original size [2019-11-06 19:23:40,888 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_69|, |v_#memory_$Pointer$.offset_52|], 2=[|v_#memory_int_56|, |v_#memory_int_58|]} [2019-11-06 19:23:40,892 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:40,892 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:40,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:40,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 27 treesize of output 15 [2019-11-06 19:23:40,932 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:40,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:40,968 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:40,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:41,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:41,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 20 [2019-11-06 19:23:41,012 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:41,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:41,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:41,036 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:116, output treesize:58 [2019-11-06 19:23:41,085 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_59|], 6=[|v_#memory_$Pointer$.base_70|, |v_#memory_$Pointer$.offset_53|]} [2019-11-06 19:23:41,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-06 19:23:41,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:41,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:41,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:41,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:41,141 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:41,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:41,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:41,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 19:23:41,186 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:41,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:41,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:41,208 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:67 [2019-11-06 19:23:41,320 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:41,320 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:41,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:41,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:41,413 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_57|], 6=[|v_#memory_int_60|], 10=[|v_#memory_$Pointer$.base_71|, |v_#memory_$Pointer$.offset_54|]} [2019-11-06 19:23:41,417 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,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:41,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:41,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 48 [2019-11-06 19:23:41,513 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.