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/dll-circular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 22:06:33,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 22:06:33,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 22:06:33,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 22:06:33,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 22:06:33,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 22:06:33,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 22:06:33,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 22:06:33,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 22:06:33,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 22:06:33,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 22:06:33,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 22:06:33,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 22:06:33,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 22:06:33,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 22:06:33,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 22:06:33,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 22:06:33,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 22:06:33,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 22:06:33,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 22:06:33,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 22:06:33,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 22:06:33,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 22:06:33,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 22:06:33,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 22:06:33,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 22:06:33,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 22:06:33,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 22:06:33,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 22:06:33,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 22:06:33,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 22:06:33,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 22:06:33,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 22:06:33,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 22:06:33,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 22:06:33,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 22:06:33,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 22:06:33,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 22:06:33,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 22:06:33,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 22:06:33,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 22:06:33,956 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 22:06:33,980 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 22:06:33,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 22:06:33,982 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 22:06:33,982 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 22:06:33,982 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 22:06:33,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 22:06:33,983 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 22:06:33,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 22:06:33,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 22:06:33,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 22:06:33,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 22:06:33,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 22:06:33,984 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 22:06:33,984 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 22:06:33,984 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 22:06:33,985 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 22:06:33,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 22:06:33,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 22:06:33,985 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 22:06:33,985 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 22:06:33,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 22:06:33,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:06:33,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 22:06:33,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 22:06:33,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 22:06:33,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 22:06:33,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 22:06:33,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 22:06:33,987 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 22:06:34,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 22:06:34,256 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 22:06:34,260 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 22:06:34,262 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 22:06:34,262 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 22:06:34,263 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular-2.i [2019-10-14 22:06:34,338 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4914e23/3e9c53a4804446b6911811d935948007/FLAGb6d6cb4e5 [2019-10-14 22:06:34,855 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 22:06:34,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular-2.i [2019-10-14 22:06:34,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4914e23/3e9c53a4804446b6911811d935948007/FLAGb6d6cb4e5 [2019-10-14 22:06:35,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4914e23/3e9c53a4804446b6911811d935948007 [2019-10-14 22:06:35,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 22:06:35,161 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 22:06:35,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 22:06:35,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 22:06:35,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 22:06:35,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:06:35" (1/1) ... [2019-10-14 22:06:35,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f51de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:35, skipping insertion in model container [2019-10-14 22:06:35,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:06:35" (1/1) ... [2019-10-14 22:06:35,176 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 22:06:35,234 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 22:06:35,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:06:35,685 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 22:06:35,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:06:35,820 INFO L192 MainTranslator]: Completed translation [2019-10-14 22:06:35,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:35 WrapperNode [2019-10-14 22:06:35,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 22:06:35,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 22:06:35,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 22:06:35,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 22:06:35,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:35" (1/1) ... [2019-10-14 22:06:35,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:35" (1/1) ... [2019-10-14 22:06:35,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:35" (1/1) ... [2019-10-14 22:06:35,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:35" (1/1) ... [2019-10-14 22:06:35,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:35" (1/1) ... [2019-10-14 22:06:35,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:35" (1/1) ... [2019-10-14 22:06:35,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:35" (1/1) ... [2019-10-14 22:06:35,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 22:06:35,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 22:06:35,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 22:06:35,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 22:06:35,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:06:35,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 22:06:35,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 22:06:35,944 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 22:06:35,944 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 22:06:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 22:06:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 22:06:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 22:06:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 22:06:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 22:06:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 22:06:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 22:06:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 22:06:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 22:06:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 22:06:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 22:06:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 22:06:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 22:06:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 22:06:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 22:06:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 22:06:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 22:06:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 22:06:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 22:06:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 22:06:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 22:06:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 22:06:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 22:06:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 22:06:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 22:06:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 22:06:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 22:06:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 22:06:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 22:06:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 22:06:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 22:06:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 22:06:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 22:06:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 22:06:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 22:06:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 22:06:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 22:06:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 22:06:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 22:06:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 22:06:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 22:06:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 22:06:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 22:06:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 22:06:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 22:06:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 22:06:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 22:06:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 22:06:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 22:06:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 22:06:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 22:06:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 22:06:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 22:06:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 22:06:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 22:06:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 22:06:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 22:06:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 22:06:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 22:06:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 22:06:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 22:06:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 22:06:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 22:06:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 22:06:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 22:06:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 22:06:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 22:06:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 22:06:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 22:06:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 22:06:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 22:06:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 22:06:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 22:06:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 22:06:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 22:06:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 22:06:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 22:06:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 22:06:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 22:06:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 22:06:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 22:06:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 22:06:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 22:06:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 22:06:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 22:06:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 22:06:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 22:06:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 22:06:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 22:06:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 22:06:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 22:06:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 22:06:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 22:06:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 22:06:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 22:06:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 22:06:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 22:06:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 22:06:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 22:06:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 22:06:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 22:06:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 22:06:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 22:06:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 22:06:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 22:06:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 22:06:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 22:06:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 22:06:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 22:06:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 22:06:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 22:06:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 22:06:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 22:06:36,542 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 22:06:36,542 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-14 22:06:36,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:06:36 BoogieIcfgContainer [2019-10-14 22:06:36,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 22:06:36,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 22:06:36,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 22:06:36,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 22:06:36,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:06:35" (1/3) ... [2019-10-14 22:06:36,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d099ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:06:36, skipping insertion in model container [2019-10-14 22:06:36,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:35" (2/3) ... [2019-10-14 22:06:36,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d099ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:06:36, skipping insertion in model container [2019-10-14 22:06:36,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:06:36" (3/3) ... [2019-10-14 22:06:36,553 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2019-10-14 22:06:36,562 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 22:06:36,570 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-14 22:06:36,581 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-14 22:06:36,607 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 22:06:36,607 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 22:06:36,608 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 22:06:36,608 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 22:06:36,608 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 22:06:36,608 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 22:06:36,608 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 22:06:36,609 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 22:06:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-14 22:06:36,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-14 22:06:36,637 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:36,638 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:36,646 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:36,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1483997276, now seen corresponding path program 1 times [2019-10-14 22:06:36,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:36,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384360902] [2019-10-14 22:06:36,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:36,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:36,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:36,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384360902] [2019-10-14 22:06:36,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:36,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 22:06:36,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543639207] [2019-10-14 22:06:36,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 22:06:36,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:36,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 22:06:36,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:06:36,872 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-10-14 22:06:37,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:37,017 INFO L93 Difference]: Finished difference Result 70 states and 106 transitions. [2019-10-14 22:06:37,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 22:06:37,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-14 22:06:37,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:37,030 INFO L225 Difference]: With dead ends: 70 [2019-10-14 22:06:37,030 INFO L226 Difference]: Without dead ends: 30 [2019-10-14 22:06:37,034 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:06:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-14 22:06:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-14 22:06:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 22:06:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-10-14 22:06:37,079 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2019-10-14 22:06:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:37,080 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-10-14 22:06:37,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 22:06:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-10-14 22:06:37,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-14 22:06:37,081 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:37,081 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:37,082 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:37,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:37,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1199756337, now seen corresponding path program 1 times [2019-10-14 22:06:37,082 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:37,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331148784] [2019-10-14 22:06:37,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:37,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:37,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:37,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331148784] [2019-10-14 22:06:37,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:37,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 22:06:37,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153878053] [2019-10-14 22:06:37,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 22:06:37,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:37,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 22:06:37,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 22:06:37,303 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2019-10-14 22:06:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:37,430 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-10-14 22:06:37,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 22:06:37,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-14 22:06:37,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:37,432 INFO L225 Difference]: With dead ends: 46 [2019-10-14 22:06:37,432 INFO L226 Difference]: Without dead ends: 42 [2019-10-14 22:06:37,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:06:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-14 22:06:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-10-14 22:06:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-14 22:06:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-10-14 22:06:37,441 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2019-10-14 22:06:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:37,442 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-14 22:06:37,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 22:06:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-10-14 22:06:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 22:06:37,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:37,444 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:37,444 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:37,444 INFO L82 PathProgramCache]: Analyzing trace with hash -97127833, now seen corresponding path program 1 times [2019-10-14 22:06:37,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:37,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367485593] [2019-10-14 22:06:37,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:37,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:37,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:37,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367485593] [2019-10-14 22:06:37,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:37,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 22:06:37,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871524584] [2019-10-14 22:06:37,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 22:06:37,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:37,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 22:06:37,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:37,563 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 4 states. [2019-10-14 22:06:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:37,673 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-10-14 22:06:37,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 22:06:37,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-14 22:06:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:37,677 INFO L225 Difference]: With dead ends: 75 [2019-10-14 22:06:37,677 INFO L226 Difference]: Without dead ends: 53 [2019-10-14 22:06:37,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-14 22:06:37,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2019-10-14 22:06:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-14 22:06:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-10-14 22:06:37,699 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 14 [2019-10-14 22:06:37,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:37,699 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-10-14 22:06:37,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 22:06:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-10-14 22:06:37,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 22:06:37,701 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:37,701 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:37,701 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:37,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:37,702 INFO L82 PathProgramCache]: Analyzing trace with hash 2075944349, now seen corresponding path program 1 times [2019-10-14 22:06:37,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:37,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597125464] [2019-10-14 22:06:37,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:37,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:37,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:37,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597125464] [2019-10-14 22:06:37,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:37,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 22:06:37,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675296666] [2019-10-14 22:06:37,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 22:06:37,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:37,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 22:06:37,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:37,828 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 4 states. [2019-10-14 22:06:37,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:37,907 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-10-14 22:06:37,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 22:06:37,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-14 22:06:37,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:37,909 INFO L225 Difference]: With dead ends: 42 [2019-10-14 22:06:37,909 INFO L226 Difference]: Without dead ends: 40 [2019-10-14 22:06:37,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:37,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-14 22:06:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-14 22:06:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-14 22:06:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-10-14 22:06:37,921 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2019-10-14 22:06:37,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:37,921 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-10-14 22:06:37,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 22:06:37,922 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-10-14 22:06:37,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 22:06:37,924 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:37,924 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:37,925 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:37,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:37,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2075946271, now seen corresponding path program 1 times [2019-10-14 22:06:37,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:37,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693866958] [2019-10-14 22:06:37,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:37,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:37,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:38,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693866958] [2019-10-14 22:06:38,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:38,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:06:38,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626988147] [2019-10-14 22:06:38,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:06:38,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:38,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:06:38,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:06:38,160 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2019-10-14 22:06:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:38,443 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-10-14 22:06:38,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:06:38,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-14 22:06:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:38,444 INFO L225 Difference]: With dead ends: 51 [2019-10-14 22:06:38,444 INFO L226 Difference]: Without dead ends: 38 [2019-10-14 22:06:38,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:06:38,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-14 22:06:38,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-14 22:06:38,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-14 22:06:38,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-10-14 22:06:38,462 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 17 [2019-10-14 22:06:38,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:38,462 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-10-14 22:06:38,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:06:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-10-14 22:06:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 22:06:38,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:38,464 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:38,465 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:38,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:38,465 INFO L82 PathProgramCache]: Analyzing trace with hash -351040154, now seen corresponding path program 1 times [2019-10-14 22:06:38,466 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:38,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754232067] [2019-10-14 22:06:38,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:38,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:38,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:38,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754232067] [2019-10-14 22:06:38,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942070858] [2019-10-14 22:06:38,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:06:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:38,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-14 22:06:38,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:06:38,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:06:38,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:38,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:38,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:38,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-14 22:06:38,827 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:38,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:06:38,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:38,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:38,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:38,909 INFO L341 Elim1Store]: treesize reduction 30, result has 57.7 percent of original size [2019-10-14 22:06:38,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 51 [2019-10-14 22:06:38,911 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:38,943 INFO L567 ElimStorePlain]: treesize reduction 24, result has 59.3 percent of original size [2019-10-14 22:06:38,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:06:38,945 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:32 [2019-10-14 22:06:40,979 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-14 22:06:41,036 INFO L341 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2019-10-14 22:06:41,036 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 41 [2019-10-14 22:06:41,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:41,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:41,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:41,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:23 [2019-10-14 22:06:43,111 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[|v_#memory_$Pointer$.base_22|]} [2019-10-14 22:06:43,118 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:06:43,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:43,148 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:43,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2019-10-14 22:06:43,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:43,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:43,154 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:43,169 INFO L567 ElimStorePlain]: treesize reduction 19, result has 32.1 percent of original size [2019-10-14 22:06:43,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:43,170 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:4 [2019-10-14 22:06:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:43,172 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:06:43,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-10-14 22:06:43,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957527807] [2019-10-14 22:06:43,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 22:06:43,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:43,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 22:06:43,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2019-10-14 22:06:43,174 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 8 states. [2019-10-14 22:06:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:53,415 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-10-14 22:06:53,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 22:06:53,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-10-14 22:06:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:53,417 INFO L225 Difference]: With dead ends: 65 [2019-10-14 22:06:53,417 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 22:06:53,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=28, Invalid=61, Unknown=1, NotChecked=0, Total=90 [2019-10-14 22:06:53,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 22:06:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2019-10-14 22:06:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-14 22:06:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2019-10-14 22:06:53,426 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 17 [2019-10-14 22:06:53,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:53,426 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-10-14 22:06:53,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 22:06:53,427 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2019-10-14 22:06:53,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 22:06:53,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:53,428 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:53,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:06:53,629 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:53,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:53,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2111834143, now seen corresponding path program 1 times [2019-10-14 22:06:53,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:53,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049635189] [2019-10-14 22:06:53,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:53,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:53,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:53,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049635189] [2019-10-14 22:06:53,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:53,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 22:06:53,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500764937] [2019-10-14 22:06:53,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 22:06:53,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:53,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 22:06:53,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:53,707 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 4 states. [2019-10-14 22:06:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:53,829 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2019-10-14 22:06:53,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 22:06:53,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-14 22:06:53,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:53,831 INFO L225 Difference]: With dead ends: 100 [2019-10-14 22:06:53,831 INFO L226 Difference]: Without dead ends: 77 [2019-10-14 22:06:53,832 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:06:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-14 22:06:53,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2019-10-14 22:06:53,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-14 22:06:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2019-10-14 22:06:53,839 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 21 [2019-10-14 22:06:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:53,840 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2019-10-14 22:06:53,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 22:06:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2019-10-14 22:06:53,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 22:06:53,841 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:53,841 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:53,842 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:53,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:53,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2016892268, now seen corresponding path program 1 times [2019-10-14 22:06:53,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:53,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073048649] [2019-10-14 22:06:53,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:53,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:53,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:54,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073048649] [2019-10-14 22:06:54,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817962345] [2019-10-14 22:06:54,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:06:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:54,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-14 22:06:54,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:06:54,317 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:06:54,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:54,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:06:54,350 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:54,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,360 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2019-10-14 22:06:54,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:54,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:06:54,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:54,508 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_26|, |v_#memory_int_24|, |v_#memory_int_25|], 8=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_20|]} [2019-10-14 22:06:54,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:54,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-14 22:06:54,523 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:54,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-14 22:06:54,589 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:54,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:54,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-14 22:06:54,637 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:54,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:54,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:54,731 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:54,731 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 1 case distinctions, treesize of input 63 treesize of output 49 [2019-10-14 22:06:54,732 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,789 INFO L567 ElimStorePlain]: treesize reduction 24, result has 84.2 percent of original size [2019-10-14 22:06:54,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:54,806 INFO L341 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-10-14 22:06:54,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 1 case distinctions, treesize of input 63 treesize of output 25 [2019-10-14 22:06:54,807 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:54,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,833 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:245, output treesize:59 [2019-10-14 22:06:54,882 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_27|], 12=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_21|]} [2019-10-14 22:06:54,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-14 22:06:54,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:54,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:54,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:54,951 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 41 treesize of output 31 [2019-10-14 22:06:54,952 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:54,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:54,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:54,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:54,989 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 41 treesize of output 31 [2019-10-14 22:06:54,989 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:55,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:55,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:55,011 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:110, output treesize:68 [2019-10-14 22:06:55,072 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_int_28|], 6=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_22|]} [2019-10-14 22:06:55,078 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 37 treesize of output 24 [2019-10-14 22:06:55,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:55,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:55,156 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:55,156 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 4 case distinctions, treesize of input 107 treesize of output 127 [2019-10-14 22:06:55,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:55,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:06:55,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:55,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:55,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:55,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:55,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:55,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:55,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:06:55,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:55,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:55,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:55,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:55,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:55,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:55,175 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2019-10-14 22:06:55,337 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-10-14 22:06:55,337 INFO L567 ElimStorePlain]: treesize reduction 1277, result has 8.0 percent of original size [2019-10-14 22:06:55,347 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 87 treesize of output 69 [2019-10-14 22:06:55,349 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:55,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:55,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:06:55,370 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:164, output treesize:83 [2019-10-14 22:06:55,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:06:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:55,437 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:06:55,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-10-14 22:06:55,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823268634] [2019-10-14 22:06:55,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-14 22:06:55,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:55,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-14 22:06:55,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-14 22:06:55,439 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 13 states. [2019-10-14 22:06:56,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:56,130 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-10-14 22:06:56,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 22:06:56,130 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-10-14 22:06:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:56,131 INFO L225 Difference]: With dead ends: 86 [2019-10-14 22:06:56,131 INFO L226 Difference]: Without dead ends: 76 [2019-10-14 22:06:56,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-14 22:06:56,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-14 22:06:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-10-14 22:06:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-14 22:06:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2019-10-14 22:06:56,140 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 23 [2019-10-14 22:06:56,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:56,141 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2019-10-14 22:06:56,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-14 22:06:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2019-10-14 22:06:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 22:06:56,142 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:56,142 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:56,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:06:56,351 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:56,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:56,351 INFO L82 PathProgramCache]: Analyzing trace with hash -148911397, now seen corresponding path program 2 times [2019-10-14 22:06:56,352 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:56,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580093625] [2019-10-14 22:06:56,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:56,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:56,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:56,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580093625] [2019-10-14 22:06:56,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804420038] [2019-10-14 22:06:56,462 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:06:56,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:06:56,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:06:56,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-14 22:06:56,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:06:56,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:06:56,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:56,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:56,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:56,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:06:56,641 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:56,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:06:56,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:56,706 INFO L567 ElimStorePlain]: treesize reduction 14, result has 89.4 percent of original size [2019-10-14 22:06:56,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:06:56,763 INFO L341 Elim1Store]: treesize reduction 30, result has 57.7 percent of original size [2019-10-14 22:06:56,764 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 2 case distinctions, treesize of input 67 treesize of output 51 [2019-10-14 22:06:56,765 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:56,826 INFO L567 ElimStorePlain]: treesize reduction 24, result has 66.7 percent of original size [2019-10-14 22:06:56,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:06:56,827 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:120, output treesize:45 [2019-10-14 22:06:58,857 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 30 [2019-10-14 22:06:58,900 INFO L341 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2019-10-14 22:06:58,901 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 41 [2019-10-14 22:06:58,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:06:58,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:06:58,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:06:58,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:36 [2019-10-14 22:07:01,040 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:01,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-14 22:07:01,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:01,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:01,271 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-10-14 22:07:01,272 INFO L341 Elim1Store]: treesize reduction 25, result has 86.0 percent of original size [2019-10-14 22:07:01,273 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 5 case distinctions, treesize of input 179 treesize of output 206 [2019-10-14 22:07:01,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:01,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:07:01,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:01,335 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:01,433 INFO L567 ElimStorePlain]: treesize reduction 148, result has 28.5 percent of original size [2019-10-14 22:07:01,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:01,436 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:210, output treesize:93 [2019-10-14 22:07:01,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:01,623 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-10-14 22:07:01,623 INFO L341 Elim1Store]: treesize reduction 48, result has 59.7 percent of original size [2019-10-14 22:07:01,624 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 5 case distinctions, treesize of input 85 treesize of output 106 [2019-10-14 22:07:01,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,636 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:01,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:01,878 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-10-14 22:07:01,879 INFO L341 Elim1Store]: treesize reduction 76, result has 63.8 percent of original size [2019-10-14 22:07:01,880 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 9 case distinctions, treesize of input 106 treesize of output 175 [2019-10-14 22:07:01,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,897 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:02,052 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2019-10-14 22:07:02,053 INFO L567 ElimStorePlain]: treesize reduction 136, result has 42.4 percent of original size [2019-10-14 22:07:02,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:02,056 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:192, output treesize:50 [2019-10-14 22:07:02,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,197 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 20=[|v_#memory_$Pointer$.base_30|]} [2019-10-14 22:07:02,201 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:02,204 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:02,246 INFO L567 ElimStorePlain]: treesize reduction 139, result has 44.0 percent of original size [2019-10-14 22:07:02,274 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:02,274 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 132 treesize of output 90 [2019-10-14 22:07:02,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:02,294 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:02,314 INFO L567 ElimStorePlain]: treesize reduction 39, result has 30.4 percent of original size [2019-10-14 22:07:02,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:02,315 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:266, output treesize:4 [2019-10-14 22:07:02,320 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:02,320 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:02,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-10-14 22:07:02,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750151079] [2019-10-14 22:07:02,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 22:07:02,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:02,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 22:07:02,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=77, Unknown=3, NotChecked=0, Total=110 [2019-10-14 22:07:02,321 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 11 states. [2019-10-14 22:07:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:12,673 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2019-10-14 22:07:12,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 22:07:12,678 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-10-14 22:07:12,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:12,680 INFO L225 Difference]: With dead ends: 103 [2019-10-14 22:07:12,680 INFO L226 Difference]: Without dead ends: 101 [2019-10-14 22:07:12,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=48, Invalid=131, Unknown=3, NotChecked=0, Total=182 [2019-10-14 22:07:12,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-14 22:07:12,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2019-10-14 22:07:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-14 22:07:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2019-10-14 22:07:12,698 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 23 [2019-10-14 22:07:12,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:12,698 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2019-10-14 22:07:12,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 22:07:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2019-10-14 22:07:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 22:07:12,700 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:12,700 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:12,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:12,904 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:12,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:12,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1680620617, now seen corresponding path program 2 times [2019-10-14 22:07:12,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:12,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096332284] [2019-10-14 22:07:12,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:12,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:12,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:13,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096332284] [2019-10-14 22:07:13,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7363861] [2019-10-14 22:07:13,363 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:13,489 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:07:13,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:13,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-14 22:07:13,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:13,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:13,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:13,553 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:13,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,653 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.4 percent of original size [2019-10-14 22:07:13,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,666 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:13,677 INFO L341 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-10-14 22:07:13,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 25 [2019-10-14 22:07:13,678 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,725 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,726 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 1 case distinctions, treesize of input 63 treesize of output 41 [2019-10-14 22:07:13,726 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,781 INFO L567 ElimStorePlain]: treesize reduction 16, result has 80.5 percent of original size [2019-10-14 22:07:13,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,782 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:200, output treesize:63 [2019-10-14 22:07:13,835 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 12=[|v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.base_32|]} [2019-10-14 22:07:13,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:07:13,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,900 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 41 treesize of output 31 [2019-10-14 22:07:13,901 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2019-10-14 22:07:13,961 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,996 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:114, output treesize:72 [2019-10-14 22:07:14,093 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:14,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-14 22:07:14,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:14,325 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-10-14 22:07:14,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:14,333 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_29|, |v_#memory_int_32|], 2=[|v_#memory_int_30|], 24=[|v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.base_33|]} [2019-10-14 22:07:14,342 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:14,554 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-14 22:07:14,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:14,584 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 59 treesize of output 26 [2019-10-14 22:07:14,585 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:14,716 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-10-14 22:07:14,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:14,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:14,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2019-10-14 22:07:14,729 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:14,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:14,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:14,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:14,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:14,839 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:14,860 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:14,860 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 1 case distinctions, treesize of input 124 treesize of output 72 [2019-10-14 22:07:14,861 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:14,972 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-14 22:07:14,972 INFO L567 ElimStorePlain]: treesize reduction 16, result has 94.4 percent of original size [2019-10-14 22:07:14,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:15,031 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:15,032 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 7 case distinctions, treesize of input 185 treesize of output 158 [2019-10-14 22:07:15,034 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:15,152 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-10-14 22:07:15,152 INFO L567 ElimStorePlain]: treesize reduction 114, result has 51.9 percent of original size [2019-10-14 22:07:15,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:15,153 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:446, output treesize:109 [2019-10-14 22:07:15,212 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_33|], 25=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_26|]} [2019-10-14 22:07:15,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:15,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-10-14 22:07:15,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:15,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:15,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:15,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:15,302 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:15,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 101 treesize of output 108 [2019-10-14 22:07:15,303 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:15,397 INFO L567 ElimStorePlain]: treesize reduction 72, result has 65.6 percent of original size [2019-10-14 22:07:15,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:15,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:15,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:15,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:15,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2019-10-14 22:07:15,412 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:15,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:15,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:15,451 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:160, output treesize:118 [2019-10-14 22:07:15,534 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_int_34|], 4=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_27|]} [2019-10-14 22:07:15,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:15,541 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 59 treesize of output 30 [2019-10-14 22:07:15,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:15,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:15,602 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:15,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 207 treesize of output 152 [2019-10-14 22:07:15,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,631 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:15,731 INFO L567 ElimStorePlain]: treesize reduction 96, result has 65.2 percent of original size [2019-10-14 22:07:15,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:15,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:15,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2019-10-14 22:07:15,771 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:15,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:15,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:15,803 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:263, output treesize:190 [2019-10-14 22:07:15,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:15,872 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:15,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-10-14 22:07:15,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547004029] [2019-10-14 22:07:15,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 22:07:15,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:15,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 22:07:15,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-10-14 22:07:15,874 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand 14 states. [2019-10-14 22:07:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:16,586 INFO L93 Difference]: Finished difference Result 118 states and 138 transitions. [2019-10-14 22:07:16,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 22:07:16,586 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-10-14 22:07:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:16,588 INFO L225 Difference]: With dead ends: 118 [2019-10-14 22:07:16,588 INFO L226 Difference]: Without dead ends: 116 [2019-10-14 22:07:16,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-10-14 22:07:16,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-14 22:07:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2019-10-14 22:07:16,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-14 22:07:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2019-10-14 22:07:16,599 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 29 [2019-10-14 22:07:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:16,600 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2019-10-14 22:07:16,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 22:07:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2019-10-14 22:07:16,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 22:07:16,601 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:16,602 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:16,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:16,806 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:16,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:16,806 INFO L82 PathProgramCache]: Analyzing trace with hash -746365808, now seen corresponding path program 3 times [2019-10-14 22:07:16,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:16,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517034234] [2019-10-14 22:07:16,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:16,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:16,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:16,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517034234] [2019-10-14 22:07:16,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745308073] [2019-10-14 22:07:16,982 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:17,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-14 22:07:17,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:17,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-14 22:07:17,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:17,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:17,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:17,342 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:17,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,439 INFO L567 ElimStorePlain]: treesize reduction 14, result has 89.6 percent of original size [2019-10-14 22:07:17,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:17,511 INFO L341 Elim1Store]: treesize reduction 30, result has 57.7 percent of original size [2019-10-14 22:07:17,511 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 2 case distinctions, treesize of input 67 treesize of output 51 [2019-10-14 22:07:17,512 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,576 INFO L567 ElimStorePlain]: treesize reduction 24, result has 68.0 percent of original size [2019-10-14 22:07:17,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:17,578 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:123, output treesize:48 [2019-10-14 22:07:17,671 INFO L341 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2019-10-14 22:07:17,672 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 41 [2019-10-14 22:07:17,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:17,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:17,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:56 [2019-10-14 22:07:17,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:17,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:19,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:20,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms