java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-sorted-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 22:07:34,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 22:07:34,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 22:07:34,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 22:07:34,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 22:07:34,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 22:07:34,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 22:07:34,093 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 22:07:34,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 22:07:34,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 22:07:34,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 22:07:34,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 22:07:34,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 22:07:34,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 22:07:34,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 22:07:34,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 22:07:34,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 22:07:34,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 22:07:34,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 22:07:34,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 22:07:34,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 22:07:34,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 22:07:34,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 22:07:34,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 22:07:34,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 22:07:34,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 22:07:34,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 22:07:34,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 22:07:34,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 22:07:34,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 22:07:34,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 22:07:34,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 22:07:34,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 22:07:34,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 22:07:34,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 22:07:34,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 22:07:34,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 22:07:34,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 22:07:34,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 22:07:34,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 22:07:34,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 22:07:34,125 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 22:07:34,151 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 22:07:34,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 22:07:34,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 22:07:34,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 22:07:34,154 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 22:07:34,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 22:07:34,154 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 22:07:34,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 22:07:34,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 22:07:34,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 22:07:34,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 22:07:34,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 22:07:34,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 22:07:34,157 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 22:07:34,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 22:07:34,157 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 22:07:34,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 22:07:34,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 22:07:34,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 22:07:34,158 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 22:07:34,159 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 22:07:34,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:07:34,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 22:07:34,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 22:07:34,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 22:07:34,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 22:07:34,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 22:07:34,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 22:07:34,160 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 22:07:34,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 22:07:34,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 22:07:34,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 22:07:34,457 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 22:07:34,457 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 22:07:34,458 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-sorted-2.i [2019-10-14 22:07:34,523 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8b0a840/67c9b60ecf4a47e2ac3779ddef1ed117/FLAGf2b034dbc [2019-10-14 22:07:35,080 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 22:07:35,081 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i [2019-10-14 22:07:35,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8b0a840/67c9b60ecf4a47e2ac3779ddef1ed117/FLAGf2b034dbc [2019-10-14 22:07:35,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8b0a840/67c9b60ecf4a47e2ac3779ddef1ed117 [2019-10-14 22:07:35,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 22:07:35,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 22:07:35,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 22:07:35,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 22:07:35,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 22:07:35,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:35" (1/1) ... [2019-10-14 22:07:35,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23bcb1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:35, skipping insertion in model container [2019-10-14 22:07:35,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:35" (1/1) ... [2019-10-14 22:07:35,426 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 22:07:35,491 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 22:07:35,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:07:35,962 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 22:07:36,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:07:36,087 INFO L192 MainTranslator]: Completed translation [2019-10-14 22:07:36,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:36 WrapperNode [2019-10-14 22:07:36,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 22:07:36,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 22:07:36,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 22:07:36,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 22:07:36,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:36" (1/1) ... [2019-10-14 22:07:36,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:36" (1/1) ... [2019-10-14 22:07:36,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:36" (1/1) ... [2019-10-14 22:07:36,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:36" (1/1) ... [2019-10-14 22:07:36,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:36" (1/1) ... [2019-10-14 22:07:36,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:36" (1/1) ... [2019-10-14 22:07:36,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:36" (1/1) ... [2019-10-14 22:07:36,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 22:07:36,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 22:07:36,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 22:07:36,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 22:07:36,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:07:36,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 22:07:36,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 22:07:36,247 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 22:07:36,247 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 22:07:36,247 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 22:07:36,248 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 22:07:36,248 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 22:07:36,249 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 22:07:36,249 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 22:07:36,249 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 22:07:36,249 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 22:07:36,249 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 22:07:36,250 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 22:07:36,250 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 22:07:36,250 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 22:07:36,250 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 22:07:36,250 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 22:07:36,251 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 22:07:36,251 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 22:07:36,251 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 22:07:36,251 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 22:07:36,251 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 22:07:36,251 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 22:07:36,252 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 22:07:36,252 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 22:07:36,252 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 22:07:36,252 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 22:07:36,252 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 22:07:36,252 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 22:07:36,253 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 22:07:36,253 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 22:07:36,253 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 22:07:36,253 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 22:07:36,253 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 22:07:36,253 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 22:07:36,254 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 22:07:36,254 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 22:07:36,254 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 22:07:36,254 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 22:07:36,254 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 22:07:36,254 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 22:07:36,255 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 22:07:36,255 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 22:07:36,255 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 22:07:36,255 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 22:07:36,255 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 22:07:36,255 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 22:07:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 22:07:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 22:07:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 22:07:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 22:07:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 22:07:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 22:07:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 22:07:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 22:07:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 22:07:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 22:07:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 22:07:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 22:07:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 22:07:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 22:07:36,258 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 22:07:36,258 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 22:07:36,258 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 22:07:36,258 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 22:07:36,258 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 22:07:36,258 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 22:07:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 22:07:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 22:07:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 22:07:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 22:07:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 22:07:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 22:07:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 22:07:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 22:07:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 22:07:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 22:07:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 22:07:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 22:07:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 22:07:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 22:07:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 22:07:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 22:07:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 22:07:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 22:07:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 22:07:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 22:07:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 22:07:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 22:07:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 22:07:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 22:07:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 22:07:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 22:07:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 22:07:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 22:07:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 22:07:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 22:07:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 22:07:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 22:07:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 22:07:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 22:07:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 22:07:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 22:07:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 22:07:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 22:07:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 22:07:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 22:07:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 22:07:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 22:07:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 22:07:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 22:07:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 22:07:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 22:07:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 22:07:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 22:07:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 22:07:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 22:07:36,901 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 22:07:36,901 INFO L284 CfgBuilder]: Removed 20 assume(true) statements. [2019-10-14 22:07:36,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:36 BoogieIcfgContainer [2019-10-14 22:07:36,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 22:07:36,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 22:07:36,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 22:07:36,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 22:07:36,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:07:35" (1/3) ... [2019-10-14 22:07:36,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a08b439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:36, skipping insertion in model container [2019-10-14 22:07:36,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:36" (2/3) ... [2019-10-14 22:07:36,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a08b439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:36, skipping insertion in model container [2019-10-14 22:07:36,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:36" (3/3) ... [2019-10-14 22:07:36,911 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2019-10-14 22:07:36,921 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 22:07:36,929 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-10-14 22:07:36,941 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-10-14 22:07:36,965 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 22:07:36,965 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 22:07:36,965 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 22:07:36,966 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 22:07:36,966 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 22:07:36,966 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 22:07:36,966 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 22:07:36,966 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 22:07:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2019-10-14 22:07:36,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-14 22:07:36,991 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:36,992 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:36,994 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:37,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:37,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1007014106, now seen corresponding path program 1 times [2019-10-14 22:07:37,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:37,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216715117] [2019-10-14 22:07:37,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:37,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:37,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:37,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216715117] [2019-10-14 22:07:37,193 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:37,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 22:07:37,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152512468] [2019-10-14 22:07:37,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 22:07:37,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:37,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 22:07:37,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:07:37,220 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 3 states. [2019-10-14 22:07:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:37,463 INFO L93 Difference]: Finished difference Result 124 states and 196 transitions. [2019-10-14 22:07:37,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 22:07:37,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-14 22:07:37,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:37,477 INFO L225 Difference]: With dead ends: 124 [2019-10-14 22:07:37,478 INFO L226 Difference]: Without dead ends: 60 [2019-10-14 22:07:37,483 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:07:37,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-14 22:07:37,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-10-14 22:07:37,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-14 22:07:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-10-14 22:07:37,549 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 10 [2019-10-14 22:07:37,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:37,550 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-10-14 22:07:37,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 22:07:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-10-14 22:07:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-14 22:07:37,551 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:37,552 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:37,552 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:37,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:37,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1170755113, now seen corresponding path program 1 times [2019-10-14 22:07:37,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:37,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917494467] [2019-10-14 22:07:37,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:37,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:37,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:37,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917494467] [2019-10-14 22:07:37,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:37,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 22:07:37,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920385886] [2019-10-14 22:07:37,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 22:07:37,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:37,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 22:07:37,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:07:37,655 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 4 states. [2019-10-14 22:07:37,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:37,799 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2019-10-14 22:07:37,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 22:07:37,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-14 22:07:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:37,801 INFO L225 Difference]: With dead ends: 119 [2019-10-14 22:07:37,801 INFO L226 Difference]: Without dead ends: 65 [2019-10-14 22:07:37,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:07:37,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-14 22:07:37,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-10-14 22:07:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-14 22:07:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-10-14 22:07:37,811 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 11 [2019-10-14 22:07:37,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:37,812 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-10-14 22:07:37,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 22:07:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-10-14 22:07:37,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 22:07:37,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:37,813 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:37,813 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:37,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:37,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1725322068, now seen corresponding path program 1 times [2019-10-14 22:07:37,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:37,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143573645] [2019-10-14 22:07:37,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:37,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:37,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 22:07:37,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143573645] [2019-10-14 22:07:37,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:37,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 22:07:37,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954958487] [2019-10-14 22:07:37,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 22:07:37,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:37,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 22:07:37,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 22:07:37,911 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 5 states. [2019-10-14 22:07:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:38,148 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2019-10-14 22:07:38,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 22:07:38,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-14 22:07:38,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:38,153 INFO L225 Difference]: With dead ends: 103 [2019-10-14 22:07:38,153 INFO L226 Difference]: Without dead ends: 101 [2019-10-14 22:07:38,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:07:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-14 22:07:38,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 62. [2019-10-14 22:07:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-14 22:07:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2019-10-14 22:07:38,170 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 15 [2019-10-14 22:07:38,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:38,170 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-10-14 22:07:38,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 22:07:38,170 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2019-10-14 22:07:38,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 22:07:38,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:38,173 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:38,173 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:38,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:38,174 INFO L82 PathProgramCache]: Analyzing trace with hash -964262520, now seen corresponding path program 1 times [2019-10-14 22:07:38,177 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:38,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428744614] [2019-10-14 22:07:38,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:38,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:38,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:38,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428744614] [2019-10-14 22:07:38,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950089186] [2019-10-14 22:07:38,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:38,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-14 22:07:38,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:38,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:38,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-14 22:07:38,818 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:07:38,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:07:38,846 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:07:38,869 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,882 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:33 [2019-10-14 22:07:38,926 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|], 6=[|v_#memory_$Pointer$.base_31|, |v_#memory_$Pointer$.offset_31|]} [2019-10-14 22:07:38,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-10-14 22:07:38,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:39,035 INFO L341 Elim1Store]: treesize reduction 66, result has 49.6 percent of original size [2019-10-14 22:07:39,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 149 [2019-10-14 22:07:39,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:39,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:39,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:39,055 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-10-14 22:07:39,102 INFO L567 ElimStorePlain]: treesize reduction 222, result has 30.0 percent of original size [2019-10-14 22:07:39,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:39,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 105 [2019-10-14 22:07:39,123 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:39,147 INFO L567 ElimStorePlain]: treesize reduction 58, result has 49.1 percent of original size [2019-10-14 22:07:39,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:39,147 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:56 [2019-10-14 22:07:39,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:39,223 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:39,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-10-14 22:07:39,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285144871] [2019-10-14 22:07:39,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-14 22:07:39,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:39,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-14 22:07:39,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-14 22:07:39,225 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 13 states. [2019-10-14 22:07:39,835 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-10-14 22:07:40,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:40,402 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2019-10-14 22:07:40,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 22:07:40,403 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-10-14 22:07:40,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:40,408 INFO L225 Difference]: With dead ends: 154 [2019-10-14 22:07:40,408 INFO L226 Difference]: Without dead ends: 110 [2019-10-14 22:07:40,409 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-10-14 22:07:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-14 22:07:40,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 75. [2019-10-14 22:07:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-14 22:07:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2019-10-14 22:07:40,420 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 22 [2019-10-14 22:07:40,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:40,420 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2019-10-14 22:07:40,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-14 22:07:40,421 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2019-10-14 22:07:40,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 22:07:40,422 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:40,422 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:40,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:40,631 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:40,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:40,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1597211810, now seen corresponding path program 1 times [2019-10-14 22:07:40,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:40,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953011308] [2019-10-14 22:07:40,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:40,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:40,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:40,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953011308] [2019-10-14 22:07:40,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194405795] [2019-10-14 22:07:40,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:41,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-14 22:07:41,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:41,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:41,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:41,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-14 22:07:41,140 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:41,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:07:41,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:41,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:07:41,161 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:41,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:07:41,196 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:41,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,211 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:33 [2019-10-14 22:07:41,241 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_33|], 6=[|v_#memory_$Pointer$.offset_33|, |v_#memory_$Pointer$.base_33|]} [2019-10-14 22:07:41,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-10-14 22:07:41,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:41,279 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:41,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 136 [2019-10-14 22:07:41,282 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,316 INFO L567 ElimStorePlain]: treesize reduction 58, result has 62.1 percent of original size [2019-10-14 22:07:41,375 INFO L341 Elim1Store]: treesize reduction 66, result has 49.6 percent of original size [2019-10-14 22:07:41,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 122 [2019-10-14 22:07:41,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,379 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,406 INFO L567 ElimStorePlain]: treesize reduction 40, result has 58.3 percent of original size [2019-10-14 22:07:41,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,407 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:56 [2019-10-14 22:07:41,498 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:41,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 54 [2019-10-14 22:07:41,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,526 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.2 percent of original size [2019-10-14 22:07:41,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2019-10-14 22:07:41,531 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:41,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,537 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:9 [2019-10-14 22:07:41,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-14 22:07:41,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:41,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-10-14 22:07:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:41,569 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:41,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-10-14 22:07:41,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447095398] [2019-10-14 22:07:41,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 22:07:41,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:41,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 22:07:41,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-10-14 22:07:41,571 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 15 states. [2019-10-14 22:07:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:42,691 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2019-10-14 22:07:42,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 22:07:42,691 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-10-14 22:07:42,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:42,693 INFO L225 Difference]: With dead ends: 103 [2019-10-14 22:07:42,693 INFO L226 Difference]: Without dead ends: 101 [2019-10-14 22:07:42,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2019-10-14 22:07:42,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-14 22:07:42,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-10-14 22:07:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-14 22:07:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2019-10-14 22:07:42,704 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 25 [2019-10-14 22:07:42,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:42,704 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2019-10-14 22:07:42,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 22:07:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2019-10-14 22:07:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 22:07:42,706 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:42,706 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:42,916 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:42,917 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:42,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:42,918 INFO L82 PathProgramCache]: Analyzing trace with hash -474324013, now seen corresponding path program 1 times [2019-10-14 22:07:42,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:42,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590612027] [2019-10-14 22:07:42,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:42,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:42,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:43,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590612027] [2019-10-14 22:07:43,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871422043] [2019-10-14 22:07:43,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:43,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-14 22:07:43,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:43,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:43,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:07:43,447 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,474 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-14 22:07:43,502 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:43,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,543 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2019-10-14 22:07:43,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:43,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-14 22:07:43,553 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-14 22:07:43,571 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,581 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:59, output treesize:27 [2019-10-14 22:07:43,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-14 22:07:43,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-10-14 22:07:43,686 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 22:07:43,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,709 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_36|], 6=[|v_#memory_int_39|]} [2019-10-14 22:07:43,714 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:43,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,747 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-10-14 22:07:43,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 32 [2019-10-14 22:07:43,748 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:43,762 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:71, output treesize:34 [2019-10-14 22:07:43,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-10-14 22:07:43,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:43,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:43 [2019-10-14 22:07:43,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-10-14 22:07:43,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-10-14 22:07:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:43,926 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:43,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2019-10-14 22:07:43,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087853090] [2019-10-14 22:07:43,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-14 22:07:43,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:43,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-14 22:07:43,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-10-14 22:07:43,928 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand 17 states. [2019-10-14 22:07:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:46,035 INFO L93 Difference]: Finished difference Result 244 states and 294 transitions. [2019-10-14 22:07:46,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-14 22:07:46,035 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-10-14 22:07:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:46,037 INFO L225 Difference]: With dead ends: 244 [2019-10-14 22:07:46,038 INFO L226 Difference]: Without dead ends: 242 [2019-10-14 22:07:46,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=269, Invalid=921, Unknown=0, NotChecked=0, Total=1190 [2019-10-14 22:07:46,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-10-14 22:07:46,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 86. [2019-10-14 22:07:46,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-14 22:07:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2019-10-14 22:07:46,053 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 26 [2019-10-14 22:07:46,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:46,054 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2019-10-14 22:07:46,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-14 22:07:46,054 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2019-10-14 22:07:46,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 22:07:46,055 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:46,055 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:46,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:46,266 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:46,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:46,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1238565257, now seen corresponding path program 1 times [2019-10-14 22:07:46,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:46,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818637745] [2019-10-14 22:07:46,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:46,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:46,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:46,717 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-10-14 22:07:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:46,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818637745] [2019-10-14 22:07:46,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068750936] [2019-10-14 22:07:46,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:46,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-14 22:07:46,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:46,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:46,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:46,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:46,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:46,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-14 22:07:47,000 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:47,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,046 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.1 percent of original size [2019-10-14 22:07:47,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:07:47,057 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:07:47,078 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,095 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:71, output treesize:43 [2019-10-14 22:07:47,137 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 6=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_35|]} [2019-10-14 22:07:47,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:07:47,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:47,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 22:07:47,178 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:47,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 22:07:47,212 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,230 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:94, output treesize:52 [2019-10-14 22:07:47,310 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-14 22:07:47,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,370 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_41|, |v_#memory_int_43|], 10=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_36|]} [2019-10-14 22:07:47,376 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:47,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:47,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 36 [2019-10-14 22:07:47,430 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,540 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 181 treesize of output 194 [2019-10-14 22:07:47,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:47,545 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,646 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-10-14 22:07:47,647 INFO L567 ElimStorePlain]: treesize reduction 96, result has 59.5 percent of original size [2019-10-14 22:07:47,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 67 [2019-10-14 22:07:47,653 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,671 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:227, output treesize:67 [2019-10-14 22:07:47,713 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_44|], 6=[|v_#memory_$Pointer$.offset_37|], 12=[|v_#memory_$Pointer$.base_37|]} [2019-10-14 22:07:47,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2019-10-14 22:07:47,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,800 INFO L341 Elim1Store]: treesize reduction 46, result has 55.3 percent of original size [2019-10-14 22:07:47,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 223 treesize of output 210 [2019-10-14 22:07:47,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:47,803 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,854 INFO L567 ElimStorePlain]: treesize reduction 48, result has 78.6 percent of original size [2019-10-14 22:07:47,979 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-10-14 22:07:47,979 INFO L341 Elim1Store]: treesize reduction 54, result has 69.3 percent of original size [2019-10-14 22:07:47,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 187 [2019-10-14 22:07:47,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:47,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:47,983 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,030 INFO L567 ElimStorePlain]: treesize reduction 148, result has 45.0 percent of original size [2019-10-14 22:07:48,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:48,032 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:247, output treesize:121 [2019-10-14 22:07:48,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:48,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 7 [2019-10-14 22:07:48,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:48,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:122, output treesize:84 [2019-10-14 22:07:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:48,267 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:48,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-10-14 22:07:48,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319858469] [2019-10-14 22:07:48,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 22:07:48,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:48,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 22:07:48,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-14 22:07:48,269 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 19 states. [2019-10-14 22:07:49,258 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-10-14 22:07:49,785 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2019-10-14 22:07:50,061 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 88 [2019-10-14 22:07:50,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:50,702 INFO L93 Difference]: Finished difference Result 200 states and 241 transitions. [2019-10-14 22:07:50,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 22:07:50,702 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2019-10-14 22:07:50,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:50,703 INFO L225 Difference]: With dead ends: 200 [2019-10-14 22:07:50,703 INFO L226 Difference]: Without dead ends: 165 [2019-10-14 22:07:50,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2019-10-14 22:07:50,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-14 22:07:50,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 100. [2019-10-14 22:07:50,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-14 22:07:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2019-10-14 22:07:50,724 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 29 [2019-10-14 22:07:50,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:50,725 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2019-10-14 22:07:50,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 22:07:50,725 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2019-10-14 22:07:50,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 22:07:50,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:50,726 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:50,927 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:50,927 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:50,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:50,928 INFO L82 PathProgramCache]: Analyzing trace with hash -2047911883, now seen corresponding path program 1 times [2019-10-14 22:07:50,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:50,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969125454] [2019-10-14 22:07:50,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:50,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:50,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-14 22:07:50,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969125454] [2019-10-14 22:07:50,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:50,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:07:50,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755385084] [2019-10-14 22:07:50,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:07:50,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:50,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:07:50,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:07:50,988 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand 6 states. [2019-10-14 22:07:51,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:51,159 INFO L93 Difference]: Finished difference Result 148 states and 183 transitions. [2019-10-14 22:07:51,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:07:51,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-10-14 22:07:51,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:51,162 INFO L225 Difference]: With dead ends: 148 [2019-10-14 22:07:51,162 INFO L226 Difference]: Without dead ends: 110 [2019-10-14 22:07:51,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:07:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-14 22:07:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2019-10-14 22:07:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-14 22:07:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-10-14 22:07:51,173 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 29 [2019-10-14 22:07:51,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:51,174 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-10-14 22:07:51,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:07:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-10-14 22:07:51,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 22:07:51,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:51,175 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:51,176 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:51,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1863000761, now seen corresponding path program 1 times [2019-10-14 22:07:51,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:51,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608244783] [2019-10-14 22:07:51,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:51,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:51,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:51,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608244783] [2019-10-14 22:07:51,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061119613] [2019-10-14 22:07:51,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:51,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-14 22:07:51,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:51,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:51,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:51,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:51,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:51,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-14 22:07:51,805 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:51,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:51,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:51,856 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-10-14 22:07:51,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:07:51,863 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:51,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:51,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:07:51,884 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:51,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:51,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:51,900 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-10-14 22:07:51,940 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_46|], 6=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_39|]} [2019-10-14 22:07:51,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:07:51,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:51,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:51,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:51,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 22:07:51,984 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:52,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 22:07:52,018 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,041 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:97, output treesize:55 [2019-10-14 22:07:52,135 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-14 22:07:52,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,195 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_47|], 2=[|v_#memory_int_45|], 9=[|v_#memory_$Pointer$.base_40|, |v_#memory_$Pointer$.offset_40|]} [2019-10-14 22:07:52,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-10-14 22:07:52,207 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:07:52,259 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,338 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 137 [2019-10-14 22:07:52,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:52,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:52,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:52,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:52,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:52,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:52,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:52,348 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,513 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 43 [2019-10-14 22:07:52,514 INFO L567 ElimStorePlain]: treesize reduction 1588, result has 6.6 percent of original size [2019-10-14 22:07:52,525 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 70 [2019-10-14 22:07:52,526 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,544 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:196, output treesize:64 [2019-10-14 22:07:52,590 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_48|], 6=[|v_#memory_$Pointer$.offset_41|], 12=[|v_#memory_$Pointer$.base_41|]} [2019-10-14 22:07:52,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-10-14 22:07:52,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:52,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 29 [2019-10-14 22:07:52,639 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,795 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-10-14 22:07:52,795 INFO L341 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-10-14 22:07:52,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 161 [2019-10-14 22:07:52,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:52,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:52,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:52,798 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,839 INFO L567 ElimStorePlain]: treesize reduction 100, result has 50.5 percent of original size [2019-10-14 22:07:52,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:52,840 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:200, output treesize:102 [2019-10-14 22:07:52,957 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-10-14 22:07:52,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-10-14 22:07:52,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,012 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 77 [2019-10-14 22:07:53,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:53,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:53,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:53,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:53,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:53,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:53,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:53,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:53,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:53,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:53,020 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:53,068 INFO L567 ElimStorePlain]: treesize reduction 36, result has 47.1 percent of original size [2019-10-14 22:07:53,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:53,070 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:116, output treesize:24 [2019-10-14 22:07:53,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-10-14 22:07:53,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-10-14 22:07:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:53,130 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:53,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2019-10-14 22:07:53,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391356512] [2019-10-14 22:07:53,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 22:07:53,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:53,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 22:07:53,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-10-14 22:07:53,132 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 21 states. [2019-10-14 22:07:54,209 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-14 22:07:54,424 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-10-14 22:07:54,946 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-10-14 22:07:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:57,124 INFO L93 Difference]: Finished difference Result 299 states and 366 transitions. [2019-10-14 22:07:57,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-14 22:07:57,125 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-10-14 22:07:57,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:57,127 INFO L225 Difference]: With dead ends: 299 [2019-10-14 22:07:57,127 INFO L226 Difference]: Without dead ends: 297 [2019-10-14 22:07:57,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=338, Invalid=2314, Unknown=0, NotChecked=0, Total=2652 [2019-10-14 22:07:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-10-14 22:07:57,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 121. [2019-10-14 22:07:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-14 22:07:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 153 transitions. [2019-10-14 22:07:57,142 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 153 transitions. Word has length 29 [2019-10-14 22:07:57,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:57,143 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 153 transitions. [2019-10-14 22:07:57,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 22:07:57,143 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2019-10-14 22:07:57,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 22:07:57,144 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:57,145 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:57,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:57,357 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:57,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:57,357 INFO L82 PathProgramCache]: Analyzing trace with hash 921966592, now seen corresponding path program 1 times [2019-10-14 22:07:57,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:57,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459427725] [2019-10-14 22:07:57,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:57,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:57,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:57,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459427725] [2019-10-14 22:07:57,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885357568] [2019-10-14 22:07:57,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:57,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-14 22:07:57,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:57,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:57,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:07:57,832 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,844 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-14 22:07:57,875 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:07:57,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,891 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:57,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:57,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 20 [2019-10-14 22:07:57,911 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,918 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:53, output treesize:17 [2019-10-14 22:07:57,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-14 22:07:57,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:57,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2019-10-14 22:07:58,028 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_42|], 10=[|v_#memory_int_54|]} [2019-10-14 22:07:58,032 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:58,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-10-14 22:07:58,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 22:07:58,098 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.1 percent of original size [2019-10-14 22:07:58,107 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:58,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-10-14 22:07:58,110 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-14 22:07:58,170 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2019-10-14 22:07:58,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:58,182 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:58,256 INFO L341 Elim1Store]: treesize reduction 33, result has 70.8 percent of original size [2019-10-14 22:07:58,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 95 [2019-10-14 22:07:58,258 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,347 INFO L567 ElimStorePlain]: treesize reduction 47, result has 61.2 percent of original size [2019-10-14 22:07:58,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:58,349 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:85, output treesize:74 [2019-10-14 22:07:58,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,427 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_51|], 10=[|v_#memory_int_55|]} [2019-10-14 22:07:58,430 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:58,433 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:58,518 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.5 percent of original size [2019-10-14 22:07:58,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:58,541 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:58,585 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 121 [2019-10-14 22:07:58,586 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:58,603 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:58,615 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 61 [2019-10-14 22:07:58,617 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,706 INFO L567 ElimStorePlain]: treesize reduction 88, result has 47.0 percent of original size [2019-10-14 22:07:58,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-10-14 22:07:58,709 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:122, output treesize:64 [2019-10-14 22:07:58,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,836 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-10-14 22:07:58,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-10-14 22:07:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:58,849 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:58,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2019-10-14 22:07:58,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542905694] [2019-10-14 22:07:58,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 22:07:58,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:58,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 22:07:58,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-10-14 22:07:58,850 INFO L87 Difference]: Start difference. First operand 121 states and 153 transitions. Second operand 19 states. [2019-10-14 22:08:00,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:00,175 INFO L93 Difference]: Finished difference Result 228 states and 277 transitions. [2019-10-14 22:08:00,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-14 22:08:00,175 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-10-14 22:08:00,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:00,178 INFO L225 Difference]: With dead ends: 228 [2019-10-14 22:08:00,178 INFO L226 Difference]: Without dead ends: 213 [2019-10-14 22:08:00,179 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2019-10-14 22:08:00,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-14 22:08:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 143. [2019-10-14 22:08:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-14 22:08:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 181 transitions. [2019-10-14 22:08:00,193 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 181 transitions. Word has length 31 [2019-10-14 22:08:00,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:00,194 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 181 transitions. [2019-10-14 22:08:00,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 22:08:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2019-10-14 22:08:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 22:08:00,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:00,196 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:00,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:00,405 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:00,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:00,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1731313218, now seen corresponding path program 1 times [2019-10-14 22:08:00,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:00,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662719859] [2019-10-14 22:08:00,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:00,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:00,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:00,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662719859] [2019-10-14 22:08:00,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012667555] [2019-10-14 22:08:00,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:00,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-14 22:08:00,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:00,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:08:00,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:00,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:00,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:00,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-14 22:08:00,700 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:00,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:08:00,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:00,738 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-10-14 22:08:00,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:08:00,744 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:00,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:00,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:00,760 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-10-14 22:08:00,852 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-10-14 22:08:00,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 83 [2019-10-14 22:08:00,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:00,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:00,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:00,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:00,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-14 22:08:00,902 INFO L567 ElimStorePlain]: treesize reduction 98, result has 30.5 percent of original size [2019-10-14 22:08:00,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:00,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:42 [2019-10-14 22:08:00,998 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:00,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-14 22:08:00,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,018 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_$Pointer$.base_43|], 6=[|v_#memory_$Pointer$.base_46|]} [2019-10-14 22:08:01,020 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:01,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,041 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2019-10-14 22:08:01,042 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,057 INFO L567 ElimStorePlain]: treesize reduction 12, result has 58.6 percent of original size [2019-10-14 22:08:01,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,058 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:81, output treesize:4 [2019-10-14 22:08:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:01,065 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:01,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2019-10-14 22:08:01,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066105458] [2019-10-14 22:08:01,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 22:08:01,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:01,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 22:08:01,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-14 22:08:01,068 INFO L87 Difference]: Start difference. First operand 143 states and 181 transitions. Second operand 12 states. [2019-10-14 22:08:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:02,191 INFO L93 Difference]: Finished difference Result 305 states and 369 transitions. [2019-10-14 22:08:02,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 22:08:02,191 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-10-14 22:08:02,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:02,194 INFO L225 Difference]: With dead ends: 305 [2019-10-14 22:08:02,194 INFO L226 Difference]: Without dead ends: 280 [2019-10-14 22:08:02,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2019-10-14 22:08:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-10-14 22:08:02,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 152. [2019-10-14 22:08:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-14 22:08:02,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 191 transitions. [2019-10-14 22:08:02,210 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 191 transitions. Word has length 31 [2019-10-14 22:08:02,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:02,210 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 191 transitions. [2019-10-14 22:08:02,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 22:08:02,210 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 191 transitions. [2019-10-14 22:08:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 22:08:02,211 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:02,211 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:02,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:02,416 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:02,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:02,417 INFO L82 PathProgramCache]: Analyzing trace with hash -840660915, now seen corresponding path program 1 times [2019-10-14 22:08:02,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:02,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487169880] [2019-10-14 22:08:02,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:02,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:02,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:02,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:02,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487169880] [2019-10-14 22:08:02,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387535418] [2019-10-14 22:08:02,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:02,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-14 22:08:02,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:02,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:08:02,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-14 22:08:02,707 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:08:02,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:08:02,728 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:08:02,744 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,756 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-10-14 22:08:02,809 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 98 [2019-10-14 22:08:02,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:02,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-14 22:08:02,857 INFO L567 ElimStorePlain]: treesize reduction 220, result has 23.1 percent of original size [2019-10-14 22:08:02,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 44 [2019-10-14 22:08:02,869 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:38 [2019-10-14 22:08:02,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:02,981 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:02,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-10-14 22:08:02,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005061219] [2019-10-14 22:08:02,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 22:08:02,982 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:02,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 22:08:02,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-10-14 22:08:02,983 INFO L87 Difference]: Start difference. First operand 152 states and 191 transitions. Second operand 14 states. [2019-10-14 22:08:03,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:03,947 INFO L93 Difference]: Finished difference Result 202 states and 250 transitions. [2019-10-14 22:08:03,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 22:08:03,948 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-10-14 22:08:03,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:03,950 INFO L225 Difference]: With dead ends: 202 [2019-10-14 22:08:03,950 INFO L226 Difference]: Without dead ends: 166 [2019-10-14 22:08:03,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-10-14 22:08:03,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-14 22:08:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 155. [2019-10-14 22:08:03,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-14 22:08:03,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 194 transitions. [2019-10-14 22:08:03,964 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 194 transitions. Word has length 31 [2019-10-14 22:08:03,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:03,965 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 194 transitions. [2019-10-14 22:08:03,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 22:08:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 194 transitions. [2019-10-14 22:08:03,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 22:08:03,966 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:03,966 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:04,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:04,176 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:04,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1484298053, now seen corresponding path program 1 times [2019-10-14 22:08:04,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:04,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303278359] [2019-10-14 22:08:04,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:04,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:04,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 22:08:04,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303278359] [2019-10-14 22:08:04,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:04,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:08:04,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439308153] [2019-10-14 22:08:04,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:08:04,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:04,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:08:04,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:08:04,250 INFO L87 Difference]: Start difference. First operand 155 states and 194 transitions. Second operand 6 states. [2019-10-14 22:08:04,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:04,411 INFO L93 Difference]: Finished difference Result 173 states and 215 transitions. [2019-10-14 22:08:04,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 22:08:04,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-10-14 22:08:04,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:04,414 INFO L225 Difference]: With dead ends: 173 [2019-10-14 22:08:04,414 INFO L226 Difference]: Without dead ends: 171 [2019-10-14 22:08:04,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:08:04,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-14 22:08:04,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 163. [2019-10-14 22:08:04,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-14 22:08:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 204 transitions. [2019-10-14 22:08:04,428 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 204 transitions. Word has length 32 [2019-10-14 22:08:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:04,428 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 204 transitions. [2019-10-14 22:08:04,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:08:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 204 transitions. [2019-10-14 22:08:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 22:08:04,429 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:04,429 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:04,429 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:04,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:04,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1427039751, now seen corresponding path program 1 times [2019-10-14 22:08:04,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:04,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335336132] [2019-10-14 22:08:04,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:04,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:04,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 22:08:04,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335336132] [2019-10-14 22:08:04,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:04,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 22:08:04,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509237508] [2019-10-14 22:08:04,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 22:08:04,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:04,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 22:08:04,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:08:04,503 INFO L87 Difference]: Start difference. First operand 163 states and 204 transitions. Second operand 8 states. [2019-10-14 22:08:04,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:04,769 INFO L93 Difference]: Finished difference Result 222 states and 268 transitions. [2019-10-14 22:08:04,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:08:04,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-10-14 22:08:04,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:04,771 INFO L225 Difference]: With dead ends: 222 [2019-10-14 22:08:04,771 INFO L226 Difference]: Without dead ends: 184 [2019-10-14 22:08:04,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-10-14 22:08:04,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-14 22:08:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 161. [2019-10-14 22:08:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-14 22:08:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 199 transitions. [2019-10-14 22:08:04,787 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 199 transitions. Word has length 32 [2019-10-14 22:08:04,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:04,787 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 199 transitions. [2019-10-14 22:08:04,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 22:08:04,788 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2019-10-14 22:08:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 22:08:04,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:04,789 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:04,789 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:04,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:04,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1652849204, now seen corresponding path program 2 times [2019-10-14 22:08:04,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:04,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400039856] [2019-10-14 22:08:04,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:04,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:04,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:05,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400039856] [2019-10-14 22:08:05,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162429725] [2019-10-14 22:08:05,293 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:05,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:08:05,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:08:05,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-14 22:08:05,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:05,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:08:05,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:08:05,476 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:08:05,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,525 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-10-14 22:08:05,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:08:05,532 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:08:05,556 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,574 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-10-14 22:08:05,620 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_58|], 6=[|v_#memory_$Pointer$.offset_46|, |v_#memory_$Pointer$.base_50|]} [2019-10-14 22:08:05,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:08:05,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:05,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 22:08:05,673 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:05,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 22:08:05,707 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,728 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:97, output treesize:55 [2019-10-14 22:08:05,833 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-14 22:08:05,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,031 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-10-14 22:08:06,032 INFO L567 ElimStorePlain]: treesize reduction 40, result has 85.8 percent of original size [2019-10-14 22:08:06,034 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_59|, |v_#memory_int_56|], 10=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_51|]} [2019-10-14 22:08:06,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:06,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2019-10-14 22:08:06,049 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2019-10-14 22:08:06,108 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 99 [2019-10-14 22:08:06,156 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,283 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 153 [2019-10-14 22:08:06,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:06,286 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,376 INFO L567 ElimStorePlain]: treesize reduction 96, result has 52.0 percent of original size [2019-10-14 22:08:06,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,377 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:236, output treesize:89 [2019-10-14 22:08:06,444 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_60|], 6=[|v_#memory_$Pointer$.offset_48|], 12=[|v_#memory_$Pointer$.base_52|]} [2019-10-14 22:08:06,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-10-14 22:08:06,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:06,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 42 [2019-10-14 22:08:06,506 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:06,599 INFO L341 Elim1Store]: treesize reduction 32, result has 64.4 percent of original size [2019-10-14 22:08:06,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 107 [2019-10-14 22:08:06,601 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,657 INFO L567 ElimStorePlain]: treesize reduction 62, result has 61.3 percent of original size [2019-10-14 22:08:06,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,658 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:140, output treesize:98 [2019-10-14 22:08:06,762 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2019-10-14 22:08:06,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,870 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-10-14 22:08:06,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,872 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_57|], 6=[|v_#memory_int_61|], 10=[|v_#memory_$Pointer$.offset_49|], 18=[|v_#memory_$Pointer$.base_53|]} [2019-10-14 22:08:06,876 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:06,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:06,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 64 [2019-10-14 22:08:06,979 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:07,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:07,099 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:07,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 298 treesize of output 255 [2019-10-14 22:08:07,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,104 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:07,283 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 59 [2019-10-14 22:08:07,283 INFO L567 ElimStorePlain]: treesize reduction 377, result has 40.3 percent of original size [2019-10-14 22:08:07,456 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-10-14 22:08:07,456 INFO L341 Elim1Store]: treesize reduction 35, result has 82.5 percent of original size [2019-10-14 22:08:07,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 239 treesize of output 237 [2019-10-14 22:08:07,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,499 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:07,611 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-10-14 22:08:07,611 INFO L567 ElimStorePlain]: treesize reduction 163, result has 41.6 percent of original size [2019-10-14 22:08:07,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:07,613 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:376, output treesize:147 [2019-10-14 22:08:07,699 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_62|, |v_#memory_$Pointer$.offset_50|], 20=[|v_#memory_$Pointer$.base_54|]} [2019-10-14 22:08:07,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 70 [2019-10-14 22:08:07,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:07,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:07,831 INFO L341 Elim1Store]: treesize reduction 50, result has 55.0 percent of original size [2019-10-14 22:08:07,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 356 treesize of output 319 [2019-10-14 22:08:07,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:07,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:07,838 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-10-14 22:08:07,978 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-10-14 22:08:07,978 INFO L567 ElimStorePlain]: treesize reduction 614, result has 32.9 percent of original size [2019-10-14 22:08:08,175 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2019-10-14 22:08:08,175 INFO L341 Elim1Store]: treesize reduction 66, result has 74.3 percent of original size [2019-10-14 22:08:08,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, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 297 treesize of output 280 [2019-10-14 22:08:08,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:08,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:08,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:08,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:08,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:08,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:08,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:08,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:08,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:08,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:08,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:08,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,268 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 15 xjuncts. [2019-10-14 22:08:08,530 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2019-10-14 22:08:08,530 INFO L567 ElimStorePlain]: treesize reduction 9658, result has 2.4 percent of original size [2019-10-14 22:08:08,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:08,532 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:387, output treesize:233 [2019-10-14 22:08:08,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,654 INFO L392 ElimStorePlain]: Different costs {12=[|#memory_int|], 20=[|#memory_$Pointer$.base|]} [2019-10-14 22:08:08,675 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:08,676 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:08,685 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:08,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 180 [2019-10-14 22:08:08,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,692 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:08,693 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:08,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 1 [2019-10-14 22:08:08,696 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,761 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 167 treesize of output 128 [2019-10-14 22:08:08,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,782 INFO L496 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:08,912 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 26 [2019-10-14 22:08:08,913 INFO L567 ElimStorePlain]: treesize reduction 84, result has 30.0 percent of original size [2019-10-14 22:08:08,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:08,914 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:505, output treesize:16 [2019-10-14 22:08:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:08,952 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:08,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2019-10-14 22:08:08,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687834367] [2019-10-14 22:08:08,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 22:08:08,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:08,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 22:08:08,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=393, Unknown=2, NotChecked=0, Total=462 [2019-10-14 22:08:08,953 INFO L87 Difference]: Start difference. First operand 161 states and 199 transitions. Second operand 22 states. [2019-10-14 22:08:11,369 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2019-10-14 22:08:11,583 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-14 22:08:11,882 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 112 [2019-10-14 22:08:12,051 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-14 22:08:12,367 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 111 [2019-10-14 22:08:12,640 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 104 [2019-10-14 22:08:13,210 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 106 [2019-10-14 22:08:14,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:14,049 INFO L93 Difference]: Finished difference Result 350 states and 421 transitions. [2019-10-14 22:08:14,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-14 22:08:14,049 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2019-10-14 22:08:14,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:14,052 INFO L225 Difference]: With dead ends: 350 [2019-10-14 22:08:14,052 INFO L226 Difference]: Without dead ends: 302 [2019-10-14 22:08:14,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=436, Invalid=2318, Unknown=2, NotChecked=0, Total=2756 [2019-10-14 22:08:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-14 22:08:14,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 187. [2019-10-14 22:08:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-14 22:08:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 237 transitions. [2019-10-14 22:08:14,071 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 237 transitions. Word has length 33 [2019-10-14 22:08:14,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:14,072 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 237 transitions. [2019-10-14 22:08:14,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 22:08:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 237 transitions. [2019-10-14 22:08:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 22:08:14,072 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:14,072 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:14,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:14,274 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:14,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:14,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1263003227, now seen corresponding path program 1 times [2019-10-14 22:08:14,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:14,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129612422] [2019-10-14 22:08:14,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:14,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:14,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:14,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129612422] [2019-10-14 22:08:14,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243184994] [2019-10-14 22:08:14,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:14,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-14 22:08:14,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:14,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:08:14,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:14,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:14,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:14,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:08:14,834 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:14,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:08:14,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:14,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:14,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:08:14,853 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:14,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:14,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:14,866 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:25 [2019-10-14 22:08:14,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:14,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 22:08:14,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:14,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:14,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:14,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-14 22:08:14,964 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:14,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 60 [2019-10-14 22:08:14,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:15,000 INFO L567 ElimStorePlain]: treesize reduction 32, result has 50.0 percent of original size [2019-10-14 22:08:15,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:15,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:32 [2019-10-14 22:08:15,053 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:15,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 47 [2019-10-14 22:08:15,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:15,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:15,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:15,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2019-10-14 22:08:15,261 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 1=[|#memory_$Pointer$.offset|]} [2019-10-14 22:08:15,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-10-14 22:08:15,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:15,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:15,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-10-14 22:08:15,279 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:15,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:15,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:15,287 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:11 [2019-10-14 22:08:15,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:08:15,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:15,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:15,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:15,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-14 22:08:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:15,349 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:15,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2019-10-14 22:08:15,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356327379] [2019-10-14 22:08:15,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 22:08:15,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:15,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 22:08:15,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-10-14 22:08:15,350 INFO L87 Difference]: Start difference. First operand 187 states and 237 transitions. Second operand 21 states. [2019-10-14 22:08:15,948 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-10-14 22:08:16,183 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-14 22:08:16,438 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53