java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 22:06:56,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 22:06:56,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 22:06:56,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 22:06:56,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 22:06:56,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 22:06:56,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 22:06:56,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 22:06:56,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 22:06:56,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 22:06:56,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 22:06:56,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 22:06:56,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 22:06:56,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 22:06:56,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 22:06:56,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 22:06:56,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 22:06:56,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 22:06:56,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 22:06:56,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 22:06:56,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 22:06:56,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 22:06:56,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 22:06:56,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 22:06:56,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 22:06:56,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 22:06:56,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 22:06:56,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 22:06:56,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 22:06:56,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 22:06:56,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 22:06:56,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 22:06:56,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 22:06:56,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 22:06:56,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 22:06:56,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 22:06:56,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 22:06:56,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 22:06:56,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 22:06:56,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 22:06:56,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 22:06:56,254 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 22:06:56,268 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 22:06:56,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 22:06:56,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 22:06:56,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 22:06:56,270 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 22:06:56,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 22:06:56,270 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 22:06:56,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 22:06:56,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 22:06:56,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 22:06:56,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 22:06:56,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 22:06:56,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 22:06:56,272 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 22:06:56,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 22:06:56,272 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 22:06:56,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 22:06:56,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 22:06:56,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 22:06:56,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 22:06:56,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 22:06:56,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:06:56,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 22:06:56,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 22:06:56,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 22:06:56,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 22:06:56,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 22:06:56,275 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 22:06:56,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 22:06:56,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 22:06:56,579 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 22:06:56,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 22:06:56,585 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 22:06:56,585 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 22:06:56,586 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue-2.i [2019-10-14 22:06:56,657 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/249648dc4/8d07936ae8854dd280f74b564f06c71f/FLAG16804767c [2019-10-14 22:06:57,206 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 22:06:57,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-simple-white-blue-2.i [2019-10-14 22:06:57,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/249648dc4/8d07936ae8854dd280f74b564f06c71f/FLAG16804767c [2019-10-14 22:06:57,483 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/249648dc4/8d07936ae8854dd280f74b564f06c71f [2019-10-14 22:06:57,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 22:06:57,493 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 22:06:57,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 22:06:57,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 22:06:57,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 22:06:57,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:06:57" (1/1) ... [2019-10-14 22:06:57,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11aa4f2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:57, skipping insertion in model container [2019-10-14 22:06:57,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:06:57" (1/1) ... [2019-10-14 22:06:57,513 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 22:06:57,556 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 22:06:58,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:06:58,024 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 22:06:58,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:06:58,122 INFO L192 MainTranslator]: Completed translation [2019-10-14 22:06:58,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:58 WrapperNode [2019-10-14 22:06:58,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 22:06:58,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 22:06:58,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 22:06:58,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 22:06:58,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:58" (1/1) ... [2019-10-14 22:06:58,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:58" (1/1) ... [2019-10-14 22:06:58,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:58" (1/1) ... [2019-10-14 22:06:58,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:58" (1/1) ... [2019-10-14 22:06:58,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:58" (1/1) ... [2019-10-14 22:06:58,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:58" (1/1) ... [2019-10-14 22:06:58,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:58" (1/1) ... [2019-10-14 22:06:58,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 22:06:58,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 22:06:58,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 22:06:58,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 22:06:58,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:06:58,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 22:06:58,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 22:06:58,268 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 22:06:58,268 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 22:06:58,268 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 22:06:58,268 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 22:06:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 22:06:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 22:06:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 22:06:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 22:06:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 22:06:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 22:06:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 22:06:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 22:06:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 22:06:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 22:06:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 22:06:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 22:06:58,271 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 22:06:58,271 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 22:06:58,271 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 22:06:58,271 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 22:06:58,271 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 22:06:58,271 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 22:06:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 22:06:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 22:06:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 22:06:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 22:06:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 22:06:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 22:06:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 22:06:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 22:06:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 22:06:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 22:06:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 22:06:58,274 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 22:06:58,274 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 22:06:58,274 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 22:06:58,274 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 22:06:58,274 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 22:06:58,274 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 22:06:58,274 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 22:06:58,275 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 22:06:58,275 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 22:06:58,275 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 22:06:58,275 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 22:06:58,275 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 22:06:58,275 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 22:06:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 22:06:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 22:06:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 22:06:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 22:06:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 22:06:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 22:06:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 22:06:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 22:06:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 22:06:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 22:06:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 22:06:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 22:06:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 22:06:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 22:06:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 22:06:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 22:06:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 22:06:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 22:06:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 22:06:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 22:06:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 22:06:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 22:06:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 22:06:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 22:06:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 22:06:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 22:06:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 22:06:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 22:06:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 22:06:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 22:06:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 22:06:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 22:06:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 22:06:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 22:06:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 22:06:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 22:06:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 22:06:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 22:06:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 22:06:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 22:06:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 22:06:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 22:06:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 22:06:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 22:06:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 22:06:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 22:06:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 22:06:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 22:06:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 22:06:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 22:06:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 22:06:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 22:06:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 22:06:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 22:06:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 22:06:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 22:06:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 22:06:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 22:06:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 22:06:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 22:06:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 22:06:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 22:06:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 22:06:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 22:06:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 22:06:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 22:06:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 22:06:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 22:06:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 22:06:58,906 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 22:06:58,907 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-14 22:06:58,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:06:58 BoogieIcfgContainer [2019-10-14 22:06:58,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 22:06:58,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 22:06:58,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 22:06:58,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 22:06:58,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:06:57" (1/3) ... [2019-10-14 22:06:58,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615323da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:06:58, skipping insertion in model container [2019-10-14 22:06:58,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:06:58" (2/3) ... [2019-10-14 22:06:58,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615323da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:06:58, skipping insertion in model container [2019-10-14 22:06:58,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:06:58" (3/3) ... [2019-10-14 22:06:58,917 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-2.i [2019-10-14 22:06:58,928 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 22:06:58,936 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 22:06:58,949 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 22:06:58,973 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 22:06:58,973 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 22:06:58,973 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 22:06:58,973 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 22:06:58,974 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 22:06:58,974 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 22:06:58,974 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 22:06:58,974 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 22:06:58,991 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-14 22:06:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 22:06:58,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:59,000 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:59,003 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:59,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:59,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1881548223, now seen corresponding path program 1 times [2019-10-14 22:06:59,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:59,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215284374] [2019-10-14 22:06:59,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:59,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:59,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:59,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215284374] [2019-10-14 22:06:59,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:59,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 22:06:59,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445804690] [2019-10-14 22:06:59,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 22:06:59,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:59,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 22:06:59,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:06:59,235 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-10-14 22:06:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:06:59,379 INFO L93 Difference]: Finished difference Result 55 states and 84 transitions. [2019-10-14 22:06:59,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 22:06:59,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-14 22:06:59,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:06:59,394 INFO L225 Difference]: With dead ends: 55 [2019-10-14 22:06:59,394 INFO L226 Difference]: Without dead ends: 24 [2019-10-14 22:06:59,398 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:06:59,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-14 22:06:59,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-14 22:06:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-14 22:06:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-10-14 22:06:59,441 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2019-10-14 22:06:59,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:06:59,441 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-10-14 22:06:59,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 22:06:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-10-14 22:06:59,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 22:06:59,462 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:06:59,462 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:06:59,463 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:06:59,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:06:59,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1899192242, now seen corresponding path program 1 times [2019-10-14 22:06:59,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:06:59,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938378418] [2019-10-14 22:06:59,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:59,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:06:59,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:06:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:06:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:06:59,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938378418] [2019-10-14 22:06:59,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:06:59,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 22:06:59,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297895804] [2019-10-14 22:06:59,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 22:06:59,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:06:59,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 22:06:59,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:06:59,802 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 8 states. [2019-10-14 22:07:00,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:00,174 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2019-10-14 22:07:00,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 22:07:00,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-10-14 22:07:00,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:00,178 INFO L225 Difference]: With dead ends: 48 [2019-10-14 22:07:00,178 INFO L226 Difference]: Without dead ends: 46 [2019-10-14 22:07:00,179 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-10-14 22:07:00,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-14 22:07:00,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 30. [2019-10-14 22:07:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 22:07:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-10-14 22:07:00,189 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 17 [2019-10-14 22:07:00,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:00,190 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-10-14 22:07:00,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 22:07:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-10-14 22:07:00,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 22:07:00,191 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:00,192 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:00,192 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:00,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:00,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1740484627, now seen corresponding path program 1 times [2019-10-14 22:07:00,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:00,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081402176] [2019-10-14 22:07:00,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:00,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:00,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:00,363 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:00,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081402176] [2019-10-14 22:07:00,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673599287] [2019-10-14 22:07:00,364 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:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:00,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-14 22:07:00,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:00,554 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:00,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:00,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:00,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:00,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:00,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:00,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-14 22:07:00,597 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:00,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:00,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:00,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:00,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:00,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-14 22:07:00,630 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:00,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:00,644 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:00,645 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:41 [2019-10-14 22:07:00,704 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:00,705 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:00,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:00,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:00,804 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:00,805 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:00,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:00,854 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:00,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:00,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:00,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:00,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:00,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2019-10-14 22:07:00,895 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:00,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:00,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:00,956 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 31 treesize of output 37 [2019-10-14 22:07:00,957 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:00,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:00,981 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:00,982 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:109, output treesize:78 [2019-10-14 22:07:01,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:01,197 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:01,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 92 treesize of output 134 [2019-10-14 22:07:01,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:01,218 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:01,267 INFO L567 ElimStorePlain]: treesize reduction 58, result has 45.8 percent of original size [2019-10-14 22:07:01,290 INFO L341 Elim1Store]: treesize reduction 10, result has 63.0 percent of original size [2019-10-14 22:07:01,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 35 [2019-10-14 22:07:01,292 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:01,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:01,299 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:01,299 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:108, output treesize:7 [2019-10-14 22:07:01,304 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:01,305 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:01,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-10-14 22:07:01,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423098329] [2019-10-14 22:07:01,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 22:07:01,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:01,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 22:07:01,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-14 22:07:01,308 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 12 states. [2019-10-14 22:07:02,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:02,307 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2019-10-14 22:07:02,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 22:07:02,307 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-10-14 22:07:02,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:02,309 INFO L225 Difference]: With dead ends: 108 [2019-10-14 22:07:02,310 INFO L226 Difference]: Without dead ends: 93 [2019-10-14 22:07:02,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-10-14 22:07:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-14 22:07:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 48. [2019-10-14 22:07:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-14 22:07:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2019-10-14 22:07:02,322 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 19 [2019-10-14 22:07:02,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:02,322 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2019-10-14 22:07:02,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 22:07:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2019-10-14 22:07:02,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 22:07:02,323 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:02,323 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:02,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:02,536 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:02,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:02,537 INFO L82 PathProgramCache]: Analyzing trace with hash -928390504, now seen corresponding path program 2 times [2019-10-14 22:07:02,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:02,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770469186] [2019-10-14 22:07:02,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:02,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:02,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 22:07:02,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770469186] [2019-10-14 22:07:02,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:02,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 22:07:02,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130966289] [2019-10-14 22:07:02,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 22:07:02,674 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:02,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 22:07:02,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:07:02,675 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand 7 states. [2019-10-14 22:07:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:02,866 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2019-10-14 22:07:02,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:07:02,867 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-10-14 22:07:02,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:02,868 INFO L225 Difference]: With dead ends: 63 [2019-10-14 22:07:02,869 INFO L226 Difference]: Without dead ends: 50 [2019-10-14 22:07:02,869 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:07:02,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-14 22:07:02,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-10-14 22:07:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-14 22:07:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2019-10-14 22:07:02,877 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 21 [2019-10-14 22:07:02,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:02,877 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2019-10-14 22:07:02,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 22:07:02,877 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2019-10-14 22:07:02,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 22:07:02,878 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:02,878 INFO L380 BasicCegarLoop]: trace histogram [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:02,879 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:02,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:02,879 INFO L82 PathProgramCache]: Analyzing trace with hash 507319878, now seen corresponding path program 1 times [2019-10-14 22:07:02,879 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:02,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355373212] [2019-10-14 22:07:02,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:02,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:02,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:02,975 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:02,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355373212] [2019-10-14 22:07:02,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:02,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:07:02,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515856382] [2019-10-14 22:07:02,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:07:02,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:02,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:07:02,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:07:02,976 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 6 states. [2019-10-14 22:07:03,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:03,194 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-10-14 22:07:03,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:07:03,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-14 22:07:03,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:03,195 INFO L225 Difference]: With dead ends: 75 [2019-10-14 22:07:03,196 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 22:07:03,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:07:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 22:07:03,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2019-10-14 22:07:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-14 22:07:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2019-10-14 22:07:03,204 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 21 [2019-10-14 22:07:03,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:03,205 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2019-10-14 22:07:03,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:07:03,205 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2019-10-14 22:07:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 22:07:03,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:03,206 INFO L380 BasicCegarLoop]: trace histogram [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:03,206 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:03,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:03,206 INFO L82 PathProgramCache]: Analyzing trace with hash -302026748, now seen corresponding path program 1 times [2019-10-14 22:07:03,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:03,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545064837] [2019-10-14 22:07:03,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:03,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:03,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:03,300 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:03,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545064837] [2019-10-14 22:07:03,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:03,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 22:07:03,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588457079] [2019-10-14 22:07:03,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 22:07:03,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:03,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 22:07:03,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:07:03,302 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 9 states. [2019-10-14 22:07:03,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:03,634 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2019-10-14 22:07:03,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 22:07:03,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-10-14 22:07:03,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:03,636 INFO L225 Difference]: With dead ends: 92 [2019-10-14 22:07:03,636 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 22:07:03,637 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-14 22:07:03,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 22:07:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2019-10-14 22:07:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-14 22:07:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2019-10-14 22:07:03,644 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 21 [2019-10-14 22:07:03,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:03,645 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2019-10-14 22:07:03,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 22:07:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2019-10-14 22:07:03,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 22:07:03,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:03,646 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:03,646 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:03,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:03,646 INFO L82 PathProgramCache]: Analyzing trace with hash 699636199, now seen corresponding path program 1 times [2019-10-14 22:07:03,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:03,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689599384] [2019-10-14 22:07:03,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:03,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:03,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:03,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689599384] [2019-10-14 22:07:03,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366005473] [2019-10-14 22:07:03,860 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:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:03,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-14 22:07:03,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:03,993 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:03,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:04,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:04,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:04,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:04,051 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:04,051 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:04,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:04,232 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-10-14 22:07:04,232 INFO L567 ElimStorePlain]: treesize reduction 14, result has 98.3 percent of original size [2019-10-14 22:07:04,237 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|], 2=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_35|], 8=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_37|]} [2019-10-14 22:07:04,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:04,256 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 188 treesize of output 65 [2019-10-14 22:07:04,256 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:04,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:04,335 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:04,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:04,399 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:04,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:04,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:04,508 INFO L341 Elim1Store]: treesize reduction 268, result has 30.4 percent of original size [2019-10-14 22:07:04,508 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 2 case distinctions, treesize of input 220 treesize of output 287 [2019-10-14 22:07:04,509 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:04,590 INFO L567 ElimStorePlain]: treesize reduction 72, result has 76.3 percent of original size [2019-10-14 22:07:04,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:04,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2019-10-14 22:07:04,598 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:04,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:04,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:04,633 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:812, output treesize:88 [2019-10-14 22:07:04,719 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:04,720 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:04,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:04,851 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-10-14 22:07:04,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:04,855 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_33|], 4=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_36|, |v_#memory_int_34|], 7=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_38|]} [2019-10-14 22:07:04,860 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:04,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:04,966 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:05,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:05,045 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:05,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:05,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:05,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:05,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:05,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2019-10-14 22:07:05,131 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:05,230 INFO L567 ElimStorePlain]: treesize reduction 8, result has 94.4 percent of original size [2019-10-14 22:07:05,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:05,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:05,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:05,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:05,267 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:05,298 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:05,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 121 [2019-10-14 22:07:05,302 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:05,405 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-10-14 22:07:05,406 INFO L567 ElimStorePlain]: treesize reduction 76, result has 64.2 percent of original size [2019-10-14 22:07:05,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:05,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:05,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:05,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:05,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:05,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 64 [2019-10-14 22:07:05,421 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:05,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:05,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:05,468 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:202, output treesize:144 [2019-10-14 22:07:05,755 INFO L341 Elim1Store]: treesize reduction 16, result has 69.2 percent of original size [2019-10-14 22:07:05,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 162 treesize of output 111 [2019-10-14 22:07:05,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:05,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:05,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:05,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:05,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:05,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:05,763 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:05,822 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.7 percent of original size [2019-10-14 22:07:05,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:05,872 INFO L341 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-10-14 22:07:05,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 60 [2019-10-14 22:07:05,874 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:05,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:05,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:05,886 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:183, output treesize:30 [2019-10-14 22:07:05,933 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:05,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 30 [2019-10-14 22:07:05,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:05,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:05,950 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-10-14 22:07:05,950 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:05,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-10-14 22:07:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:05,975 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:05,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-10-14 22:07:05,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798420615] [2019-10-14 22:07:05,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 22:07:05,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:05,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 22:07:05,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-14 22:07:05,977 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 18 states. [2019-10-14 22:07:06,491 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-10-14 22:07:07,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:07,800 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2019-10-14 22:07:07,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-14 22:07:07,801 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-10-14 22:07:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:07,802 INFO L225 Difference]: With dead ends: 126 [2019-10-14 22:07:07,802 INFO L226 Difference]: Without dead ends: 124 [2019-10-14 22:07:07,803 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2019-10-14 22:07:07,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-14 22:07:07,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 61. [2019-10-14 22:07:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-14 22:07:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-10-14 22:07:07,814 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 22 [2019-10-14 22:07:07,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:07,815 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-10-14 22:07:07,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 22:07:07,815 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-10-14 22:07:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 22:07:07,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:07,816 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:08,020 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:08,020 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:08,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:08,021 INFO L82 PathProgramCache]: Analyzing trace with hash -981767607, now seen corresponding path program 1 times [2019-10-14 22:07:08,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:08,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138679805] [2019-10-14 22:07:08,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:08,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:08,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:08,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138679805] [2019-10-14 22:07:08,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:08,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 22:07:08,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041059403] [2019-10-14 22:07:08,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 22:07:08,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:08,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 22:07:08,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:07:08,175 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states. [2019-10-14 22:07:08,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:08,451 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2019-10-14 22:07:08,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 22:07:08,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-10-14 22:07:08,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:08,453 INFO L225 Difference]: With dead ends: 85 [2019-10-14 22:07:08,453 INFO L226 Difference]: Without dead ends: 68 [2019-10-14 22:07:08,454 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-14 22:07:08,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-14 22:07:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2019-10-14 22:07:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-14 22:07:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2019-10-14 22:07:08,464 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 23 [2019-10-14 22:07:08,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:08,464 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2019-10-14 22:07:08,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 22:07:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2019-10-14 22:07:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 22:07:08,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:08,466 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] [2019-10-14 22:07:08,466 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:08,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:08,466 INFO L82 PathProgramCache]: Analyzing trace with hash -762999237, now seen corresponding path program 1 times [2019-10-14 22:07:08,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:08,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83873445] [2019-10-14 22:07:08,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:08,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:08,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:08,771 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:08,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83873445] [2019-10-14 22:07:08,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062495126] [2019-10-14 22:07:08,777 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:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:08,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-14 22:07:08,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:08,918 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:08,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:08,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:08,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:08,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-14 22:07:08,986 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:08,987 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:08,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:09,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,047 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_35|], 2=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_39|], 8=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|]} [2019-10-14 22:07:09,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:09,073 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 188 treesize of output 65 [2019-10-14 22:07:09,073 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:09,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,130 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:09,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,170 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:09,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:09,254 INFO L341 Elim1Store]: treesize reduction 268, result has 30.4 percent of original size [2019-10-14 22:07:09,254 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 2 case distinctions, treesize of input 220 treesize of output 287 [2019-10-14 22:07:09,255 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:09,311 INFO L567 ElimStorePlain]: treesize reduction 72, result has 75.3 percent of original size [2019-10-14 22:07:09,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:09,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2019-10-14 22:07:09,322 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:09,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:09,345 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:803, output treesize:71 [2019-10-14 22:07:09,426 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_40|, |v_#memory_$Pointer$.offset_40|], 2=[|v_#memory_int_38|], 4=[|v_#memory_int_36|], 10=[|v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_42|]} [2019-10-14 22:07:09,431 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 11 treesize of output 7 [2019-10-14 22:07:09,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:09,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:09,488 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:09,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,549 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 27 treesize of output 15 [2019-10-14 22:07:09,550 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:09,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:09,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-10-14 22:07:09,597 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:09,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,672 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 62 [2019-10-14 22:07:09,674 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:09,725 INFO L567 ElimStorePlain]: treesize reduction 24, result has 74.2 percent of original size [2019-10-14 22:07:09,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-14 22:07:09,732 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:09,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:09,764 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:148, output treesize:44 [2019-10-14 22:07:09,810 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_37|], 6=[|v_#memory_int_39|], 9=[|v_#memory_$Pointer$.offset_43|, |v_#memory_$Pointer$.base_43|]} [2019-10-14 22:07:09,813 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:09,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:09,883 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 68 treesize of output 36 [2019-10-14 22:07:09,884 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:09,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:09,922 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 63 treesize of output 31 [2019-10-14 22:07:09,923 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:09,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:09,991 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:09,992 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 3 case distinctions, treesize of input 86 treesize of output 111 [2019-10-14 22:07:09,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:09,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:09,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:09,996 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-10-14 22:07:10,067 INFO L567 ElimStorePlain]: treesize reduction 173, result has 28.2 percent of original size [2019-10-14 22:07:10,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:10,068 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:192, output treesize:58 [2019-10-14 22:07:10,162 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:10,162 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 49 treesize of output 40 [2019-10-14 22:07:10,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:10,189 INFO L567 ElimStorePlain]: treesize reduction 12, result has 77.8 percent of original size [2019-10-14 22:07:10,193 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 22 treesize of output 10 [2019-10-14 22:07:10,193 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:10,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:10,202 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:07:10,203 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:24 [2019-10-14 22:07:10,241 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:10,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:10,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:10,247 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:10,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-10-14 22:07:10,278 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:10,280 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:10,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-10-14 22:07:10,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763388510] [2019-10-14 22:07:10,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 22:07:10,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:10,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 22:07:10,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-10-14 22:07:10,283 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 19 states. [2019-10-14 22:07:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:11,584 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2019-10-14 22:07:11,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 22:07:11,584 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-10-14 22:07:11,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:11,586 INFO L225 Difference]: With dead ends: 90 [2019-10-14 22:07:11,586 INFO L226 Difference]: Without dead ends: 88 [2019-10-14 22:07:11,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2019-10-14 22:07:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-14 22:07:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 61. [2019-10-14 22:07:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-14 22:07:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2019-10-14 22:07:11,599 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 24 [2019-10-14 22:07:11,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:11,599 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2019-10-14 22:07:11,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 22:07:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2019-10-14 22:07:11,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 22:07:11,601 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:11,601 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:11,808 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:11,809 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:11,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:11,810 INFO L82 PathProgramCache]: Analyzing trace with hash -596219703, now seen corresponding path program 2 times [2019-10-14 22:07:11,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:11,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869153596] [2019-10-14 22:07:11,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:11,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:11,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:11,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869153596] [2019-10-14 22:07:11,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569638650] [2019-10-14 22:07:11,997 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:12,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:07:12,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:12,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-14 22:07:12,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:12,254 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:12,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:12,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:12,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:12,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:12,383 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:12,383 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:12,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:12,613 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-14 22:07:12,613 INFO L567 ElimStorePlain]: treesize reduction 14, result has 97.8 percent of original size [2019-10-14 22:07:12,615 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.base_44|], 8=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_46|]} [2019-10-14 22:07:12,619 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:12,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:12,675 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:12,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:12,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:12,776 INFO L341 Elim1Store]: treesize reduction 268, result has 30.4 percent of original size [2019-10-14 22:07:12,777 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 2 case distinctions, treesize of input 183 treesize of output 250 [2019-10-14 22:07:12,777 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:12,857 INFO L567 ElimStorePlain]: treesize reduction 72, result has 73.0 percent of original size [2019-10-14 22:07:12,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:12,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2019-10-14 22:07:12,864 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:12,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:12,897 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:12,898 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:624, output treesize:77 [2019-10-14 22:07:12,965 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:12,965 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:12,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,028 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_45|], 7=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_47|]} [2019-10-14 22:07:13,031 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:13,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,081 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:13,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,127 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:13,154 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 118 [2019-10-14 22:07:13,157 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,238 INFO L567 ElimStorePlain]: treesize reduction 76, result has 60.6 percent of original size [2019-10-14 22:07:13,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:13,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 64 [2019-10-14 22:07:13,253 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,290 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:13,290 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:152, output treesize:132 [2019-10-14 22:07:13,687 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-10-14 22:07:13,688 INFO L341 Elim1Store]: treesize reduction 16, result has 87.5 percent of original size [2019-10-14 22:07:13,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 173 treesize of output 188 [2019-10-14 22:07:13,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:13,867 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:13,921 INFO L567 ElimStorePlain]: treesize reduction 133, result has 33.2 percent of original size [2019-10-14 22:07:13,936 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 49 [2019-10-14 22:07:13,937 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:13,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:13,946 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:187, output treesize:7 [2019-10-14 22:07:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:13,953 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:13,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-10-14 22:07:13,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000477926] [2019-10-14 22:07:13,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 22:07:13,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:13,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 22:07:13,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-10-14 22:07:13,955 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 16 states. [2019-10-14 22:07:14,887 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-10-14 22:07:16,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:16,250 INFO L93 Difference]: Finished difference Result 125 states and 150 transitions. [2019-10-14 22:07:16,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 22:07:16,250 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-10-14 22:07:16,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:16,252 INFO L225 Difference]: With dead ends: 125 [2019-10-14 22:07:16,252 INFO L226 Difference]: Without dead ends: 100 [2019-10-14 22:07:16,253 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2019-10-14 22:07:16,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-14 22:07:16,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 76. [2019-10-14 22:07:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-14 22:07:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2019-10-14 22:07:16,264 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 25 [2019-10-14 22:07:16,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:16,264 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2019-10-14 22:07:16,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 22:07:16,265 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2019-10-14 22:07:16,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 22:07:16,266 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:16,266 INFO L380 BasicCegarLoop]: trace histogram [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:16,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:16,471 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:16,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:16,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1594698048, now seen corresponding path program 1 times [2019-10-14 22:07:16,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:16,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109579809] [2019-10-14 22:07:16,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:16,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:16,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:16,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109579809] [2019-10-14 22:07:16,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177330160] [2019-10-14 22:07:16,870 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:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:17,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-14 22:07:17,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:17,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:17,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-14 22:07:17,103 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,104 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:17,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,160 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_48|], 8=[|v_#memory_$Pointer$.base_50|, |v_#memory_$Pointer$.offset_50|]} [2019-10-14 22:07:17,164 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:17,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,204 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:17,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:17,284 INFO L341 Elim1Store]: treesize reduction 268, result has 30.4 percent of original size [2019-10-14 22:07:17,284 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 2 case distinctions, treesize of input 183 treesize of output 250 [2019-10-14 22:07:17,285 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,338 INFO L567 ElimStorePlain]: treesize reduction 72, result has 71.7 percent of original size [2019-10-14 22:07:17,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:17,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2019-10-14 22:07:17,345 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,363 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:17,363 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:615, output treesize:60 [2019-10-14 22:07:17,427 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_49|], 26=[|v_#memory_$Pointer$.base_51|, |v_#memory_$Pointer$.offset_51|]} [2019-10-14 22:07:17,429 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:17,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,472 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:17,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:17,682 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-14 22:07:17,683 INFO L341 Elim1Store]: treesize reduction 64, result has 70.8 percent of original size [2019-10-14 22:07:17,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 79 treesize of output 201 [2019-10-14 22:07:17,684 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,791 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-10-14 22:07:17,791 INFO L567 ElimStorePlain]: treesize reduction 140, result has 38.6 percent of original size [2019-10-14 22:07:17,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:17,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2019-10-14 22:07:17,803 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:17,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:17,831 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:146, output treesize:56 [2019-10-14 22:07:17,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:18,024 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-10-14 22:07:18,024 INFO L341 Elim1Store]: treesize reduction 30, result has 76.9 percent of original size [2019-10-14 22:07:18,025 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 6 case distinctions, treesize of input 163 treesize of output 173 [2019-10-14 22:07:18,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:18,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:18,116 INFO L567 ElimStorePlain]: treesize reduction 72, result has 63.3 percent of original size [2019-10-14 22:07:18,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:18,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 48 [2019-10-14 22:07:18,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:18,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:18,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:18,152 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:170, output treesize:78 [2019-10-14 22:07:18,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:18,394 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:18,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 92 treesize of output 134 [2019-10-14 22:07:18,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:18,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:18,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:18,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:18,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:18,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:18,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:18,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:18,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:18,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:18,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:18,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:18,410 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:18,448 INFO L567 ElimStorePlain]: treesize reduction 72, result has 40.5 percent of original size [2019-10-14 22:07:18,468 INFO L341 Elim1Store]: treesize reduction 10, result has 63.0 percent of original size [2019-10-14 22:07:18,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 35 [2019-10-14 22:07:18,470 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:18,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:18,477 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:18,477 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:108, output treesize:7 [2019-10-14 22:07:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:18,518 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:18,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2019-10-14 22:07:18,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984228957] [2019-10-14 22:07:18,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-14 22:07:18,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:18,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-14 22:07:18,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-10-14 22:07:18,522 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 17 states. [2019-10-14 22:07:19,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:19,822 INFO L93 Difference]: Finished difference Result 110 states and 133 transitions. [2019-10-14 22:07:19,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 22:07:19,822 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-10-14 22:07:19,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:19,823 INFO L225 Difference]: With dead ends: 110 [2019-10-14 22:07:19,823 INFO L226 Difference]: Without dead ends: 99 [2019-10-14 22:07:19,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2019-10-14 22:07:19,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-14 22:07:19,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 75. [2019-10-14 22:07:19,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-14 22:07:19,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-10-14 22:07:19,842 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 26 [2019-10-14 22:07:19,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:19,843 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-10-14 22:07:19,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-14 22:07:19,843 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-10-14 22:07:19,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 22:07:19,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:19,847 INFO L380 BasicCegarLoop]: trace histogram [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:20,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:20,057 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:20,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:20,058 INFO L82 PathProgramCache]: Analyzing trace with hash 969578388, now seen corresponding path program 1 times [2019-10-14 22:07:20,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:20,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362928721] [2019-10-14 22:07:20,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:20,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:20,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:20,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362928721] [2019-10-14 22:07:20,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066981603] [2019-10-14 22:07:20,288 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:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:20,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-14 22:07:20,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:20,413 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:20,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:20,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:20,427 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:20,427 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:20,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:20,436 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:20,437 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2019-10-14 22:07:20,495 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:20,495 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:20,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:20,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:20,569 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_44|, |v_#memory_$Pointer$.base_53|, |v_#memory_int_41|], 4=[|v_#memory_int_42|], 8=[|v_#memory_$Pointer$.base_54|]} [2019-10-14 22:07:20,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:20,591 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:20,592 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:20,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:20,645 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:20,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:20,690 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 29 treesize of output 13 [2019-10-14 22:07:20,690 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:20,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:20,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:20,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:20,721 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 120 treesize of output 52 [2019-10-14 22:07:20,721 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:20,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:20,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:20,784 INFO L341 Elim1Store]: treesize reduction 45, result has 51.6 percent of original size [2019-10-14 22:07:20,784 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 2 case distinctions, treesize of input 47 treesize of output 71 [2019-10-14 22:07:20,785 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:20,827 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.0 percent of original size [2019-10-14 22:07:20,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:20,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:20,830 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:396, output treesize:68 [2019-10-14 22:07:20,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:20,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:24,988 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:24,988 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 40 treesize of output 35 [2019-10-14 22:07:24,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:25,004 INFO L567 ElimStorePlain]: treesize reduction 12, result has 65.7 percent of original size [2019-10-14 22:07:25,005 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:25,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:23 [2019-10-14 22:07:25,047 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_int_43|], 6=[|v_#memory_int_45|]} [2019-10-14 22:07:25,049 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:25,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:25,094 INFO L341 Elim1Store]: treesize reduction 69, result has 31.7 percent of original size [2019-10-14 22:07:25,095 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 42 treesize of output 47 [2019-10-14 22:07:25,095 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:25,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:25,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:25,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:25,111 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:45 [2019-10-14 22:07:25,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:25,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:25,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:25,277 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 28 treesize of output 10 [2019-10-14 22:07:25,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:25,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:25,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:25,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-10-14 22:07:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:25,299 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:25,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-10-14 22:07:25,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119932307] [2019-10-14 22:07:25,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 22:07:25,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:25,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 22:07:25,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=259, Unknown=2, NotChecked=0, Total=306 [2019-10-14 22:07:25,301 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 18 states. [2019-10-14 22:07:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:26,683 INFO L93 Difference]: Finished difference Result 122 states and 151 transitions. [2019-10-14 22:07:26,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 22:07:26,683 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-10-14 22:07:26,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:26,685 INFO L225 Difference]: With dead ends: 122 [2019-10-14 22:07:26,686 INFO L226 Difference]: Without dead ends: 116 [2019-10-14 22:07:26,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=151, Invalid=717, Unknown=2, NotChecked=0, Total=870 [2019-10-14 22:07:26,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-14 22:07:26,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 90. [2019-10-14 22:07:26,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-14 22:07:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2019-10-14 22:07:26,698 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 26 [2019-10-14 22:07:26,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:26,698 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2019-10-14 22:07:26,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 22:07:26,698 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2019-10-14 22:07:26,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 22:07:26,699 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:26,700 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:26,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:26,903 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:26,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:26,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2113648800, now seen corresponding path program 2 times [2019-10-14 22:07:26,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:26,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542187380] [2019-10-14 22:07:26,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:26,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:26,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:27,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542187380] [2019-10-14 22:07:27,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939552454] [2019-10-14 22:07:27,288 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 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:07:27,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:07:27,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:27,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 73 conjunts are in the unsatisfiable core [2019-10-14 22:07:27,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:27,430 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:27,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:27,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:27,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:27,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:27,484 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:27,484 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:27,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:27,692 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-10-14 22:07:27,693 INFO L567 ElimStorePlain]: treesize reduction 14, result has 94.8 percent of original size [2019-10-14 22:07:27,695 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_46|], 2=[|v_#memory_$Pointer$.offset_53|, |v_#memory_$Pointer$.base_55|], 8=[|v_#memory_$Pointer$.base_58|, |v_#memory_$Pointer$.offset_56|]} [2019-10-14 22:07:27,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:27,716 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 20 treesize of output 9 [2019-10-14 22:07:27,716 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:27,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:27,798 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:27,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:27,864 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:27,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:27,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:27,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:27,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:27,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:27,930 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:27,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:27,947 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:27,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 50 [2019-10-14 22:07:27,948 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:28,051 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-14 22:07:28,052 INFO L567 ElimStorePlain]: treesize reduction 16, result has 90.6 percent of original size [2019-10-14 22:07:28,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:28,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:28,111 INFO L341 Elim1Store]: treesize reduction 3, result has 93.5 percent of original size [2019-10-14 22:07:28,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 69 [2019-10-14 22:07:28,112 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:28,189 INFO L567 ElimStorePlain]: treesize reduction 35, result has 72.7 percent of original size [2019-10-14 22:07:28,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:28,190 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:258, output treesize:72 [2019-10-14 22:07:28,324 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:28,324 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:28,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:28,738 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-10-14 22:07:28,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:28,740 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_47|, |v_#memory_int_51|], 2=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_54|], 4=[|v_#memory_int_48|], 24=[|v_#memory_$Pointer$.base_59|, |v_#memory_$Pointer$.offset_57|]} [2019-10-14 22:07:28,759 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:29,243 WARN L191 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-14 22:07:29,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:29,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 26 [2019-10-14 22:07:29,298 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:29,527 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-14 22:07:29,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:29,536 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:29,738 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-10-14 22:07:29,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:29,743 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:07:29,919 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-10-14 22:07:29,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:29,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:29,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:29,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 343 treesize of output 138 [2019-10-14 22:07:29,946 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:30,072 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-14 22:07:30,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:30,266 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-10-14 22:07:30,267 INFO L341 Elim1Store]: treesize reduction 117, result has 52.6 percent of original size [2019-10-14 22:07:30,267 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 438 treesize of output 374 [2019-10-14 22:07:30,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:30,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:30,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:30,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:30,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:30,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:30,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:30,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:30,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:30,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:30,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:30,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:30,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:30,330 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 16 xjuncts. [2019-10-14 22:07:31,165 WARN L191 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 60 [2019-10-14 22:07:31,166 INFO L567 ElimStorePlain]: treesize reduction 14967, result has 2.7 percent of original size [2019-10-14 22:07:31,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:31,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:31,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:31,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 136 [2019-10-14 22:07:31,179 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:31,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:31,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:31,222 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:1491, output treesize:109 [2019-10-14 22:07:31,348 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_57|, |v_#memory_$Pointer$.offset_55|], 4=[|v_#memory_int_49|], 5=[|v_#memory_int_52|], 20=[|v_#memory_$Pointer$.offset_58|, |v_#memory_$Pointer$.base_60|]} [2019-10-14 22:07:31,356 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 11 treesize of output 7 [2019-10-14 22:07:31,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:31,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:31,434 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 11 treesize of output 7 [2019-10-14 22:07:31,434 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:31,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:31,527 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:31,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:31,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:31,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:31,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:31,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2019-10-14 22:07:31,601 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:31,712 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-10-14 22:07:31,713 INFO L567 ElimStorePlain]: treesize reduction 4, result has 97.4 percent of original size [2019-10-14 22:07:31,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:31,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:31,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:31,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:31,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2019-10-14 22:07:31,726 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:31,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:31,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:31,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:31,781 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:31,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 59 treesize of output 50 [2019-10-14 22:07:31,783 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:31,832 INFO L567 ElimStorePlain]: treesize reduction 20, result has 73.0 percent of original size [2019-10-14 22:07:31,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:31,833 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:186, output treesize:54 [2019-10-14 22:07:31,878 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_50|], 9=[|v_#memory_$Pointer$.offset_59|, |v_#memory_$Pointer$.base_61|], 11=[|v_#memory_int_53|]} [2019-10-14 22:07:31,881 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:31,983 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-10-14 22:07:31,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:31,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:31,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:31,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 31 [2019-10-14 22:07:31,999 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:32,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:32,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:32,068 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:32,084 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:32,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 102 [2019-10-14 22:07:32,085 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:32,156 INFO L567 ElimStorePlain]: treesize reduction 18, result has 87.2 percent of original size [2019-10-14 22:07:32,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:32,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:32,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:32,166 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:32,167 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:32,187 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:32,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 100 [2019-10-14 22:07:32,188 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:32,242 INFO L567 ElimStorePlain]: treesize reduction 78, result has 52.1 percent of original size [2019-10-14 22:07:32,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:32,243 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:210, output treesize:76 [2019-10-14 22:07:32,345 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:32,345 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 57 treesize of output 32 [2019-10-14 22:07:32,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:32,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:32,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:32,366 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 22 treesize of output 10 [2019-10-14 22:07:32,366 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:32,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:32,378 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:07:32,378 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:33 [2019-10-14 22:07:32,425 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:32,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 29 [2019-10-14 22:07:32,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:32,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:32,434 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:32,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:3 [2019-10-14 22:07:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:32,469 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:32,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-10-14 22:07:32,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124895516] [2019-10-14 22:07:32,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-14 22:07:32,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:32,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-14 22:07:32,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-10-14 22:07:32,472 INFO L87 Difference]: Start difference. First operand 90 states and 112 transitions. Second operand 20 states. [2019-10-14 22:07:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:34,619 INFO L93 Difference]: Finished difference Result 160 states and 197 transitions. [2019-10-14 22:07:34,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-14 22:07:34,620 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-10-14 22:07:34,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:34,621 INFO L225 Difference]: With dead ends: 160 [2019-10-14 22:07:34,621 INFO L226 Difference]: Without dead ends: 158 [2019-10-14 22:07:34,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=220, Invalid=970, Unknown=0, NotChecked=0, Total=1190 [2019-10-14 22:07:34,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-14 22:07:34,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 98. [2019-10-14 22:07:34,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-14 22:07:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 123 transitions. [2019-10-14 22:07:34,636 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 123 transitions. Word has length 26 [2019-10-14 22:07:34,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:34,636 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 123 transitions. [2019-10-14 22:07:34,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-14 22:07:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 123 transitions. [2019-10-14 22:07:34,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 22:07:34,637 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:34,637 INFO L380 BasicCegarLoop]: trace histogram [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:07:34,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:34,842 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:34,843 INFO L82 PathProgramCache]: Analyzing trace with hash -590882554, now seen corresponding path program 1 times [2019-10-14 22:07:34,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:34,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927829189] [2019-10-14 22:07:34,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:34,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:34,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:35,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927829189] [2019-10-14 22:07:35,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739190161] [2019-10-14 22:07:35,005 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)