java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-circular-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:01:28,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:01:28,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:01:28,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:01:28,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:01:28,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:01:28,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:01:28,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:01:28,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:01:28,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:01:28,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:01:28,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:01:28,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:01:28,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:01:28,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:01:28,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:01:28,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:01:28,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:01:28,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:01:28,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:01:28,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:01:28,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:01:28,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:01:28,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:01:28,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:01:28,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:01:28,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:01:28,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:01:28,247 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:01:28,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:01:28,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:01:28,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:01:28,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:01:28,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:01:28,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:01:28,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:01:28,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:01:28,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:01:28,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:01:28,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:01:28,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:01:28,260 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-09-20 13:01:28,282 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:01:28,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:01:28,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:01:28,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:01:28,286 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:01:28,286 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:01:28,286 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:01:28,287 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:01:28,287 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:01:28,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:01:28,288 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:01:28,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:01:28,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:01:28,289 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:01:28,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:01:28,289 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:01:28,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:01:28,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:01:28,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:01:28,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:01:28,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:01:28,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:01:28,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:01:28,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:01:28,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:01:28,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:01:28,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:01:28,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:01:28,293 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:01:28,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:01:28,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:01:28,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:01:28,349 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:01:28,349 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:01:28,350 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-circular-1.i [2019-09-20 13:01:28,414 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77a0d91e/8de9eb57240b411fa86e4359d73bebae/FLAG4fc8e104d [2019-09-20 13:01:28,961 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:01:28,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-circular-1.i [2019-09-20 13:01:28,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77a0d91e/8de9eb57240b411fa86e4359d73bebae/FLAG4fc8e104d [2019-09-20 13:01:29,256 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77a0d91e/8de9eb57240b411fa86e4359d73bebae [2019-09-20 13:01:29,266 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:01:29,267 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:01:29,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:01:29,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:01:29,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:01:29,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:01:29" (1/1) ... [2019-09-20 13:01:29,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e18d1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:29, skipping insertion in model container [2019-09-20 13:01:29,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:01:29" (1/1) ... [2019-09-20 13:01:29,281 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:01:29,339 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:01:29,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:01:29,797 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:01:29,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:01:29,908 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:01:29,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:29 WrapperNode [2019-09-20 13:01:29,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:01:29,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:01:29,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:01:29,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:01:29,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:29" (1/1) ... [2019-09-20 13:01:29,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:29" (1/1) ... [2019-09-20 13:01:29,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:29" (1/1) ... [2019-09-20 13:01:29,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:29" (1/1) ... [2019-09-20 13:01:29,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:29" (1/1) ... [2019-09-20 13:01:29,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:29" (1/1) ... [2019-09-20 13:01:29,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:29" (1/1) ... [2019-09-20 13:01:29,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:01:29,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:01:29,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:01:29,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:01:29,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:29" (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-09-20 13:01:30,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:01:30,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:01:30,033 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:01:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-20 13:01:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-20 13:01:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-20 13:01:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-20 13:01:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-20 13:01:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-20 13:01:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-20 13:01:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-20 13:01:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-20 13:01:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-20 13:01:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-20 13:01:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-20 13:01:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-20 13:01:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-20 13:01:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-20 13:01:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-20 13:01:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-20 13:01:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-20 13:01:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-20 13:01:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-20 13:01:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-20 13:01:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-20 13:01:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-20 13:01:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-20 13:01:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-20 13:01:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-20 13:01:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-20 13:01:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-20 13:01:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-20 13:01:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-20 13:01:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-20 13:01:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-20 13:01:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-20 13:01:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-20 13:01:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-20 13:01:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-20 13:01:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-20 13:01:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-20 13:01:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-20 13:01:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-20 13:01:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-20 13:01:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-20 13:01:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-20 13:01:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-20 13:01:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-20 13:01:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-20 13:01:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-20 13:01:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-20 13:01:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-20 13:01:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-20 13:01:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:01:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:01:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-20 13:01:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:01:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-20 13:01:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-20 13:01:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-20 13:01:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-20 13:01:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-20 13:01:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-20 13:01:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-20 13:01:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-20 13:01:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-20 13:01:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-20 13:01:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-20 13:01:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-20 13:01:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-20 13:01:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-20 13:01:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-20 13:01:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-20 13:01:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-20 13:01:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-20 13:01:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-20 13:01:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-20 13:01:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-20 13:01:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-20 13:01:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-20 13:01:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-20 13:01:30,045 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-20 13:01:30,045 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-20 13:01:30,045 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-20 13:01:30,045 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-20 13:01:30,045 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-20 13:01:30,045 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-20 13:01:30,045 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-20 13:01:30,046 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-20 13:01:30,046 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-20 13:01:30,046 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-20 13:01:30,046 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-20 13:01:30,046 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-20 13:01:30,046 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-20 13:01:30,047 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-20 13:01:30,047 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-20 13:01:30,047 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-20 13:01:30,047 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-20 13:01:30,047 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-20 13:01:30,047 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-20 13:01:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-20 13:01:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-20 13:01:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-20 13:01:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-20 13:01:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-20 13:01:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-20 13:01:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:01:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:01:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:01:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:01:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:01:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:01:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:01:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:01:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:01:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:01:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:01:30,586 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:01:30,587 INFO L283 CfgBuilder]: Removed 9 assume(true) statements. [2019-09-20 13:01:30,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:01:30 BoogieIcfgContainer [2019-09-20 13:01:30,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:01:30,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:01:30,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:01:30,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:01:30,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:01:29" (1/3) ... [2019-09-20 13:01:30,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d482cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:01:30, skipping insertion in model container [2019-09-20 13:01:30,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:29" (2/3) ... [2019-09-20 13:01:30,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d482cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:01:30, skipping insertion in model container [2019-09-20 13:01:30,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:01:30" (3/3) ... [2019-09-20 13:01:30,597 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2019-09-20 13:01:30,607 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:01:30,618 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-09-20 13:01:30,632 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-09-20 13:01:30,658 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:01:30,659 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:01:30,659 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:01:30,659 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:01:30,659 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:01:30,659 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:01:30,659 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:01:30,660 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:01:30,660 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:01:30,679 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-09-20 13:01:30,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-20 13:01:30,686 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:30,687 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:30,689 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:30,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:30,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1483997276, now seen corresponding path program 1 times [2019-09-20 13:01:30,697 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:30,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:30,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:30,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:30,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:30,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:30,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 13:01:30,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:01:30,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:01:30,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:01:30,874 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2019-09-20 13:01:30,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:30,908 INFO L93 Difference]: Finished difference Result 70 states and 106 transitions. [2019-09-20 13:01:30,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:01:30,909 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-20 13:01:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:30,918 INFO L225 Difference]: With dead ends: 70 [2019-09-20 13:01:30,919 INFO L226 Difference]: Without dead ends: 30 [2019-09-20 13:01:30,922 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:01:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-20 13:01:30,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-20 13:01:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-20 13:01:30,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-09-20 13:01:30,956 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2019-09-20 13:01:30,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:30,957 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-09-20 13:01:30,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:01:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-09-20 13:01:30,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-20 13:01:30,958 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:30,958 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:30,959 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:30,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:30,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1199756337, now seen corresponding path program 1 times [2019-09-20 13:01:30,959 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:30,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:30,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:30,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:30,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:31,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:31,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:01:31,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:01:31,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:01:31,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:01:31,145 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 4 states. [2019-09-20 13:01:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:31,267 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-09-20 13:01:31,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:01:31,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-09-20 13:01:31,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:31,270 INFO L225 Difference]: With dead ends: 46 [2019-09-20 13:01:31,271 INFO L226 Difference]: Without dead ends: 42 [2019-09-20 13:01:31,273 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:01:31,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-20 13:01:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-09-20 13:01:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-20 13:01:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-09-20 13:01:31,285 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2019-09-20 13:01:31,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:31,285 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-09-20 13:01:31,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:01:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-09-20 13:01:31,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 13:01:31,288 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:31,288 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:31,289 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:31,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:31,289 INFO L82 PathProgramCache]: Analyzing trace with hash -97127833, now seen corresponding path program 1 times [2019-09-20 13:01:31,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:31,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:31,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:31,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:31,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:31,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:31,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:01:31,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:01:31,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:01:31,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:01:31,411 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 3 states. [2019-09-20 13:01:31,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:31,438 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-09-20 13:01:31,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:01:31,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-20 13:01:31,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:31,441 INFO L225 Difference]: With dead ends: 75 [2019-09-20 13:01:31,441 INFO L226 Difference]: Without dead ends: 53 [2019-09-20 13:01:31,442 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:01:31,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-20 13:01:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2019-09-20 13:01:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-20 13:01:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-09-20 13:01:31,450 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 14 [2019-09-20 13:01:31,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:31,451 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-09-20 13:01:31,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:01:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-09-20 13:01:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:01:31,452 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:31,452 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:31,452 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:31,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:31,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2075944349, now seen corresponding path program 1 times [2019-09-20 13:01:31,453 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:31,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:31,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:31,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:31,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:31,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:31,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:01:31,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:01:31,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:01:31,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:01:31,490 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 3 states. [2019-09-20 13:01:31,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:31,506 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-09-20 13:01:31,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:01:31,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:01:31,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:31,508 INFO L225 Difference]: With dead ends: 42 [2019-09-20 13:01:31,508 INFO L226 Difference]: Without dead ends: 40 [2019-09-20 13:01:31,509 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:01:31,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-20 13:01:31,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-20 13:01:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-20 13:01:31,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-09-20 13:01:31,516 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2019-09-20 13:01:31,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:31,516 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-09-20 13:01:31,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:01:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-09-20 13:01:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:01:31,517 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:31,517 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:31,518 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:31,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:31,518 INFO L82 PathProgramCache]: Analyzing trace with hash 2075946271, now seen corresponding path program 1 times [2019-09-20 13:01:31,518 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:31,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:31,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:31,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:31,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:31,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:31,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:01:31,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:01:31,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:01:31,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:01:31,734 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 5 states. [2019-09-20 13:01:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:31,931 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-09-20 13:01:31,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:01:31,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-20 13:01:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:31,932 INFO L225 Difference]: With dead ends: 51 [2019-09-20 13:01:31,932 INFO L226 Difference]: Without dead ends: 38 [2019-09-20 13:01:31,933 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:01:31,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-20 13:01:31,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-20 13:01:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-20 13:01:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-09-20 13:01:31,939 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 17 [2019-09-20 13:01:31,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:31,940 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-09-20 13:01:31,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:01:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-09-20 13:01:31,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:01:31,941 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:31,941 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:31,941 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:31,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:31,941 INFO L82 PathProgramCache]: Analyzing trace with hash -351040154, now seen corresponding path program 1 times [2019-09-20 13:01:31,942 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:31,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:31,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:31,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:31,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:32,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:32,053 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:32,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:32,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-20 13:01:32,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:32,283 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-09-20 13:01:32,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:32,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:32,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:32,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-09-20 13:01:32,332 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:32,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-20 13:01:32,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:32,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:32,352 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-09-20 13:01:32,352 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:32,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:32,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:32,362 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-09-20 13:01:32,396 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-09-20 13:01:32,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-09-20 13:01:32,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:32,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:32,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:32,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-09-20 13:01:32,423 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[|v_#memory_$Pointer$.base_20|]} [2019-09-20 13:01:32,429 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:32,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:32,455 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:32,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2019-09-20 13:01:32,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:32,460 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:32,477 INFO L567 ElimStorePlain]: treesize reduction 23, result has 28.1 percent of original size [2019-09-20 13:01:32,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:32,478 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:4 [2019-09-20 13:01:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:32,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:32,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-20 13:01:32,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:01:32,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:01:32,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:01:32,487 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 6 states. [2019-09-20 13:01:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:32,635 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-09-20 13:01:32,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:01:32,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-09-20 13:01:32,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:32,637 INFO L225 Difference]: With dead ends: 65 [2019-09-20 13:01:32,637 INFO L226 Difference]: Without dead ends: 63 [2019-09-20 13:01:32,637 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:01:32,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-20 13:01:32,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2019-09-20 13:01:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-20 13:01:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2019-09-20 13:01:32,645 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 17 [2019-09-20 13:01:32,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:32,645 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-09-20 13:01:32,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:01:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2019-09-20 13:01:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:01:32,646 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:32,646 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:32,647 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:32,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash 2111834143, now seen corresponding path program 1 times [2019-09-20 13:01:32,648 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:32,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:32,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:32,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:32,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:32,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:32,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:01:32,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:01:32,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:01:32,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:01:32,714 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 3 states. [2019-09-20 13:01:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:32,737 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2019-09-20 13:01:32,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:01:32,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:01:32,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:32,739 INFO L225 Difference]: With dead ends: 100 [2019-09-20 13:01:32,740 INFO L226 Difference]: Without dead ends: 77 [2019-09-20 13:01:32,740 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:01:32,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-20 13:01:32,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2019-09-20 13:01:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-20 13:01:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2019-09-20 13:01:32,748 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 21 [2019-09-20 13:01:32,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:32,748 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2019-09-20 13:01:32,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:01:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2019-09-20 13:01:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:01:32,750 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:32,750 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:32,750 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:32,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:32,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2016892268, now seen corresponding path program 1 times [2019-09-20 13:01:32,751 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:32,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:32,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:32,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:32,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:33,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:33,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:33,057 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:33,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:33,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-20 13:01:33,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:33,185 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-09-20 13:01:33,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09-20 13:01:33,204 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,216 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2019-09-20 13:01:33,269 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,270 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-09-20 13:01:33,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,315 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_21|], 2=[|v_#memory_int_20|, |v_#memory_int_21|]} [2019-09-20 13:01:33,325 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-09-20 13:01:33,326 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,363 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-09-20 13:01:33,363 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,394 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:33,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:33,433 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-09-20 13:01:33,434 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,452 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:107, output treesize:45 [2019-09-20 13:01:33,484 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_22|], 6=[|v_#memory_$Pointer$.offset_19|, |v_#memory_$Pointer$.base_22|]} [2019-09-20 13:01:33,490 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-09-20 13:01:33,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:33,526 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-09-20 13:01:33,527 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:33,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-09-20 13:01:33,556 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,578 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:96, output treesize:54 [2019-09-20 13:01:33,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:33,657 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 179 [2019-09-20 13:01:33,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:33,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,718 INFO L567 ElimStorePlain]: treesize reduction 76, result has 65.9 percent of original size [2019-09-20 13:01:33,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2019-09-20 13:01:33,725 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 95 [2019-09-20 13:01:33,766 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,789 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-09-20 13:01:33,789 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:186, output treesize:61 [2019-09-20 13:01:33,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:33,873 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:33,874 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:33,875 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:33,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 56 [2019-09-20 13:01:33,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,883 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:33,883 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:33,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 1 [2019-09-20 13:01:33,884 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,902 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-09-20 13:01:33,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:161, output treesize:53 [2019-09-20 13:01:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-20 13:01:33,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:33,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-20 13:01:33,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:01:33,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:01:33,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:01:33,945 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 12 states. [2019-09-20 13:01:34,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:34,383 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-09-20 13:01:34,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:01:34,384 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-09-20 13:01:34,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:34,385 INFO L225 Difference]: With dead ends: 86 [2019-09-20 13:01:34,385 INFO L226 Difference]: Without dead ends: 76 [2019-09-20 13:01:34,385 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:01:34,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-20 13:01:34,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-09-20 13:01:34,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-20 13:01:34,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2019-09-20 13:01:34,392 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 23 [2019-09-20 13:01:34,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:34,393 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2019-09-20 13:01:34,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:01:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2019-09-20 13:01:34,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:01:34,394 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:34,394 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:34,394 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:34,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:34,395 INFO L82 PathProgramCache]: Analyzing trace with hash -148911397, now seen corresponding path program 2 times [2019-09-20 13:01:34,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:34,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:34,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:34,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:34,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:34,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:34,479 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:34,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:01:34,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:01:34,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:01:34,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-20 13:01:34,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:34,589 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-09-20 13:01:34,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:34,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:34,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:34,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:01:34,634 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:34,635 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-09-20 13:01:34,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:34,672 INFO L567 ElimStorePlain]: treesize reduction 14, result has 77.8 percent of original size [2019-09-20 13:01:34,679 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-09-20 13:01:34,679 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:34,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:34,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:34,692 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:36 [2019-09-20 13:01:34,724 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-09-20 13:01:34,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-09-20 13:01:34,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:34,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:34,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:34,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2019-09-20 13:01:34,766 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:34,767 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-09-20 13:01:34,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:34,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:34,853 INFO L341 Elim1Store]: treesize reduction 16, result has 78.7 percent of original size [2019-09-20 13:01:34,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 84 [2019-09-20 13:01:34,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:34,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,886 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:34,929 INFO L567 ElimStorePlain]: treesize reduction 124, result has 29.1 percent of original size [2019-09-20 13:01:34,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:34,931 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:50 [2019-09-20 13:01:35,004 INFO L341 Elim1Store]: treesize reduction 62, result has 37.4 percent of original size [2019-09-20 13:01:35,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 65 [2019-09-20 13:01:35,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:35,037 INFO L567 ElimStorePlain]: treesize reduction 34, result has 59.5 percent of original size [2019-09-20 13:01:35,038 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-09-20 13:01:35,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:50 [2019-09-20 13:01:35,048 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 12=[|v_#memory_$Pointer$.base_28|]} [2019-09-20 13:01:35,051 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:35,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:35,088 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:35,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 90 [2019-09-20 13:01:35,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,098 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:35,125 INFO L567 ElimStorePlain]: treesize reduction 35, result has 32.7 percent of original size [2019-09-20 13:01:35,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:35,126 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:94, output treesize:4 [2019-09-20 13:01:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:35,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:35,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-09-20 13:01:35,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:01:35,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:01:35,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:01:35,138 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 8 states. [2019-09-20 13:01:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:35,380 INFO L93 Difference]: Finished difference Result 136 states and 164 transitions. [2019-09-20 13:01:35,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:01:35,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-09-20 13:01:35,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:35,382 INFO L225 Difference]: With dead ends: 136 [2019-09-20 13:01:35,383 INFO L226 Difference]: Without dead ends: 134 [2019-09-20 13:01:35,383 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:01:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-20 13:01:35,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 110. [2019-09-20 13:01:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-20 13:01:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2019-09-20 13:01:35,395 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 23 [2019-09-20 13:01:35,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:35,395 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2019-09-20 13:01:35,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:01:35,395 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2019-09-20 13:01:35,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:01:35,397 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:35,397 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:35,397 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:35,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:35,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1680620617, now seen corresponding path program 2 times [2019-09-20 13:01:35,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:35,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:35,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:35,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:01:35,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:35,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:35,804 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:35,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:01:35,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:01:35,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:01:35,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-20 13:01:35,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:35,921 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-09-20 13:01:35,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:35,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:35,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:35,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:01:35,974 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:35,975 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-09-20 13:01:35,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,032 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-09-20 13:01:36,039 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-09-20 13:01:36,040 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,064 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-09-20 13:01:36,065 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,087 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-09-20 13:01:36,133 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_25|], 6=[|v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.base_30|]} [2019-09-20 13:01:36,144 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-09-20 13:01:36,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:36,193 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-09-20 13:01:36,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:36,228 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-09-20 13:01:36,229 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,256 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:100, output treesize:58 [2019-09-20 13:01:36,354 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,355 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-09-20 13:01:36,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,416 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_26|, |v_#memory_int_24|], 10=[|v_#memory_$Pointer$.offset_23|, |v_#memory_$Pointer$.base_31|]} [2019-09-20 13:01:36,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:36,435 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-09-20 13:01:36,436 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,489 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-09-20 13:01:36,490 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 102 [2019-09-20 13:01:36,548 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,637 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 124 [2019-09-20 13:01:36,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:36,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,644 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,736 INFO L567 ElimStorePlain]: treesize reduction 384, result has 18.1 percent of original size [2019-09-20 13:01:36,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,737 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:237, output treesize:84 [2019-09-20 13:01:36,784 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_27|], 12=[|v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.base_32|]} [2019-09-20 13:01:36,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-09-20 13:01:36,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:36,846 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 78 [2019-09-20 13:01:36,848 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,904 INFO L567 ElimStorePlain]: treesize reduction 36, result has 75.7 percent of original size [2019-09-20 13:01:36,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:36,956 INFO L341 Elim1Store]: treesize reduction 32, result has 61.0 percent of original size [2019-09-20 13:01:36,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 101 [2019-09-20 13:01:36,958 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:37,012 INFO L567 ElimStorePlain]: treesize reduction 58, result has 61.6 percent of original size [2019-09-20 13:01:37,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:37,013 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:135, output treesize:93 [2019-09-20 13:01:37,078 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_28|], 12=[|v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.base_33|]} [2019-09-20 13:01:37,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 54 [2019-09-20 13:01:37,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:37,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:37,204 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:37,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 311 treesize of output 350 [2019-09-20 13:01:37,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:37,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:37,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:37,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,235 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:37,467 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 46 [2019-09-20 13:01:37,468 INFO L567 ElimStorePlain]: treesize reduction 2686, result has 6.6 percent of original size [2019-09-20 13:01:37,548 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:37,549 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 233 [2019-09-20 13:01:37,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:37,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:37,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:37,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:37,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,587 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:37,706 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 37 [2019-09-20 13:01:37,707 INFO L567 ElimStorePlain]: treesize reduction 1945, result has 6.3 percent of original size [2019-09-20 13:01:37,708 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-09-20 13:01:37,708 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:388, output treesize:129 [2019-09-20 13:01:37,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:01:37,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:37,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2019-09-20 13:01:37,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 13:01:37,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 13:01:37,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:01:37,790 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand 14 states. [2019-09-20 13:01:38,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:38,914 INFO L93 Difference]: Finished difference Result 172 states and 203 transitions. [2019-09-20 13:01:38,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-20 13:01:38,915 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-09-20 13:01:38,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:38,917 INFO L225 Difference]: With dead ends: 172 [2019-09-20 13:01:38,917 INFO L226 Difference]: Without dead ends: 170 [2019-09-20 13:01:38,918 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-09-20 13:01:38,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-20 13:01:38,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 122. [2019-09-20 13:01:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-20 13:01:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2019-09-20 13:01:38,929 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 29 [2019-09-20 13:01:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:38,929 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2019-09-20 13:01:38,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 13:01:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2019-09-20 13:01:38,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:01:38,931 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:38,931 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:38,931 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:38,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:38,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1307682849, now seen corresponding path program 1 times [2019-09-20 13:01:38,932 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:38,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:38,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:38,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:01:38,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:39,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:39,091 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:39,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:39,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-20 13:01:39,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:39,204 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-09-20 13:01:39,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:01:39,242 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,242 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-09-20 13:01:39,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,276 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-09-20 13:01:39,276 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,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-09-20 13:01:39,310 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,326 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:71, output treesize:39 [2019-09-20 13:01:39,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:39,361 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-09-20 13:01:39,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:39,383 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-09-20 13:01:39,384 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,398 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2019-09-20 13:01:39,405 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_29|], 4=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_28|]} [2019-09-20 13:01:39,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-09-20 13:01:39,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,475 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 105 [2019-09-20 13:01:39,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:39,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:39,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:39,478 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-09-20 13:01:39,539 INFO L567 ElimStorePlain]: treesize reduction 242, result has 27.3 percent of original size [2019-09-20 13:01:39,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 55 [2019-09-20 13:01:39,555 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,569 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-09-20 13:01:39,570 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:125, output treesize:63 [2019-09-20 13:01:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:39,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:39,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-09-20 13:01:39,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-20 13:01:39,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-20 13:01:39,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:01:39,854 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand 16 states. [2019-09-20 13:01:40,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:40,562 INFO L93 Difference]: Finished difference Result 150 states and 178 transitions. [2019-09-20 13:01:40,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 13:01:40,563 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-09-20 13:01:40,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:40,564 INFO L225 Difference]: With dead ends: 150 [2019-09-20 13:01:40,564 INFO L226 Difference]: Without dead ends: 116 [2019-09-20 13:01:40,565 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-09-20 13:01:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-20 13:01:40,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-20 13:01:40,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-20 13:01:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-09-20 13:01:40,574 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 30 [2019-09-20 13:01:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:40,574 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-09-20 13:01:40,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-20 13:01:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-09-20 13:01:40,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:01:40,576 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:40,576 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:40,576 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:40,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:40,576 INFO L82 PathProgramCache]: Analyzing trace with hash 432046418, now seen corresponding path program 1 times [2019-09-20 13:01:40,577 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:40,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:40,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:40,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:40,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:40,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:40,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:40,998 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:41,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:41,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-20 13:01:41,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:41,119 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-09-20 13:01:41,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-09-20 13:01:41,185 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,186 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-09-20 13:01:41,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,246 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.8 percent of original size [2019-09-20 13:01:41,252 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-09-20 13:01:41,253 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,279 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-09-20 13:01:41,279 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,301 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:80, output treesize:52 [2019-09-20 13:01:41,346 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 6=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_30|]} [2019-09-20 13:01:41,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-20 13:01:41,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:41,394 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-09-20 13:01:41,394 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:41,431 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-09-20 13:01:41,432 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,455 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:103, output treesize:58 [2019-09-20 13:01:41,530 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,531 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-09-20 13:01:41,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,626 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|], 2=[|v_#memory_int_30|], 9=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_31|]} [2019-09-20 13:01:41,635 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-09-20 13:01:41,636 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,693 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-09-20 13:01:41,694 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 117 [2019-09-20 13:01:41,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:41,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:41,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:41,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:41,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:41,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:41,770 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,848 INFO L567 ElimStorePlain]: treesize reduction 117, result has 47.5 percent of original size [2019-09-20 13:01:41,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:41,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:41,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 62 [2019-09-20 13:01:41,857 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,895 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:202, output treesize:69 [2019-09-20 13:01:41,988 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_33|], 12=[|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_40|]} [2019-09-20 13:01:41,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:41,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-09-20 13:01:41,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:42,070 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.3 percent of original size [2019-09-20 13:01:42,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:42,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:42,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:42,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:42,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-09-20 13:01:42,081 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:42,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:42,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:42,136 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:42,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 69 [2019-09-20 13:01:42,138 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:42,196 INFO L567 ElimStorePlain]: treesize reduction 48, result has 60.3 percent of original size [2019-09-20 13:01:42,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:42,197 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:73 [2019-09-20 13:01:42,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:42,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:42,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:42,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 43 [2019-09-20 13:01:42,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:42,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:42,329 INFO L341 Elim1Store]: treesize reduction 44, result has 42.1 percent of original size [2019-09-20 13:01:42,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 53 [2019-09-20 13:01:42,330 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:42,382 INFO L567 ElimStorePlain]: treesize reduction 40, result has 76.2 percent of original size [2019-09-20 13:01:42,400 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:42,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 94 [2019-09-20 13:01:42,402 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:42,444 INFO L567 ElimStorePlain]: treesize reduction 96, result has 48.1 percent of original size [2019-09-20 13:01:42,445 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-09-20 13:01:42,445 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:206, output treesize:89 [2019-09-20 13:01:42,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,518 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:42,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:42,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-09-20 13:01:42,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-20 13:01:42,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-20 13:01:42,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:01:42,529 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 16 states. [2019-09-20 13:01:43,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:43,477 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2019-09-20 13:01:43,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:01:43,478 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-09-20 13:01:43,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:43,480 INFO L225 Difference]: With dead ends: 130 [2019-09-20 13:01:43,480 INFO L226 Difference]: Without dead ends: 128 [2019-09-20 13:01:43,481 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2019-09-20 13:01:43,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-20 13:01:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2019-09-20 13:01:43,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-20 13:01:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2019-09-20 13:01:43,489 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 30 [2019-09-20 13:01:43,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:43,489 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2019-09-20 13:01:43,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-20 13:01:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2019-09-20 13:01:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:01:43,490 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:43,491 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:43,491 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:43,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:43,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1176084370, now seen corresponding path program 1 times [2019-09-20 13:01:43,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:43,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:43,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:43,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:43,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:44,108 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2019-09-20 13:01:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:44,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:44,218 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:44,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:44,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-20 13:01:44,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:44,355 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-09-20 13:01:44,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-09-20 13:01:44,401 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,402 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-09-20 13:01:44,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,456 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-09-20 13:01:44,464 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-09-20 13:01:44,465 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,488 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-09-20 13:01:44,489 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,507 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-09-20 13:01:44,576 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_36|], 6=[|v_#memory_$Pointer$.offset_35|, |v_#memory_$Pointer$.base_43|]} [2019-09-20 13:01:44,585 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-09-20 13:01:44,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:44,627 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-09-20 13:01:44,627 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:44,658 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-09-20 13:01:44,659 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,683 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:100, output treesize:55 [2019-09-20 13:01:44,755 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,755 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-09-20 13:01:44,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,808 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_37|], 2=[|v_#memory_int_35|], 9=[|v_#memory_$Pointer$.offset_36|, |v_#memory_$Pointer$.base_44|]} [2019-09-20 13:01:44,818 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-09-20 13:01:44,818 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,867 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-09-20 13:01:44,867 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2019-09-20 13:01:44,915 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,002 INFO L341 Elim1Store]: treesize reduction 16, result has 76.1 percent of original size [2019-09-20 13:01:45,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 86 [2019-09-20 13:01:45,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,006 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,071 INFO L567 ElimStorePlain]: treesize reduction 94, result has 43.0 percent of original size [2019-09-20 13:01:45,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,071 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:199, output treesize:70 [2019-09-20 13:01:45,169 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_38|], 12=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_37|]} [2019-09-20 13:01:45,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:45,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-09-20 13:01:45,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:45,260 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 69 [2019-09-20 13:01:45,261 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,321 INFO L567 ElimStorePlain]: treesize reduction 52, result has 66.0 percent of original size [2019-09-20 13:01:45,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:45,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:45,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-09-20 13:01:45,329 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,355 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:124, output treesize:82 [2019-09-20 13:01:45,413 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_int_39|], 7=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_38|]} [2019-09-20 13:01:45,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:45,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 33 [2019-09-20 13:01:45,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,520 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 166 treesize of output 153 [2019-09-20 13:01:45,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,525 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-09-20 13:01:45,648 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-20 13:01:45,649 INFO L567 ElimStorePlain]: treesize reduction 371, result has 28.7 percent of original size [2019-09-20 13:01:45,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:45,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 104 [2019-09-20 13:01:45,658 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:45,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:45,681 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-09-20 13:01:45,681 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:226, output treesize:109 [2019-09-20 13:01:45,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:45,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:45,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-09-20 13:01:45,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-20 13:01:45,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-20 13:01:45,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:01:45,771 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 19 states. [2019-09-20 13:01:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:46,745 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2019-09-20 13:01:46,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 13:01:46,745 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-09-20 13:01:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:46,747 INFO L225 Difference]: With dead ends: 130 [2019-09-20 13:01:46,748 INFO L226 Difference]: Without dead ends: 128 [2019-09-20 13:01:46,749 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-20 13:01:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-20 13:01:46,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2019-09-20 13:01:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-20 13:01:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2019-09-20 13:01:46,756 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 32 [2019-09-20 13:01:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:46,756 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2019-09-20 13:01:46,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-20 13:01:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2019-09-20 13:01:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:01:46,758 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:46,758 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:46,758 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:46,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:46,759 INFO L82 PathProgramCache]: Analyzing trace with hash -123276738, now seen corresponding path program 3 times [2019-09-20 13:01:46,759 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:46,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:46,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:46,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:46,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:47,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:47,381 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:47,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:01:47,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-20 13:01:47,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:01:47,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-20 13:01:47,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:47,582 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-09-20 13:01:47,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:47,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-09-20 13:01:47,629 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:47,630 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-09-20 13:01:47,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,698 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.8 percent of original size [2019-09-20 13:01:47,703 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-09-20 13:01:47,704 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:47,729 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-09-20 13:01:47,730 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:47,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,755 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:80, output treesize:52 [2019-09-20 13:01:47,795 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 6=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_40|]} [2019-09-20 13:01:47,801 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-09-20 13:01:47,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:47,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:47,851 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-09-20 13:01:47,852 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:47,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:47,891 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-09-20 13:01:47,892 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:47,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,920 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:103, output treesize:61 [2019-09-20 13:01:48,070 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:48,071 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-09-20 13:01:48,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:48,453 WARN L191 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-20 13:01:48,454 INFO L567 ElimStorePlain]: treesize reduction 40, result has 86.4 percent of original size [2019-09-20 13:01:48,455 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_40|, |v_#memory_int_43|], 10=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_41|]} [2019-09-20 13:01:48,459 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:48,671 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-09-20 13:01:48,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:48,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:48,695 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-09-20 13:01:48,695 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:48,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:48,835 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:48,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 190 treesize of output 159 [2019-09-20 13:01:48,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,843 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,073 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-20 13:01:49,074 INFO L567 ElimStorePlain]: treesize reduction 469, result has 26.0 percent of original size [2019-09-20 13:01:49,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:49,109 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 123 [2019-09-20 13:01:49,111 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,220 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-20 13:01:49,221 INFO L567 ElimStorePlain]: treesize reduction 48, result has 71.4 percent of original size [2019-09-20 13:01:49,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,221 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:249, output treesize:105 [2019-09-20 13:01:49,312 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_44|], 12=[|v_#memory_$Pointer$.base_50|, |v_#memory_$Pointer$.offset_42|]} [2019-09-20 13:01:49,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:49,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-09-20 13:01:49,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:49,451 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 92 [2019-09-20 13:01:49,454 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,595 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-20 13:01:49,596 INFO L567 ElimStorePlain]: treesize reduction 48, result has 73.5 percent of original size [2019-09-20 13:01:49,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:49,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:49,670 INFO L341 Elim1Store]: treesize reduction 32, result has 56.8 percent of original size [2019-09-20 13:01:49,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 92 [2019-09-20 13:01:49,673 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,817 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-20 13:01:49,818 INFO L567 ElimStorePlain]: treesize reduction 38, result has 75.0 percent of original size [2019-09-20 13:01:49,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,819 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:156, output treesize:114 [2019-09-20 13:01:49,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:49,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:50,030 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,030 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-09-20 13:01:50,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,220 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-09-20 13:01:50,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,223 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_41|], 4=[|v_#memory_int_45|], 17=[|v_#memory_$Pointer$.offset_43|, |v_#memory_$Pointer$.base_51|]} [2019-09-20 13:01:50,230 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:50,414 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-09-20 13:01:50,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:50,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 62 [2019-09-20 13:01:50,429 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,556 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 282 treesize of output 277 [2019-09-20 13:01:50,558 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,686 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-20 13:01:50,686 INFO L567 ElimStorePlain]: treesize reduction 152, result has 56.4 percent of original size [2019-09-20 13:01:50,791 INFO L341 Elim1Store]: treesize reduction 15, result has 86.6 percent of original size [2019-09-20 13:01:50,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 170 treesize of output 160 [2019-09-20 13:01:50,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:50,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:50,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:50,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:50,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:50,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:50,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:50,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:50,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:50,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:50,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:50,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,823 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:50,945 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-20 13:01:50,946 INFO L567 ElimStorePlain]: treesize reduction 91, result has 52.4 percent of original size [2019-09-20 13:01:50,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,947 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:366, output treesize:106 [2019-09-20 13:01:51,009 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_int_46|], 19=[|v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.base_52|]} [2019-09-20 13:01:51,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:51,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:51,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-09-20 13:01:51,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:51,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:51,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:51,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:51,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:51,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:51,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:51,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:51,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2019-09-20 13:01:51,100 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:51,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:51,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:51,184 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:51,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 121 [2019-09-20 13:01:51,186 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:51,282 INFO L567 ElimStorePlain]: treesize reduction 168, result has 40.6 percent of original size [2019-09-20 13:01:51,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:51,283 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:157, output treesize:115 [2019-09-20 13:01:51,381 INFO L392 ElimStorePlain]: Different costs {11=[|v_#memory_int_47|], 17=[|v_#memory_$Pointer$.offset_45|, |v_#memory_$Pointer$.base_53|]} [2019-09-20 13:01:51,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:51,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:51,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 69 [2019-09-20 13:01:51,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:51,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:51,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:51,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:51,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:51,583 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-09-20 13:01:51,584 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:51,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 287 treesize of output 463 [2019-09-20 13:01:51,587 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:51,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:51,668 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:51,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 146 [2019-09-20 13:01:51,671 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:51,764 INFO L567 ElimStorePlain]: treesize reduction 240, result has 38.6 percent of original size [2019-09-20 13:01:51,765 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-09-20 13:01:51,765 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:396, output treesize:151 [2019-09-20 13:01:51,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Stream closed [2019-09-20 13:01:52,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:52,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2019-09-20 13:01:52,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-20 13:01:52,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-20 13:01:52,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:01:52,041 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 19 states. [2019-09-20 13:01:52,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:52,899 INFO L93 Difference]: Finished difference Result 149 states and 179 transitions. [2019-09-20 13:01:52,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 13:01:52,899 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-09-20 13:01:52,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:52,900 INFO L225 Difference]: With dead ends: 149 [2019-09-20 13:01:52,900 INFO L226 Difference]: Without dead ends: 139 [2019-09-20 13:01:52,901 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2019-09-20 13:01:52,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-20 13:01:52,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 120. [2019-09-20 13:01:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-20 13:01:52,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 144 transitions. [2019-09-20 13:01:52,911 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 144 transitions. Word has length 35 [2019-09-20 13:01:52,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:52,911 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 144 transitions. [2019-09-20 13:01:52,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-20 13:01:52,911 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 144 transitions. [2019-09-20 13:01:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:01:52,915 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:52,915 INFO L407 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:52,915 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:52,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:52,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1744704133, now seen corresponding path program 3 times [2019-09-20 13:01:52,916 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:52,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:52,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:52,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:01:52,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-20 13:01:53,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:53,056 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:53,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:01:53,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-20 13:01:53,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:01:53,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-20 13:01:53,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:53,360 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-09-20 13:01:53,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:53,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:53,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:53,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:01:53,403 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:53,403 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-09-20 13:01:53,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:53,441 INFO L567 ElimStorePlain]: treesize reduction 14, result has 77.8 percent of original size [2019-09-20 13:01:53,447 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-09-20 13:01:53,447 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:53,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:53,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:53,460 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:36 [2019-09-20 13:01:53,494 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-09-20 13:01:53,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-09-20 13:01:53,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:53,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:53,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:53,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2019-09-20 13:01:53,559 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:53,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-09-20 13:01:53,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:53,626 INFO L567 ElimStorePlain]: treesize reduction 40, result has 72.4 percent of original size [2019-09-20 13:01:53,694 INFO L341 Elim1Store]: treesize reduction 16, result has 78.7 percent of original size [2019-09-20 13:01:53,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 88 treesize of output 89 [2019-09-20 13:01:53,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:53,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:53,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:53,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:53,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:53,698 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:53,758 INFO L567 ElimStorePlain]: treesize reduction 166, result has 29.7 percent of original size [2019-09-20 13:01:53,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:53,759 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:69 [2019-09-20 13:01:53,838 INFO L341 Elim1Store]: treesize reduction 62, result has 37.4 percent of original size [2019-09-20 13:01:53,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 70 [2019-09-20 13:01:53,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:53,890 INFO L567 ElimStorePlain]: treesize reduction 34, result has 67.0 percent of original size [2019-09-20 13:01:53,890 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-09-20 13:01:53,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:69 [2019-09-20 13:01:53,960 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:53,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 159 [2019-09-20 13:01:53,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:54,066 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-20 13:01:54,066 INFO L567 ElimStorePlain]: treesize reduction 78, result has 69.5 percent of original size [2019-09-20 13:01:54,250 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-20 13:01:54,250 INFO L341 Elim1Store]: treesize reduction 39, result has 75.6 percent of original size [2019-09-20 13:01:54,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 161 treesize of output 171 [2019-09-20 13:01:54,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:54,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,328 INFO L496 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:54,519 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 64 [2019-09-20 13:01:54,520 INFO L567 ElimStorePlain]: treesize reduction 345, result has 33.8 percent of original size [2019-09-20 13:01:54,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:54,522 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:160, output treesize:234 [2019-09-20 13:01:54,721 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-09-20 13:01:54,721 INFO L341 Elim1Store]: treesize reduction 98, result has 44.3 percent of original size [2019-09-20 13:01:54,722 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 128 treesize of output 131 [2019-09-20 13:01:54,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,733 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:54,826 INFO L567 ElimStorePlain]: treesize reduction 76, result has 56.1 percent of original size [2019-09-20 13:01:54,827 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-09-20 13:01:54,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:145, output treesize:126 [2019-09-20 13:01:54,878 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:54,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 72 [2019-09-20 13:01:54,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:54,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:55,257 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-09-20 13:01:55,258 INFO L341 Elim1Store]: treesize reduction 62, result has 75.9 percent of original size [2019-09-20 13:01:55,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 235 treesize of output 254 [2019-09-20 13:01:55,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:55,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,539 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:55,666 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 49 [2019-09-20 13:01:55,667 INFO L567 ElimStorePlain]: treesize reduction 198, result has 33.6 percent of original size [2019-09-20 13:01:55,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:55,668 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:251, output treesize:174 [2019-09-20 13:01:55,902 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 79 [2019-09-20 13:01:55,903 INFO L341 Elim1Store]: treesize reduction 134, result has 49.4 percent of original size [2019-09-20 13:01:55,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 186 treesize of output 193 [2019-09-20 13:01:55,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,949 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:56,065 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2019-09-20 13:01:56,066 INFO L567 ElimStorePlain]: treesize reduction 130, result has 43.5 percent of original size [2019-09-20 13:01:56,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:56,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:193, output treesize:174 [2019-09-20 13:01:56,080 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 30=[|v_#memory_$Pointer$.base_62|]} [2019-09-20 13:01:56,082 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:56,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:56,206 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:56,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 280 treesize of output 208 [2019-09-20 13:01:56,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,272 INFO L496 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:56,349 INFO L567 ElimStorePlain]: treesize reduction 119, result has 27.4 percent of original size [2019-09-20 13:01:56,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:56,350 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:266, output treesize:4 [2019-09-20 13:01:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:56,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:56,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2019-09-20 13:01:56,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:01:56,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:01:56,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:01:56,367 INFO L87 Difference]: Start difference. First operand 120 states and 144 transitions. Second operand 11 states. [2019-09-20 13:01:56,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:56,823 INFO L93 Difference]: Finished difference Result 170 states and 206 transitions. [2019-09-20 13:01:56,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:01:56,824 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-09-20 13:01:56,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:56,825 INFO L225 Difference]: With dead ends: 170 [2019-09-20 13:01:56,825 INFO L226 Difference]: Without dead ends: 168 [2019-09-20 13:01:56,826 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:01:56,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-20 13:01:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 99. [2019-09-20 13:01:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-20 13:01:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2019-09-20 13:01:56,835 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 35 [2019-09-20 13:01:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:56,836 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2019-09-20 13:01:56,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:01:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2019-09-20 13:01:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:01:56,836 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:56,837 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:56,837 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:56,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:56,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1826398334, now seen corresponding path program 1 times [2019-09-20 13:01:56,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:56,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:56,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:56,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:01:56,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:57,187 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-20 13:01:57,740 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:57,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:57,740 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:57,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:57,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-20 13:01:57,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:57,866 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-09-20 13:01:57,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:57,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:57,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:57,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:01:57,897 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:57,898 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-09-20 13:01:57,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:57,949 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-09-20 13:01:57,954 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-09-20 13:01:57,955 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:57,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:57,980 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-09-20 13:01:57,980 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:57,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:57,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:57,997 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-09-20 13:01:58,086 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_50|], 6=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_64|]} [2019-09-20 13:01:58,092 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-09-20 13:01:58,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:58,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:58,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:58,140 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-09-20 13:01:58,141 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:58,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:58,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:58,176 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-09-20 13:01:58,176 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:58,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:58,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:58,199 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:103, output treesize:58 [2019-09-20 13:01:58,295 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:58,295 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-09-20 13:01:58,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:58,487 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-20 13:01:58,488 INFO L567 ElimStorePlain]: treesize reduction 40, result has 84.3 percent of original size [2019-09-20 13:01:58,489 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_51|], 2=[|v_#memory_int_48|], 9=[|v_#memory_$Pointer$.offset_48|, |v_#memory_$Pointer$.base_65|]} [2019-09-20 13:01:58,499 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-09-20 13:01:58,500 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:58,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:58,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-09-20 13:01:58,570 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:58,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:58,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2019-09-20 13:01:58,628 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:58,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:58,695 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:58,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 95 [2019-09-20 13:01:58,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:58,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:58,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:58,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:58,698 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:58,763 INFO L567 ElimStorePlain]: treesize reduction 32, result has 73.3 percent of original size [2019-09-20 13:01:58,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:58,764 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:208, output treesize:88 [2019-09-20 13:01:58,902 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_52|], 12=[|v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_66|]} [2019-09-20 13:01:58,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-09-20 13:01:58,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:59,001 INFO L567 ElimStorePlain]: treesize reduction 8, result has 94.2 percent of original size [2019-09-20 13:01:59,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:59,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:59,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:59,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:59,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-09-20 13:01:59,013 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:59,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:59,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:59,068 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:59,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 74 [2019-09-20 13:01:59,070 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:59,140 INFO L567 ElimStorePlain]: treesize reduction 40, result has 69.7 percent of original size [2019-09-20 13:01:59,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:59,141 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:92 [2019-09-20 13:01:59,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:59,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:59,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:59,261 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:59,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-09-20 13:01:59,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:59,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:59,365 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_int_53|], 2=[|v_#memory_int_49|], 15=[|v_#memory_$Pointer$.base_67|, |v_#memory_$Pointer$.offset_50|]} [2019-09-20 13:01:59,386 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:59,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 53 [2019-09-20 13:01:59,387 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:59,530 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-20 13:01:59,530 INFO L567 ElimStorePlain]: treesize reduction 40, result has 85.8 percent of original size [2019-09-20 13:01:59,542 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:59,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 53 [2019-09-20 13:01:59,543 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:59,649 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-20 13:01:59,650 INFO L567 ElimStorePlain]: treesize reduction 40, result has 85.0 percent of original size [2019-09-20 13:01:59,757 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-20 13:01:59,758 INFO L341 Elim1Store]: treesize reduction 15, result has 86.6 percent of original size [2019-09-20 13:01:59,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 206 treesize of output 176 [2019-09-20 13:01:59,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:59,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:59,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:59,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:59,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:59,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:59,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:59,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:59,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:59,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:59,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:59,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:59,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,796 INFO L496 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:59,940 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 53 [2019-09-20 13:01:59,940 INFO L567 ElimStorePlain]: treesize reduction 322, result has 25.5 percent of original size [2019-09-20 13:01:59,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:59,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:59,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:59,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:59,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:59,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 82 [2019-09-20 13:01:59,954 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:59,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:59,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:59,983 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:288, output treesize:110 [2019-09-20 13:02:00,045 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_int_54|], 6=[|v_#memory_$Pointer$.base_68|, |v_#memory_$Pointer$.offset_51|]} [2019-09-20 13:02:00,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:00,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:00,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:00,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-09-20 13:02:00,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:00,144 INFO L567 ElimStorePlain]: treesize reduction 12, result has 95.3 percent of original size [2019-09-20 13:02:00,176 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:00,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 161 [2019-09-20 13:02:00,178 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:00,266 INFO L567 ElimStorePlain]: treesize reduction 192, result has 50.3 percent of original size [2019-09-20 13:02:00,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:00,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:00,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:00,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:00,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:00,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:00,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 65 [2019-09-20 13:02:00,290 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:00,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:00,315 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-09-20 13:02:00,315 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:273, output treesize:143 [2019-09-20 13:02:00,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:00,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:00,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-09-20 13:02:00,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-20 13:02:00,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-20 13:02:00,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-09-20 13:02:00,428 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand 21 states. [2019-09-20 13:02:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:01,663 INFO L93 Difference]: Finished difference Result 174 states and 208 transitions. [2019-09-20 13:02:01,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 13:02:01,664 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2019-09-20 13:02:01,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:01,666 INFO L225 Difference]: With dead ends: 174 [2019-09-20 13:02:01,666 INFO L226 Difference]: Without dead ends: 145 [2019-09-20 13:02:01,667 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-09-20 13:02:01,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-20 13:02:01,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 107. [2019-09-20 13:02:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-20 13:02:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2019-09-20 13:02:01,676 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 35 [2019-09-20 13:02:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:01,676 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2019-09-20 13:02:01,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-20 13:02:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2019-09-20 13:02:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-20 13:02:01,677 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:01,677 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:01,678 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:01,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:01,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1393926006, now seen corresponding path program 2 times [2019-09-20 13:02:01,678 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:01,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:01,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:01,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:01,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:01,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:01,885 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:01,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:02:02,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:02:02,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:02,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-20 13:02:02,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:02,022 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-09-20 13:02:02,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,037 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-09-20 13:02:02,038 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,048 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-09-20 13:02:02,100 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,100 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-09-20 13:02:02,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,209 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-20 13:02:02,209 INFO L567 ElimStorePlain]: treesize reduction 14, result has 89.1 percent of original size [2019-09-20 13:02:02,211 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_69|, |v_#memory_$Pointer$.offset_52|], 2=[|v_#memory_int_56|, |v_#memory_int_58|]} [2019-09-20 13:02:02,217 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-09-20 13:02:02,218 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,265 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-09-20 13:02:02,265 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,300 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:02,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:02,336 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-09-20 13:02:02,336 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,362 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:116, output treesize:58 [2019-09-20 13:02:02,401 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_59|], 6=[|v_#memory_$Pointer$.base_70|, |v_#memory_$Pointer$.offset_53|]} [2019-09-20 13:02:02,405 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-09-20 13:02:02,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:02,447 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-09-20 13:02:02,448 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:02,487 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-09-20 13:02:02,488 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,510 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:67 [2019-09-20 13:02:02,585 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,586 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-09-20 13:02:02,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,674 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_57|], 6=[|v_#memory_int_60|], 10=[|v_#memory_$Pointer$.base_71|, |v_#memory_$Pointer$.offset_54|]} [2019-09-20 13:02:02,679 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:02,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:02,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 48 [2019-09-20 13:02:02,777 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:02,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,858 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:02,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 154 [2019-09-20 13:02:02,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:02,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:02,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:02,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:02,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:02,863 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,016 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-20 13:02:03,017 INFO L567 ElimStorePlain]: treesize reduction 442, result has 25.6 percent of original size [2019-09-20 13:02:03,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,042 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 114 [2019-09-20 13:02:03,043 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,103 INFO L567 ElimStorePlain]: treesize reduction 48, result has 69.0 percent of original size [2019-09-20 13:02:03,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,104 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:249, output treesize:92 [2019-09-20 13:02:03,159 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_61|], 12=[|v_#memory_$Pointer$.offset_55|, |v_#memory_$Pointer$.base_72|]} [2019-09-20 13:02:03,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-09-20 13:02:03,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,259 INFO L341 Elim1Store]: treesize reduction 32, result has 56.8 percent of original size [2019-09-20 13:02:03,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 92 [2019-09-20 13:02:03,261 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,345 INFO L567 ElimStorePlain]: treesize reduction 30, result has 77.9 percent of original size [2019-09-20 13:02:03,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,363 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 73 [2019-09-20 13:02:03,365 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,419 INFO L567 ElimStorePlain]: treesize reduction 48, result has 64.4 percent of original size [2019-09-20 13:02:03,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,420 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:143, output treesize:87 [2019-09-20 13:02:03,470 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_$Pointer$.base_73|, |v_#memory_$Pointer$.offset_56|], 6=[|v_#memory_int_62|]} [2019-09-20 13:02:03,484 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 125 [2019-09-20 13:02:03,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,560 INFO L567 ElimStorePlain]: treesize reduction 72, result has 70.9 percent of original size [2019-09-20 13:02:03,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 43 [2019-09-20 13:02:03,572 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 40 [2019-09-20 13:02:03,611 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,629 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-09-20 13:02:03,629 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:214, output treesize:101 [2019-09-20 13:02:03,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:03,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,733 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:03,733 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:03,740 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:03,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 1 [2019-09-20 13:02:03,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,754 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:03,754 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:03,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 94 [2019-09-20 13:02:03,756 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,776 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-09-20 13:02:03,776 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:273, output treesize:88 [2019-09-20 13:02:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:02:03,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:03,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2019-09-20 13:02:03,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-20 13:02:03,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-20 13:02:03,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:02:03,852 INFO L87 Difference]: Start difference. First operand 107 states and 127 transitions. Second operand 16 states.