java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-sorted-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 18:08:39,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 18:08:39,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 18:08:39,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 18:08:39,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 18:08:39,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 18:08:39,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 18:08:39,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 18:08:39,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 18:08:39,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 18:08:39,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 18:08:39,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 18:08:39,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 18:08:39,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 18:08:39,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 18:08:39,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 18:08:39,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 18:08:39,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 18:08:39,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 18:08:39,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 18:08:39,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 18:08:39,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 18:08:39,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 18:08:39,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 18:08:39,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 18:08:39,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 18:08:39,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 18:08:39,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 18:08:39,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 18:08:39,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 18:08:39,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 18:08:39,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 18:08:39,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 18:08:39,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 18:08:39,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 18:08:39,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 18:08:39,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 18:08:39,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 18:08:39,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 18:08:39,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 18:08:39,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 18:08:39,888 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 18:08:39,923 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 18:08:39,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 18:08:39,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 18:08:39,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 18:08:39,928 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 18:08:39,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 18:08:39,928 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 18:08:39,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 18:08:39,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 18:08:39,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 18:08:39,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 18:08:39,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 18:08:39,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 18:08:39,929 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 18:08:39,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 18:08:39,930 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 18:08:39,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 18:08:39,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 18:08:39,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 18:08:39,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 18:08:39,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 18:08:39,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 18:08:39,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 18:08:39,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 18:08:39,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 18:08:39,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 18:08:39,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 18:08:39,934 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 18:08:39,934 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 18:08:40,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 18:08:40,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 18:08:40,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 18:08:40,280 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 18:08:40,281 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 18:08:40,281 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-sorted-2.i [2019-10-13 18:08:40,354 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1853ba8f0/d4afb861ea024aa2b1483d70b107a831/FLAG45f2d34eb [2019-10-13 18:08:40,902 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 18:08:40,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i [2019-10-13 18:08:40,916 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1853ba8f0/d4afb861ea024aa2b1483d70b107a831/FLAG45f2d34eb [2019-10-13 18:08:41,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1853ba8f0/d4afb861ea024aa2b1483d70b107a831 [2019-10-13 18:08:41,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 18:08:41,273 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 18:08:41,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 18:08:41,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 18:08:41,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 18:08:41,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:08:41" (1/1) ... [2019-10-13 18:08:41,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a78272c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:41, skipping insertion in model container [2019-10-13 18:08:41,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:08:41" (1/1) ... [2019-10-13 18:08:41,291 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 18:08:41,349 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 18:08:41,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 18:08:41,800 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 18:08:41,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 18:08:41,902 INFO L192 MainTranslator]: Completed translation [2019-10-13 18:08:41,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:41 WrapperNode [2019-10-13 18:08:41,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 18:08:41,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 18:08:41,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 18:08:41,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 18:08:41,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:41" (1/1) ... [2019-10-13 18:08:41,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:41" (1/1) ... [2019-10-13 18:08:41,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:41" (1/1) ... [2019-10-13 18:08:41,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:41" (1/1) ... [2019-10-13 18:08:41,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:41" (1/1) ... [2019-10-13 18:08:41,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:41" (1/1) ... [2019-10-13 18:08:41,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:41" (1/1) ... [2019-10-13 18:08:41,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 18:08:41,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 18:08:41,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 18:08:41,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 18:08:41,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 18:08:42,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 18:08:42,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 18:08:42,039 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 18:08:42,039 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 18:08:42,039 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 18:08:42,039 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 18:08:42,039 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 18:08:42,039 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 18:08:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 18:08:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 18:08:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 18:08:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 18:08:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 18:08:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 18:08:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 18:08:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 18:08:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 18:08:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 18:08:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 18:08:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 18:08:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 18:08:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 18:08:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 18:08:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 18:08:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 18:08:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 18:08:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 18:08:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 18:08:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 18:08:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 18:08:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 18:08:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 18:08:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 18:08:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 18:08:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 18:08:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 18:08:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 18:08:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 18:08:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 18:08:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 18:08:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 18:08:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 18:08:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 18:08:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 18:08:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 18:08:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 18:08:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 18:08:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 18:08:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 18:08:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 18:08:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 18:08:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 18:08:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 18:08:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 18:08:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 18:08:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 18:08:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 18:08:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 18:08:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 18:08:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 18:08:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 18:08:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 18:08:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 18:08:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 18:08:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 18:08:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 18:08:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 18:08:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 18:08:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 18:08:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 18:08:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 18:08:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 18:08:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 18:08:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 18:08:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 18:08:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 18:08:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 18:08:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 18:08:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 18:08:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 18:08:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 18:08:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 18:08:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 18:08:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 18:08:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 18:08:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 18:08:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 18:08:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 18:08:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 18:08:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 18:08:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 18:08:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 18:08:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 18:08:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 18:08:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 18:08:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 18:08:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 18:08:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 18:08:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 18:08:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 18:08:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 18:08:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 18:08:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 18:08:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 18:08:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 18:08:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 18:08:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 18:08:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 18:08:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 18:08:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 18:08:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 18:08:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 18:08:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 18:08:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 18:08:42,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 18:08:42,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 18:08:42,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 18:08:42,752 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 18:08:42,752 INFO L284 CfgBuilder]: Removed 20 assume(true) statements. [2019-10-13 18:08:42,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:08:42 BoogieIcfgContainer [2019-10-13 18:08:42,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 18:08:42,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 18:08:42,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 18:08:42,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 18:08:42,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:08:41" (1/3) ... [2019-10-13 18:08:42,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c4fb9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:08:42, skipping insertion in model container [2019-10-13 18:08:42,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:41" (2/3) ... [2019-10-13 18:08:42,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c4fb9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:08:42, skipping insertion in model container [2019-10-13 18:08:42,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:08:42" (3/3) ... [2019-10-13 18:08:42,763 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2019-10-13 18:08:42,772 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 18:08:42,781 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-10-13 18:08:42,793 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-10-13 18:08:42,818 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 18:08:42,818 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 18:08:42,818 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 18:08:42,818 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 18:08:42,819 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 18:08:42,819 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 18:08:42,819 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 18:08:42,819 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 18:08:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2019-10-13 18:08:42,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 18:08:42,844 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:42,845 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:42,847 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:42,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:42,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1007014106, now seen corresponding path program 1 times [2019-10-13 18:08:42,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:42,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822175626] [2019-10-13 18:08:42,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:42,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:42,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:43,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822175626] [2019-10-13 18:08:43,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:43,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 18:08:43,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111427698] [2019-10-13 18:08:43,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 18:08:43,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:43,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 18:08:43,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 18:08:43,076 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 3 states. [2019-10-13 18:08:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:43,305 INFO L93 Difference]: Finished difference Result 124 states and 196 transitions. [2019-10-13 18:08:43,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 18:08:43,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-13 18:08:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:43,319 INFO L225 Difference]: With dead ends: 124 [2019-10-13 18:08:43,319 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 18:08:43,329 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 18:08:43,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 18:08:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-10-13 18:08:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 18:08:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-10-13 18:08:43,370 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 10 [2019-10-13 18:08:43,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:43,370 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-10-13 18:08:43,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 18:08:43,371 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-10-13 18:08:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 18:08:43,371 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:43,371 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:43,372 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:43,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:43,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1170755113, now seen corresponding path program 1 times [2019-10-13 18:08:43,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:43,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025047095] [2019-10-13 18:08:43,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:43,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:43,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:43,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025047095] [2019-10-13 18:08:43,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:43,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 18:08:43,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230399809] [2019-10-13 18:08:43,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 18:08:43,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:43,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 18:08:43,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 18:08:43,452 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 4 states. [2019-10-13 18:08:43,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:43,628 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2019-10-13 18:08:43,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 18:08:43,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-13 18:08:43,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:43,630 INFO L225 Difference]: With dead ends: 119 [2019-10-13 18:08:43,630 INFO L226 Difference]: Without dead ends: 65 [2019-10-13 18:08:43,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 18:08:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-13 18:08:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-10-13 18:08:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-13 18:08:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-10-13 18:08:43,641 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 11 [2019-10-13 18:08:43,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:43,642 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-10-13 18:08:43,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 18:08:43,642 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-10-13 18:08:43,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 18:08:43,643 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:43,643 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:43,643 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:43,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:43,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1725322068, now seen corresponding path program 1 times [2019-10-13 18:08:43,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:43,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736359733] [2019-10-13 18:08:43,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:43,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:43,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:43,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 18:08:43,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736359733] [2019-10-13 18:08:43,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:43,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 18:08:43,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940260970] [2019-10-13 18:08:43,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 18:08:43,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:43,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 18:08:43,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 18:08:43,765 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 5 states. [2019-10-13 18:08:43,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:43,958 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2019-10-13 18:08:43,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 18:08:43,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-13 18:08:43,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:43,960 INFO L225 Difference]: With dead ends: 103 [2019-10-13 18:08:43,960 INFO L226 Difference]: Without dead ends: 101 [2019-10-13 18:08:43,960 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 18:08:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-13 18:08:43,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 62. [2019-10-13 18:08:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-13 18:08:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2019-10-13 18:08:43,969 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 15 [2019-10-13 18:08:43,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:43,970 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-10-13 18:08:43,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 18:08:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2019-10-13 18:08:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 18:08:43,971 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:43,971 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] [2019-10-13 18:08:43,972 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:43,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:43,972 INFO L82 PathProgramCache]: Analyzing trace with hash -964262520, now seen corresponding path program 1 times [2019-10-13 18:08:43,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:43,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336391918] [2019-10-13 18:08:43,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:43,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:43,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:44,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336391918] [2019-10-13 18:08:44,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313595734] [2019-10-13 18:08:44,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:44,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-13 18:08:44,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:44,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:08:44,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:44,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:44,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:44,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-13 18:08:44,604 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:44,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 18:08:44,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:44,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:44,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:44,632 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:44,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:44,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:44,655 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:44,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:44,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:44,670 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:33 [2019-10-13 18:08:44,709 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|], 6=[|v_#memory_$Pointer$.base_31|, |v_#memory_$Pointer$.offset_31|]} [2019-10-13 18:08:44,714 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 25 treesize of output 17 [2019-10-13 18:08:44,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:44,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:44,814 INFO L341 Elim1Store]: treesize reduction 66, result has 49.6 percent of original size [2019-10-13 18:08:44,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 149 [2019-10-13 18:08:44,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:44,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:44,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:44,824 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-10-13 18:08:44,877 INFO L567 ElimStorePlain]: treesize reduction 222, result has 30.0 percent of original size [2019-10-13 18:08:44,905 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:44,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 105 [2019-10-13 18:08:44,907 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:44,931 INFO L567 ElimStorePlain]: treesize reduction 58, result has 49.1 percent of original size [2019-10-13 18:08:44,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:44,932 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:56 [2019-10-13 18:08:45,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:45,025 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:45,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-10-13 18:08:45,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843842813] [2019-10-13 18:08:45,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 18:08:45,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:45,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 18:08:45,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-13 18:08:45,027 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 13 states. [2019-10-13 18:08:45,645 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-10-13 18:08:45,798 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-10-13 18:08:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:46,186 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2019-10-13 18:08:46,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 18:08:46,188 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-10-13 18:08:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:46,191 INFO L225 Difference]: With dead ends: 154 [2019-10-13 18:08:46,191 INFO L226 Difference]: Without dead ends: 110 [2019-10-13 18:08:46,192 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-10-13 18:08:46,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-13 18:08:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 75. [2019-10-13 18:08:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-13 18:08:46,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2019-10-13 18:08:46,204 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 22 [2019-10-13 18:08:46,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:46,204 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2019-10-13 18:08:46,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 18:08:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2019-10-13 18:08:46,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 18:08:46,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:46,206 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, 1, 1] [2019-10-13 18:08:46,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:46,411 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:46,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:46,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1597211810, now seen corresponding path program 1 times [2019-10-13 18:08:46,412 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:46,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338518909] [2019-10-13 18:08:46,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:46,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:46,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:46,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338518909] [2019-10-13 18:08:46,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155246834] [2019-10-13 18:08:46,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:46,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-13 18:08:46,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:46,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:08:46,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:46,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:46,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:46,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-13 18:08:46,856 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:46,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 18:08:46,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:46,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:46,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:46,875 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:46,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:46,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:46,900 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:46,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:46,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:46,908 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:33 [2019-10-13 18:08:46,939 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_33|], 6=[|v_#memory_$Pointer$.offset_33|, |v_#memory_$Pointer$.base_33|]} [2019-10-13 18:08:46,944 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 25 treesize of output 17 [2019-10-13 18:08:46,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:46,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:46,975 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:46,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 136 [2019-10-13 18:08:46,978 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:47,010 INFO L567 ElimStorePlain]: treesize reduction 58, result has 62.1 percent of original size [2019-10-13 18:08:47,066 INFO L341 Elim1Store]: treesize reduction 66, result has 49.6 percent of original size [2019-10-13 18:08:47,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 122 [2019-10-13 18:08:47,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:47,070 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:47,092 INFO L567 ElimStorePlain]: treesize reduction 40, result has 58.3 percent of original size [2019-10-13 18:08:47,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:47,093 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:56 [2019-10-13 18:08:47,189 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:47,190 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 63 treesize of output 54 [2019-10-13 18:08:47,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:47,217 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.2 percent of original size [2019-10-13 18:08:47,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2019-10-13 18:08:47,221 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:47,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:47,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:47,226 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:9 [2019-10-13 18:08:47,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-13 18:08:47,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:47,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:47,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:47,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-10-13 18:08:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:47,257 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:47,257 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-10-13 18:08:47,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649251854] [2019-10-13 18:08:47,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 18:08:47,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:47,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 18:08:47,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-10-13 18:08:47,259 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 15 states. [2019-10-13 18:08:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:48,298 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2019-10-13 18:08:48,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 18:08:48,299 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-10-13 18:08:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:48,301 INFO L225 Difference]: With dead ends: 103 [2019-10-13 18:08:48,301 INFO L226 Difference]: Without dead ends: 101 [2019-10-13 18:08:48,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2019-10-13 18:08:48,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-13 18:08:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-10-13 18:08:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-13 18:08:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2019-10-13 18:08:48,311 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 25 [2019-10-13 18:08:48,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:48,311 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2019-10-13 18:08:48,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 18:08:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2019-10-13 18:08:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 18:08:48,313 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:48,313 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:48,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:48,517 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:48,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:48,518 INFO L82 PathProgramCache]: Analyzing trace with hash -474324013, now seen corresponding path program 1 times [2019-10-13 18:08:48,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:48,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221794511] [2019-10-13 18:08:48,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:48,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:48,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:48,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221794511] [2019-10-13 18:08:48,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886752427] [2019-10-13 18:08:48,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:48,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-13 18:08:48,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:48,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:08:48,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 18:08:49,017 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,027 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-13 18:08:49,051 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 18:08:49,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,091 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2019-10-13 18:08:49,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:49,099 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-13 18:08:49,100 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,118 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-13 18:08:49,119 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,130 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:59, output treesize:27 [2019-10-13 18:08:49,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-13 18:08:49,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-10-13 18:08:49,232 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-13 18:08:49,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,254 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_36|], 6=[|v_#memory_int_39|]} [2019-10-13 18:08:49,258 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:49,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,291 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-10-13 18:08:49,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 32 [2019-10-13 18:08:49,292 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:49,306 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:71, output treesize:34 [2019-10-13 18:08:49,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-10-13 18:08:49,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:49,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:43 [2019-10-13 18:08:49,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-10-13 18:08:49,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:49,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:49,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-10-13 18:08:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:49,496 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:49,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2019-10-13 18:08:49,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847179648] [2019-10-13 18:08:49,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 18:08:49,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:49,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 18:08:49,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-10-13 18:08:49,498 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand 17 states. [2019-10-13 18:08:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:51,505 INFO L93 Difference]: Finished difference Result 244 states and 294 transitions. [2019-10-13 18:08:51,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-13 18:08:51,505 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-10-13 18:08:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:51,508 INFO L225 Difference]: With dead ends: 244 [2019-10-13 18:08:51,508 INFO L226 Difference]: Without dead ends: 242 [2019-10-13 18:08:51,509 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=269, Invalid=921, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 18:08:51,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-10-13 18:08:51,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 86. [2019-10-13 18:08:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-13 18:08:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2019-10-13 18:08:51,542 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 26 [2019-10-13 18:08:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:51,543 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2019-10-13 18:08:51,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 18:08:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2019-10-13 18:08:51,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 18:08:51,549 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:51,549 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:51,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:51,754 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:51,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:51,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1238565257, now seen corresponding path program 1 times [2019-10-13 18:08:51,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:51,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887805849] [2019-10-13 18:08:51,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:51,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:51,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:52,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887805849] [2019-10-13 18:08:52,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732749258] [2019-10-13 18:08:52,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:52,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-13 18:08:52,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:52,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:08:52,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:52,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:52,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:52,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-13 18:08:52,489 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:52,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 18:08:52,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:52,535 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.1 percent of original size [2019-10-13 18:08:52,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:52,545 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:52,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:52,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:52,568 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:52,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:52,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:52,583 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:71, output treesize:43 [2019-10-13 18:08:52,622 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 6=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_35|]} [2019-10-13 18:08:52,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 18:08:52,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:52,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:52,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:52,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:52,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:52,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:52,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:52,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:52,698 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:52,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:52,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:52,713 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:94, output treesize:52 [2019-10-13 18:08:52,807 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:52,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-13 18:08:52,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:52,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:52,857 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_41|, |v_#memory_int_43|], 10=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_36|]} [2019-10-13 18:08:52,860 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:52,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:52,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:52,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 36 [2019-10-13 18:08:52,914 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:52,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:53,004 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:53,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 181 treesize of output 194 [2019-10-13 18:08:53,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:53,008 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:53,070 INFO L567 ElimStorePlain]: treesize reduction 96, result has 59.5 percent of original size [2019-10-13 18:08:53,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 67 [2019-10-13 18:08:53,076 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:53,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:53,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:53,094 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:227, output treesize:67 [2019-10-13 18:08:53,144 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_44|], 6=[|v_#memory_$Pointer$.offset_37|], 12=[|v_#memory_$Pointer$.base_37|]} [2019-10-13 18:08:53,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2019-10-13 18:08:53,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:53,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:53,230 INFO L341 Elim1Store]: treesize reduction 46, result has 55.3 percent of original size [2019-10-13 18:08:53,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 223 treesize of output 210 [2019-10-13 18:08:53,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:53,234 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:53,303 INFO L567 ElimStorePlain]: treesize reduction 48, result has 78.6 percent of original size [2019-10-13 18:08:53,422 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-10-13 18:08:53,423 INFO L341 Elim1Store]: treesize reduction 54, result has 69.3 percent of original size [2019-10-13 18:08:53,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 187 [2019-10-13 18:08:53,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:53,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:53,428 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:53,470 INFO L567 ElimStorePlain]: treesize reduction 148, result has 45.0 percent of original size [2019-10-13 18:08:53,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:53,471 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:247, output treesize:121 [2019-10-13 18:08:53,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:53,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 7 [2019-10-13 18:08:53,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:53,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:53,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:53,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:122, output treesize:84 [2019-10-13 18:08:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:53,692 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:53,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-10-13 18:08:53,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590880803] [2019-10-13 18:08:53,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 18:08:53,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:53,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 18:08:53,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-13 18:08:53,694 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 19 states. [2019-10-13 18:08:54,654 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-10-13 18:08:55,141 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2019-10-13 18:08:55,409 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 88 [2019-10-13 18:08:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:56,053 INFO L93 Difference]: Finished difference Result 200 states and 241 transitions. [2019-10-13 18:08:56,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 18:08:56,054 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2019-10-13 18:08:56,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:56,056 INFO L225 Difference]: With dead ends: 200 [2019-10-13 18:08:56,056 INFO L226 Difference]: Without dead ends: 165 [2019-10-13 18:08:56,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2019-10-13 18:08:56,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-13 18:08:56,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 100. [2019-10-13 18:08:56,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-13 18:08:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2019-10-13 18:08:56,070 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 29 [2019-10-13 18:08:56,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:56,070 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2019-10-13 18:08:56,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 18:08:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2019-10-13 18:08:56,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 18:08:56,071 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:56,072 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:56,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:56,276 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:56,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:56,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2047911883, now seen corresponding path program 1 times [2019-10-13 18:08:56,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:56,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125451616] [2019-10-13 18:08:56,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:56,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:56,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 18:08:56,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125451616] [2019-10-13 18:08:56,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:56,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 18:08:56,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370782267] [2019-10-13 18:08:56,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 18:08:56,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:56,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 18:08:56,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 18:08:56,349 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand 6 states. [2019-10-13 18:08:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:56,525 INFO L93 Difference]: Finished difference Result 148 states and 183 transitions. [2019-10-13 18:08:56,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 18:08:56,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-10-13 18:08:56,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:56,527 INFO L225 Difference]: With dead ends: 148 [2019-10-13 18:08:56,527 INFO L226 Difference]: Without dead ends: 110 [2019-10-13 18:08:56,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 18:08:56,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-13 18:08:56,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2019-10-13 18:08:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-13 18:08:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-10-13 18:08:56,571 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 29 [2019-10-13 18:08:56,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:56,572 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-10-13 18:08:56,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 18:08:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-10-13 18:08:56,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 18:08:56,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:56,580 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:56,583 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:56,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:56,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1863000761, now seen corresponding path program 1 times [2019-10-13 18:08:56,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:56,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079795811] [2019-10-13 18:08:56,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:56,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:56,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:57,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079795811] [2019-10-13 18:08:57,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567599044] [2019-10-13 18:08:57,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:57,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-13 18:08:57,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:57,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:08:57,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:57,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:57,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:57,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-13 18:08:57,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:57,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 18:08:57,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:57,251 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-10-13 18:08:57,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:57,259 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:57,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:57,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:57,281 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:57,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:57,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:57,298 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-10-13 18:08:57,340 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_46|], 6=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_39|]} [2019-10-13 18:08:57,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 18:08:57,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:57,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:57,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:57,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:57,386 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:57,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:57,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:57,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:08:57,419 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:57,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:57,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:57,442 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:97, output treesize:55 [2019-10-13 18:08:57,537 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:57,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-13 18:08:57,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:57,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:57,595 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_47|], 2=[|v_#memory_int_45|], 9=[|v_#memory_$Pointer$.base_40|, |v_#memory_$Pointer$.offset_40|]} [2019-10-13 18:08:57,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-10-13 18:08:57,606 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:57,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:57,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:08:57,655 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:57,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:57,728 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:57,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, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 137 [2019-10-13 18:08:57,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:57,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:57,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:57,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:57,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:57,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:57,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:57,736 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:57,890 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 43 [2019-10-13 18:08:57,890 INFO L567 ElimStorePlain]: treesize reduction 1588, result has 6.6 percent of original size [2019-10-13 18:08:57,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 70 [2019-10-13 18:08:57,897 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:57,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:57,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:57,915 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:196, output treesize:64 [2019-10-13 18:08:57,963 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_48|], 6=[|v_#memory_$Pointer$.offset_41|], 12=[|v_#memory_$Pointer$.base_41|]} [2019-10-13 18:08:57,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-10-13 18:08:57,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:57,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:58,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:58,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 29 [2019-10-13 18:08:58,007 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:58,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:58,146 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-10-13 18:08:58,147 INFO L341 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-10-13 18:08:58,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 161 [2019-10-13 18:08:58,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:58,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:58,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:58,151 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:58,202 INFO L567 ElimStorePlain]: treesize reduction 100, result has 50.5 percent of original size [2019-10-13 18:08:58,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:58,203 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:200, output treesize:102 [2019-10-13 18:08:58,332 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-10-13 18:08:58,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-10-13 18:08:58,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:58,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:58,379 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:58,380 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 87 treesize of output 77 [2019-10-13 18:08:58,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:58,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:58,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:58,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:58,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:58,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:58,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:58,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:58,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:58,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:58,387 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:58,415 INFO L567 ElimStorePlain]: treesize reduction 36, result has 47.1 percent of original size [2019-10-13 18:08:58,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:58,416 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:116, output treesize:24 [2019-10-13 18:08:58,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-10-13 18:08:58,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:58,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:58,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:58,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-10-13 18:08:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:58,470 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:58,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2019-10-13 18:08:58,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496252834] [2019-10-13 18:08:58,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 18:08:58,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:58,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 18:08:58,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-10-13 18:08:58,471 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 21 states. [2019-10-13 18:08:59,536 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-13 18:08:59,745 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-10-13 18:09:00,251 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-10-13 18:09:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:02,440 INFO L93 Difference]: Finished difference Result 299 states and 366 transitions. [2019-10-13 18:09:02,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-13 18:09:02,441 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-10-13 18:09:02,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:02,444 INFO L225 Difference]: With dead ends: 299 [2019-10-13 18:09:02,444 INFO L226 Difference]: Without dead ends: 297 [2019-10-13 18:09:02,445 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=338, Invalid=2314, Unknown=0, NotChecked=0, Total=2652 [2019-10-13 18:09:02,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-10-13 18:09:02,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 121. [2019-10-13 18:09:02,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-13 18:09:02,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 153 transitions. [2019-10-13 18:09:02,459 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 153 transitions. Word has length 29 [2019-10-13 18:09:02,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:02,459 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 153 transitions. [2019-10-13 18:09:02,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 18:09:02,460 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2019-10-13 18:09:02,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 18:09:02,461 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:02,461 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:02,673 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:02,674 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:02,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:02,675 INFO L82 PathProgramCache]: Analyzing trace with hash 921966592, now seen corresponding path program 1 times [2019-10-13 18:09:02,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:02,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229417761] [2019-10-13 18:09:02,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:02,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:02,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:03,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229417761] [2019-10-13 18:09:03,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120899830] [2019-10-13 18:09:03,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:03,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-13 18:09:03,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:03,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:09:03,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:03,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:03,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 18:09:03,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:03,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:03,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:03,204 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-13 18:09:03,236 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:03,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 18:09:03,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:03,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:03,253 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:03,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:03,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:03,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 20 [2019-10-13 18:09:03,268 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:03,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:03,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:03,276 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:53, output treesize:17 [2019-10-13 18:09:03,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-13 18:09:03,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:03,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:03,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:03,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2019-10-13 18:09:03,408 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_42|], 10=[|v_#memory_int_54|]} [2019-10-13 18:09:03,412 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:09:03,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-10-13 18:09:03,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-13 18:09:03,484 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.1 percent of original size [2019-10-13 18:09:03,488 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:09:03,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-10-13 18:09:03,494 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-13 18:09:03,551 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2019-10-13 18:09:03,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:03,560 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:09:03,644 INFO L341 Elim1Store]: treesize reduction 33, result has 70.8 percent of original size [2019-10-13 18:09:03,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 95 [2019-10-13 18:09:03,646 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:03,743 INFO L567 ElimStorePlain]: treesize reduction 47, result has 61.2 percent of original size [2019-10-13 18:09:03,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:03,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:03,745 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:85, output treesize:74 [2019-10-13 18:09:03,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:03,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:03,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:03,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:03,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:03,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:03,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:03,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:03,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:03,826 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_51|], 10=[|v_#memory_int_55|]} [2019-10-13 18:09:03,831 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:03,836 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:03,961 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-10-13 18:09:03,961 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.5 percent of original size [2019-10-13 18:09:03,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:03,982 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:09:04,029 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:04,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 121 [2019-10-13 18:09:04,031 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:04,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:04,041 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:09:04,056 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:04,057 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 2 case distinctions, treesize of input 51 treesize of output 61 [2019-10-13 18:09:04,057 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:04,145 INFO L567 ElimStorePlain]: treesize reduction 88, result has 47.0 percent of original size [2019-10-13 18:09:04,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:04,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-10-13 18:09:04,148 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:122, output treesize:64 [2019-10-13 18:09:04,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:04,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:04,278 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:04,278 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-10-13 18:09:04,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:04,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:04,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:04,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-10-13 18:09:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:04,289 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:04,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2019-10-13 18:09:04,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403221347] [2019-10-13 18:09:04,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 18:09:04,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:04,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 18:09:04,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-10-13 18:09:04,290 INFO L87 Difference]: Start difference. First operand 121 states and 153 transitions. Second operand 19 states. [2019-10-13 18:09:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:05,513 INFO L93 Difference]: Finished difference Result 228 states and 277 transitions. [2019-10-13 18:09:05,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 18:09:05,513 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-10-13 18:09:05,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:05,516 INFO L225 Difference]: With dead ends: 228 [2019-10-13 18:09:05,516 INFO L226 Difference]: Without dead ends: 213 [2019-10-13 18:09:05,517 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2019-10-13 18:09:05,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-13 18:09:05,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 143. [2019-10-13 18:09:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-13 18:09:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 181 transitions. [2019-10-13 18:09:05,530 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 181 transitions. Word has length 31 [2019-10-13 18:09:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:05,531 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 181 transitions. [2019-10-13 18:09:05,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 18:09:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2019-10-13 18:09:05,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 18:09:05,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:05,532 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:05,735 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:05,736 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:05,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:05,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1731313218, now seen corresponding path program 1 times [2019-10-13 18:09:05,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:05,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177768011] [2019-10-13 18:09:05,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:05,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:05,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:05,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177768011] [2019-10-13 18:09:05,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972722055] [2019-10-13 18:09:05,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:06,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-13 18:09:06,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:06,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:09:06,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:06,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:06,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:06,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-13 18:09:06,161 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:06,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 18:09:06,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:06,191 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-10-13 18:09:06,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:09:06,195 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:06,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:06,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:06,208 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-10-13 18:09:06,279 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-10-13 18:09:06,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 83 [2019-10-13 18:09:06,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:06,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:06,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:06,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:06,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-13 18:09:06,317 INFO L567 ElimStorePlain]: treesize reduction 98, result has 30.5 percent of original size [2019-10-13 18:09:06,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:06,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:42 [2019-10-13 18:09:06,392 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:06,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-13 18:09:06,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:06,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:06,410 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_$Pointer$.base_43|], 6=[|v_#memory_$Pointer$.base_46|]} [2019-10-13 18:09:06,412 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:06,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:06,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:06,437 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:06,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2019-10-13 18:09:06,438 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:06,454 INFO L567 ElimStorePlain]: treesize reduction 12, result has 58.6 percent of original size [2019-10-13 18:09:06,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:06,455 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:81, output treesize:4 [2019-10-13 18:09:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:06,462 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:06,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2019-10-13 18:09:06,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92138992] [2019-10-13 18:09:06,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 18:09:06,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:06,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 18:09:06,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-13 18:09:06,464 INFO L87 Difference]: Start difference. First operand 143 states and 181 transitions. Second operand 12 states. [2019-10-13 18:09:07,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:07,611 INFO L93 Difference]: Finished difference Result 305 states and 369 transitions. [2019-10-13 18:09:07,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 18:09:07,611 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-10-13 18:09:07,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:07,613 INFO L225 Difference]: With dead ends: 305 [2019-10-13 18:09:07,613 INFO L226 Difference]: Without dead ends: 280 [2019-10-13 18:09:07,614 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2019-10-13 18:09:07,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-10-13 18:09:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 152. [2019-10-13 18:09:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-13 18:09:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 191 transitions. [2019-10-13 18:09:07,630 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 191 transitions. Word has length 31 [2019-10-13 18:09:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:07,630 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 191 transitions. [2019-10-13 18:09:07,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 18:09:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 191 transitions. [2019-10-13 18:09:07,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 18:09:07,631 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:07,631 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:07,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:07,838 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:07,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:07,839 INFO L82 PathProgramCache]: Analyzing trace with hash -840660915, now seen corresponding path program 1 times [2019-10-13 18:09:07,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:07,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610889641] [2019-10-13 18:09:07,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:07,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:07,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:07,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610889641] [2019-10-13 18:09:07,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544726617] [2019-10-13 18:09:07,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:08,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-13 18:09:08,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:08,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:09:08,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:08,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:08,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:08,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-13 18:09:08,139 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:08,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 18:09:08,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:08,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:08,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:09:08,162 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:08,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:08,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:09:08,177 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:08,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:08,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:08,189 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-10-13 18:09:08,245 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:08,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 98 [2019-10-13 18:09:08,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:08,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:08,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:08,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-13 18:09:08,290 INFO L567 ElimStorePlain]: treesize reduction 220, result has 23.1 percent of original size [2019-10-13 18:09:08,304 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 65 treesize of output 44 [2019-10-13 18:09:08,305 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:08,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:08,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:08,313 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:38 [2019-10-13 18:09:08,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:08,399 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:08,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-10-13 18:09:08,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215314042] [2019-10-13 18:09:08,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 18:09:08,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:08,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 18:09:08,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-10-13 18:09:08,401 INFO L87 Difference]: Start difference. First operand 152 states and 191 transitions. Second operand 14 states. [2019-10-13 18:09:09,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:09,286 INFO L93 Difference]: Finished difference Result 202 states and 250 transitions. [2019-10-13 18:09:09,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 18:09:09,290 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-10-13 18:09:09,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:09,292 INFO L225 Difference]: With dead ends: 202 [2019-10-13 18:09:09,292 INFO L226 Difference]: Without dead ends: 166 [2019-10-13 18:09:09,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-10-13 18:09:09,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-13 18:09:09,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 155. [2019-10-13 18:09:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-13 18:09:09,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 194 transitions. [2019-10-13 18:09:09,307 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 194 transitions. Word has length 31 [2019-10-13 18:09:09,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:09,307 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 194 transitions. [2019-10-13 18:09:09,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 18:09:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 194 transitions. [2019-10-13 18:09:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 18:09:09,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:09,308 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:09,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:09,512 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:09,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:09,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1484298053, now seen corresponding path program 1 times [2019-10-13 18:09:09,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:09,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134557773] [2019-10-13 18:09:09,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:09,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:09,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 18:09:09,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134557773] [2019-10-13 18:09:09,560 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:09,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 18:09:09,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352927457] [2019-10-13 18:09:09,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 18:09:09,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:09,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 18:09:09,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 18:09:09,561 INFO L87 Difference]: Start difference. First operand 155 states and 194 transitions. Second operand 6 states. [2019-10-13 18:09:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:09,731 INFO L93 Difference]: Finished difference Result 173 states and 215 transitions. [2019-10-13 18:09:09,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 18:09:09,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-10-13 18:09:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:09,733 INFO L225 Difference]: With dead ends: 173 [2019-10-13 18:09:09,733 INFO L226 Difference]: Without dead ends: 171 [2019-10-13 18:09:09,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 18:09:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-13 18:09:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 163. [2019-10-13 18:09:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-13 18:09:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 204 transitions. [2019-10-13 18:09:09,749 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 204 transitions. Word has length 32 [2019-10-13 18:09:09,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:09,749 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 204 transitions. [2019-10-13 18:09:09,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 18:09:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 204 transitions. [2019-10-13 18:09:09,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 18:09:09,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:09,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:09,750 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:09,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:09,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1427039751, now seen corresponding path program 1 times [2019-10-13 18:09:09,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:09,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267659569] [2019-10-13 18:09:09,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:09,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:09,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 18:09:09,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267659569] [2019-10-13 18:09:09,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:09,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 18:09:09,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546319744] [2019-10-13 18:09:09,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 18:09:09,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:09,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 18:09:09,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 18:09:09,843 INFO L87 Difference]: Start difference. First operand 163 states and 204 transitions. Second operand 8 states. [2019-10-13 18:09:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:10,119 INFO L93 Difference]: Finished difference Result 222 states and 268 transitions. [2019-10-13 18:09:10,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 18:09:10,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-10-13 18:09:10,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:10,121 INFO L225 Difference]: With dead ends: 222 [2019-10-13 18:09:10,121 INFO L226 Difference]: Without dead ends: 184 [2019-10-13 18:09:10,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-10-13 18:09:10,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-13 18:09:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 161. [2019-10-13 18:09:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-13 18:09:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 199 transitions. [2019-10-13 18:09:10,137 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 199 transitions. Word has length 32 [2019-10-13 18:09:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:10,137 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 199 transitions. [2019-10-13 18:09:10,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 18:09:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2019-10-13 18:09:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 18:09:10,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:10,138 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:10,138 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:10,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:10,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1652849204, now seen corresponding path program 2 times [2019-10-13 18:09:10,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:10,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110738053] [2019-10-13 18:09:10,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:10,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:10,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:10,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110738053] [2019-10-13 18:09:10,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008570328] [2019-10-13 18:09:10,661 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:10,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 18:09:10,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 18:09:10,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-13 18:09:10,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:10,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:09:10,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:10,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:10,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:10,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-13 18:09:10,835 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:10,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 18:09:10,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:10,881 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-10-13 18:09:10,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:09:10,888 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:10,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:10,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:09:10,917 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:10,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:10,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:10,932 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-10-13 18:09:10,968 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_58|], 6=[|v_#memory_$Pointer$.offset_46|, |v_#memory_$Pointer$.base_50|]} [2019-10-13 18:09:10,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 18:09:10,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:11,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:09:11,013 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:11,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:09:11,054 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,072 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:97, output treesize:55 [2019-10-13 18:09:11,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-13 18:09:11,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,375 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-10-13 18:09:11,376 INFO L567 ElimStorePlain]: treesize reduction 40, result has 85.8 percent of original size [2019-10-13 18:09:11,377 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_59|, |v_#memory_int_56|], 10=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_51|]} [2019-10-13 18:09:11,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:11,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2019-10-13 18:09:11,390 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2019-10-13 18:09:11,458 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 99 [2019-10-13 18:09:11,514 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,606 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 153 [2019-10-13 18:09:11,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:11,609 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,696 INFO L567 ElimStorePlain]: treesize reduction 96, result has 52.0 percent of original size [2019-10-13 18:09:11,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,697 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:236, output treesize:89 [2019-10-13 18:09:11,766 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_60|], 6=[|v_#memory_$Pointer$.offset_48|], 12=[|v_#memory_$Pointer$.base_52|]} [2019-10-13 18:09:11,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-10-13 18:09:11,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:11,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 42 [2019-10-13 18:09:11,841 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:11,958 INFO L341 Elim1Store]: treesize reduction 32, result has 64.4 percent of original size [2019-10-13 18:09:11,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 107 [2019-10-13 18:09:11,960 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:12,027 INFO L567 ElimStorePlain]: treesize reduction 62, result has 61.3 percent of original size [2019-10-13 18:09:12,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:12,027 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:140, output treesize:98 [2019-10-13 18:09:12,160 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:12,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2019-10-13 18:09:12,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:12,269 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-10-13 18:09:12,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:12,271 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_57|], 6=[|v_#memory_int_61|], 10=[|v_#memory_$Pointer$.offset_49|], 18=[|v_#memory_$Pointer$.base_53|]} [2019-10-13 18:09:12,276 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:12,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:12,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:12,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 64 [2019-10-13 18:09:12,382 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:12,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:12,493 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:12,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 298 treesize of output 255 [2019-10-13 18:09:12,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,498 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:12,631 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 59 [2019-10-13 18:09:12,632 INFO L567 ElimStorePlain]: treesize reduction 377, result has 40.3 percent of original size [2019-10-13 18:09:12,820 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-10-13 18:09:12,820 INFO L341 Elim1Store]: treesize reduction 35, result has 82.5 percent of original size [2019-10-13 18:09:12,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 239 treesize of output 237 [2019-10-13 18:09:12,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:12,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:12,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:12,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:12,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:12,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:12,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:12,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:12,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:12,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:12,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:12,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:12,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:12,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:12,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:12,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:12,855 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:12,987 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-10-13 18:09:12,988 INFO L567 ElimStorePlain]: treesize reduction 163, result has 41.6 percent of original size [2019-10-13 18:09:12,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:12,989 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:376, output treesize:147 [2019-10-13 18:09:13,064 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_62|, |v_#memory_$Pointer$.offset_50|], 20=[|v_#memory_$Pointer$.base_54|]} [2019-10-13 18:09:13,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 70 [2019-10-13 18:09:13,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:13,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:13,165 INFO L341 Elim1Store]: treesize reduction 50, result has 55.0 percent of original size [2019-10-13 18:09:13,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 356 treesize of output 319 [2019-10-13 18:09:13,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:13,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,169 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-10-13 18:09:13,288 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-10-13 18:09:13,289 INFO L567 ElimStorePlain]: treesize reduction 614, result has 32.9 percent of original size [2019-10-13 18:09:13,507 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2019-10-13 18:09:13,508 INFO L341 Elim1Store]: treesize reduction 66, result has 74.3 percent of original size [2019-10-13 18:09:13,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 297 treesize of output 280 [2019-10-13 18:09:13,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:13,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:13,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:13,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:13,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:13,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:13,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:13,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:13,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:13,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:13,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:09:13,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,590 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 15 xjuncts. [2019-10-13 18:09:13,869 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2019-10-13 18:09:13,869 INFO L567 ElimStorePlain]: treesize reduction 9658, result has 2.4 percent of original size [2019-10-13 18:09:13,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:13,871 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:387, output treesize:233 [2019-10-13 18:09:14,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,022 INFO L392 ElimStorePlain]: Different costs {12=[|#memory_int|], 20=[|#memory_$Pointer$.base|]} [2019-10-13 18:09:14,029 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:09:14,030 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:09:14,035 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:09:14,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 180 [2019-10-13 18:09:14,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:14,046 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:09:14,047 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:09:14,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 1 [2019-10-13 18:09:14,049 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:14,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:14,125 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:14,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 167 treesize of output 128 [2019-10-13 18:09:14,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:14,152 INFO L496 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:14,223 INFO L567 ElimStorePlain]: treesize reduction 84, result has 30.0 percent of original size [2019-10-13 18:09:14,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:14,225 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:505, output treesize:16 [2019-10-13 18:09:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:14,288 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:14,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2019-10-13 18:09:14,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084828144] [2019-10-13 18:09:14,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 18:09:14,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:14,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 18:09:14,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=394, Unknown=1, NotChecked=0, Total=462 [2019-10-13 18:09:14,290 INFO L87 Difference]: Start difference. First operand 161 states and 199 transitions. Second operand 22 states. [2019-10-13 18:09:15,611 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-10-13 18:09:16,809 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2019-10-13 18:09:17,037 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-13 18:09:17,334 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 112 [2019-10-13 18:09:17,500 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-13 18:09:17,832 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 111 [2019-10-13 18:09:18,100 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 104 [2019-10-13 18:09:18,683 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 106 [2019-10-13 18:09:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:19,486 INFO L93 Difference]: Finished difference Result 350 states and 421 transitions. [2019-10-13 18:09:19,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-13 18:09:19,487 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2019-10-13 18:09:19,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:19,490 INFO L225 Difference]: With dead ends: 350 [2019-10-13 18:09:19,490 INFO L226 Difference]: Without dead ends: 302 [2019-10-13 18:09:19,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=436, Invalid=2319, Unknown=1, NotChecked=0, Total=2756 [2019-10-13 18:09:19,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-13 18:09:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 187. [2019-10-13 18:09:19,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-13 18:09:19,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 237 transitions. [2019-10-13 18:09:19,510 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 237 transitions. Word has length 33 [2019-10-13 18:09:19,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:19,510 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 237 transitions. [2019-10-13 18:09:19,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 18:09:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 237 transitions. [2019-10-13 18:09:19,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 18:09:19,511 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:19,511 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:19,715 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:19,716 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:19,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:19,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1263003227, now seen corresponding path program 1 times [2019-10-13 18:09:19,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:19,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388517499] [2019-10-13 18:09:19,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:19,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:19,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:20,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388517499] [2019-10-13 18:09:20,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908016475] [2019-10-13 18:09:20,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:20,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-13 18:09:20,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:20,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:09:20,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:20,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:20,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:20,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-13 18:09:20,289 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:20,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 18:09:20,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:20,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:20,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 18:09:20,310 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:20,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:20,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:20,323 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:25 [2019-10-13 18:09:20,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:20,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-13 18:09:20,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:20,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:20,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:20,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-13 18:09:20,414 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:20,415 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 3 case distinctions, treesize of input 42 treesize of output 60 [2019-10-13 18:09:20,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:20,459 INFO L567 ElimStorePlain]: treesize reduction 32, result has 50.0 percent of original size [2019-10-13 18:09:20,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:20,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:32 [2019-10-13 18:09:20,526 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:20,526 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 2 case distinctions, treesize of input 37 treesize of output 47 [2019-10-13 18:09:20,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:20,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:20,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:20,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2019-10-13 18:09:20,785 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 1=[|#memory_$Pointer$.offset|]} [2019-10-13 18:09:20,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 [2019-10-13 18:09:20,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:20,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:20,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-10-13 18:09:20,803 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:20,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:20,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:20,809 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:11 [2019-10-13 18:09:20,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-13 18:09:20,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:20,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:20,845 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-13 18:09:20,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-13 18:09:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:20,880 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:20,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2019-10-13 18:09:20,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951168074] [2019-10-13 18:09:20,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 18:09:20,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:20,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 18:09:20,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-10-13 18:09:20,882 INFO L87 Difference]: Start difference. First operand 187 states and 237 transitions. Second operand 21 states. [2019-10-13 18:09:21,480 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-10-13 18:09:21,681 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-13 18:09:21,904 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53