/usr/bin/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/list-properties/alternating_list-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:15:06,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:15:06,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:15:06,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:15:06,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:15:06,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:15:06,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:15:06,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:15:06,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:15:06,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:15:06,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:15:06,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:15:06,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:15:06,415 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:15:06,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:15:06,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:15:06,420 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:15:06,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:15:06,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:15:06,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:15:06,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:15:06,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:15:06,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:15:06,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:15:06,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:15:06,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:15:06,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:15:06,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:15:06,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:15:06,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:15:06,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:15:06,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:15:06,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:15:06,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:15:06,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:15:06,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:15:06,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:15:06,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:15:06,449 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:15:06,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:15:06,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:15:06,452 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-11-06 21:15:06,479 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:15:06,479 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:15:06,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:15:06,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:15:06,481 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:15:06,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:15:06,481 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:15:06,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:15:06,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:15:06,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:15:06,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:15:06,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:15:06,482 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:15:06,482 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:15:06,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:15:06,483 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:15:06,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:15:06,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:15:06,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:15:06,484 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:15:06,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:15:06,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:15:06,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:15:06,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:15:06,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:15:06,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:15:06,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:15:06,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:15:06,485 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:15:06,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:15:06,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:15:06,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:15:06,806 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:15:06,807 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:15:06,808 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/alternating_list-1.i [2019-11-06 21:15:06,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/322044613/c8656b623690483a884716b5d28f9bc1/FLAG9d70d00d7 [2019-11-06 21:15:07,426 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:15:07,427 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list-1.i [2019-11-06 21:15:07,451 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/322044613/c8656b623690483a884716b5d28f9bc1/FLAG9d70d00d7 [2019-11-06 21:15:07,721 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/322044613/c8656b623690483a884716b5d28f9bc1 [2019-11-06 21:15:07,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:15:07,732 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:15:07,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:15:07,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:15:07,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:15:07,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:07" (1/1) ... [2019-11-06 21:15:07,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@651a291b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:07, skipping insertion in model container [2019-11-06 21:15:07,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:07" (1/1) ... [2019-11-06 21:15:07,747 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:15:07,790 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:15:08,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:15:08,215 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:15:08,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:15:08,310 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:15:08,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:08 WrapperNode [2019-11-06 21:15:08,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:15:08,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:15:08,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:15:08,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:15:08,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:08" (1/1) ... [2019-11-06 21:15:08,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:08" (1/1) ... [2019-11-06 21:15:08,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:08" (1/1) ... [2019-11-06 21:15:08,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:08" (1/1) ... [2019-11-06 21:15:08,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:08" (1/1) ... [2019-11-06 21:15:08,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:08" (1/1) ... [2019-11-06 21:15:08,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:08" (1/1) ... [2019-11-06 21:15:08,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:15:08,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:15:08,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:15:08,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:15:08,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:08" (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-11-06 21:15:08,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:15:08,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:15:08,429 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-06 21:15:08,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-06 21:15:08,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-06 21:15:08,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-06 21:15:08,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-06 21:15:08,430 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-06 21:15:08,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:15:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:15:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:15:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 21:15:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 21:15:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 21:15:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 21:15:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 21:15:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 21:15:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 21:15:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 21:15:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 21:15:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 21:15:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 21:15:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 21:15:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 21:15:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 21:15:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 21:15:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 21:15:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-06 21:15:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-06 21:15:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-06 21:15:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-06 21:15:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-06 21:15:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 21:15:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 21:15:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 21:15:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 21:15:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 21:15:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 21:15:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 21:15:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 21:15:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 21:15:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 21:15:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 21:15:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 21:15:08,437 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 21:15:08,437 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 21:15:08,437 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 21:15:08,437 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 21:15:08,437 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 21:15:08,437 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 21:15:08,437 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 21:15:08,438 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 21:15:08,438 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 21:15:08,438 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 21:15:08,438 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 21:15:08,438 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 21:15:08,438 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 21:15:08,438 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 21:15:08,439 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 21:15:08,439 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 21:15:08,439 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 21:15:08,439 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 21:15:08,439 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 21:15:08,439 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 21:15:08,439 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 21:15:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 21:15:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 21:15:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 21:15:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 21:15:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 21:15:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 21:15:08,441 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 21:15:08,441 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 21:15:08,441 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 21:15:08,441 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 21:15:08,441 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 21:15:08,441 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 21:15:08,441 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 21:15:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 21:15:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 21:15:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 21:15:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 21:15:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 21:15:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 21:15:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 21:15:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 21:15:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 21:15:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 21:15:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 21:15:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 21:15:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 21:15:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 21:15:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 21:15:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 21:15:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 21:15:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 21:15:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 21:15:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 21:15:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 21:15:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 21:15:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 21:15:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 21:15:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 21:15:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 21:15:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 21:15:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 21:15:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 21:15:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 21:15:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 21:15:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 21:15:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 21:15:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 21:15:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 21:15:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 21:15:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 21:15:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 21:15:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 21:15:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 21:15:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-06 21:15:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:15:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 21:15:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 21:15:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 21:15:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 21:15:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 21:15:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:15:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:15:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:15:08,766 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-06 21:15:08,922 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:15:08,923 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-06 21:15:08,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:08 BoogieIcfgContainer [2019-11-06 21:15:08,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:15:08,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:15:08,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:15:08,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:15:08,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:15:07" (1/3) ... [2019-11-06 21:15:08,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37fe4f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:08, skipping insertion in model container [2019-11-06 21:15:08,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:08" (2/3) ... [2019-11-06 21:15:08,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37fe4f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:08, skipping insertion in model container [2019-11-06 21:15:08,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:08" (3/3) ... [2019-11-06 21:15:08,934 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2019-11-06 21:15:08,944 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:15:08,951 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:15:08,960 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:15:08,982 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:15:08,982 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:15:08,982 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:15:08,982 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:15:08,983 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:15:08,983 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:15:08,983 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:15:08,983 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:15:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-11-06 21:15:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 21:15:09,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:09,009 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:09,011 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:09,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:09,017 INFO L82 PathProgramCache]: Analyzing trace with hash 209903222, now seen corresponding path program 1 times [2019-11-06 21:15:09,025 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:09,026 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500811214] [2019-11-06 21:15:09,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:09,200 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500811214] [2019-11-06 21:15:09,201 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:09,202 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:15:09,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039603715] [2019-11-06 21:15:09,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:15:09,209 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:09,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:15:09,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:15:09,222 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-11-06 21:15:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:09,340 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-11-06 21:15:09,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:15:09,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-06 21:15:09,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:09,351 INFO L225 Difference]: With dead ends: 52 [2019-11-06 21:15:09,351 INFO L226 Difference]: Without dead ends: 23 [2019-11-06 21:15:09,355 INFO L630 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-11-06 21:15:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-06 21:15:09,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-06 21:15:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-06 21:15:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-11-06 21:15:09,412 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2019-11-06 21:15:09,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:09,413 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-06 21:15:09,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:15:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-11-06 21:15:09,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 21:15:09,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:09,414 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:09,415 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:09,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:09,415 INFO L82 PathProgramCache]: Analyzing trace with hash 919137993, now seen corresponding path program 1 times [2019-11-06 21:15:09,416 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:09,416 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587086271] [2019-11-06 21:15:09,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:09,514 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587086271] [2019-11-06 21:15:09,514 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:09,514 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:15:09,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774211601] [2019-11-06 21:15:09,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:15:09,520 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:09,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:15:09,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:15:09,521 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2019-11-06 21:15:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:09,614 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2019-11-06 21:15:09,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:15:09,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-06 21:15:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:09,616 INFO L225 Difference]: With dead ends: 51 [2019-11-06 21:15:09,616 INFO L226 Difference]: Without dead ends: 36 [2019-11-06 21:15:09,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:15:09,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-06 21:15:09,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-11-06 21:15:09,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-06 21:15:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-11-06 21:15:09,624 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 16 [2019-11-06 21:15:09,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:09,625 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-11-06 21:15:09,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:15:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-11-06 21:15:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 21:15:09,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:09,626 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:09,626 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:09,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:09,627 INFO L82 PathProgramCache]: Analyzing trace with hash 919131049, now seen corresponding path program 1 times [2019-11-06 21:15:09,627 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:09,627 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979707472] [2019-11-06 21:15:09,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:09,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:09,719 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979707472] [2019-11-06 21:15:09,722 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:09,722 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:15:09,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930482328] [2019-11-06 21:15:09,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:15:09,724 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:09,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:15:09,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:15:09,726 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 6 states. [2019-11-06 21:15:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:09,846 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-11-06 21:15:09,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:15:09,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-06 21:15:09,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:09,848 INFO L225 Difference]: With dead ends: 61 [2019-11-06 21:15:09,848 INFO L226 Difference]: Without dead ends: 46 [2019-11-06 21:15:09,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:15:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-06 21:15:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2019-11-06 21:15:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-06 21:15:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-11-06 21:15:09,858 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 16 [2019-11-06 21:15:09,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:09,858 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-11-06 21:15:09,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:15:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-11-06 21:15:09,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:15:09,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:09,862 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:09,863 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:09,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:09,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1446652468, now seen corresponding path program 1 times [2019-11-06 21:15:09,863 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:09,866 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745830245] [2019-11-06 21:15:09,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:10,170 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745830245] [2019-11-06 21:15:10,171 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707870847] [2019-11-06 21:15:10,171 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-11-06 21:15:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-06 21:15:10,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:10,366 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-11-06 21:15:10,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:10,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:10,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:10,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 21:15:10,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 11 treesize of output 7 [2019-11-06 21:15:10,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:10,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:10,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:10,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-06 21:15:10,492 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:10,493 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-11-06 21:15:10,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:10,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:10,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:10,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-11-06 21:15:10,560 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:15:10,561 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 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:15:10,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:10,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:10,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:10,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-06 21:15:10,613 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 19 treesize of output 18 [2019-11-06 21:15:10,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:10,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:10,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:10,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-06 21:15:10,667 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-11-06 21:15:10,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:10,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:10,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:10,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-06 21:15:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:10,679 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:10,679 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2019-11-06 21:15:10,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742437509] [2019-11-06 21:15:10,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 21:15:10,682 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:10,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 21:15:10,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-11-06 21:15:10,683 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 18 states. [2019-11-06 21:15:11,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:11,369 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-11-06 21:15:11,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-06 21:15:11,370 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-11-06 21:15:11,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:11,371 INFO L225 Difference]: With dead ends: 90 [2019-11-06 21:15:11,371 INFO L226 Difference]: Without dead ends: 88 [2019-11-06 21:15:11,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2019-11-06 21:15:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-06 21:15:11,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 57. [2019-11-06 21:15:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-06 21:15:11,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-11-06 21:15:11,382 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 22 [2019-11-06 21:15:11,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:11,382 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-11-06 21:15:11,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 21:15:11,383 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-11-06 21:15:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 21:15:11,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:11,385 INFO L410 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-11-06 21:15:11,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:11,591 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:11,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:11,591 INFO L82 PathProgramCache]: Analyzing trace with hash -825238535, now seen corresponding path program 1 times [2019-11-06 21:15:11,591 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:11,592 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518659974] [2019-11-06 21:15:11,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:11,925 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518659974] [2019-11-06 21:15:11,925 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513912481] [2019-11-06 21:15:11,925 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-11-06 21:15:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:12,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-06 21:15:12,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:12,032 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-11-06 21:15:12,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:12,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:12,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:12,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 21:15:12,078 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:12,078 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-11-06 21:15:12,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:12,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:12,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:12,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-06 21:15:12,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:12,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:12,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:12,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:12,134 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:12,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:12,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:12,147 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-06 21:15:12,187 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_18|], 2=[|v_#memory_$Pointer$.base_15|, |v_#memory_$Pointer$.offset_14|]} [2019-11-06 21:15:12,191 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 29 treesize of output 19 [2019-11-06 21:15:12,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:12,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:12,226 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:12,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-06 21:15:12,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:12,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:12,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:12,233 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-06 21:15:12,258 INFO L567 ElimStorePlain]: treesize reduction 188, result has 28.5 percent of original size [2019-11-06 21:15:12,263 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-06 21:15:12,264 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:12,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:12,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:12,270 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-06 21:15:12,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-11-06 21:15:12,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:12,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:12,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-06 21:15:12,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:12,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:12,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:12,343 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-06 21:15:12,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:15:12,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:12,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:12,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:12,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-06 21:15:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:12,362 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:12,362 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2019-11-06 21:15:12,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153262839] [2019-11-06 21:15:12,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-06 21:15:12,363 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:12,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-06 21:15:12,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:15:12,364 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 17 states. [2019-11-06 21:15:12,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:12,912 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2019-11-06 21:15:12,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:15:12,913 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-11-06 21:15:12,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:12,914 INFO L225 Difference]: With dead ends: 84 [2019-11-06 21:15:12,915 INFO L226 Difference]: Without dead ends: 64 [2019-11-06 21:15:12,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2019-11-06 21:15:12,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-06 21:15:12,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2019-11-06 21:15:12,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-06 21:15:12,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2019-11-06 21:15:12,925 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 27 [2019-11-06 21:15:12,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:12,925 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2019-11-06 21:15:12,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-06 21:15:12,925 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2019-11-06 21:15:12,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 21:15:12,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:12,927 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:13,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:13,131 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:13,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:13,132 INFO L82 PathProgramCache]: Analyzing trace with hash 700551310, now seen corresponding path program 2 times [2019-11-06 21:15:13,132 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:13,132 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579419702] [2019-11-06 21:15:13,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 21:15:13,186 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579419702] [2019-11-06 21:15:13,186 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:13,187 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:15:13,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415120644] [2019-11-06 21:15:13,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:15:13,188 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:13,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:15:13,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:15:13,188 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 4 states. [2019-11-06 21:15:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:13,262 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2019-11-06 21:15:13,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:15:13,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-06 21:15:13,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:13,263 INFO L225 Difference]: With dead ends: 90 [2019-11-06 21:15:13,264 INFO L226 Difference]: Without dead ends: 55 [2019-11-06 21:15:13,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:15:13,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-06 21:15:13,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-11-06 21:15:13,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-06 21:15:13,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-11-06 21:15:13,271 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 33 [2019-11-06 21:15:13,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:13,272 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-11-06 21:15:13,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:15:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-11-06 21:15:13,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 21:15:13,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:13,273 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:13,274 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:13,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:13,274 INFO L82 PathProgramCache]: Analyzing trace with hash -887796592, now seen corresponding path program 1 times [2019-11-06 21:15:13,274 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:13,274 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463974211] [2019-11-06 21:15:13,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:13,882 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463974211] [2019-11-06 21:15:13,882 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946833573] [2019-11-06 21:15:13,883 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-11-06 21:15:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:14,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-06 21:15:14,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:14,019 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-11-06 21:15:14,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:14,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:14,078 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:14,079 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-11-06 21:15:14,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:14,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-06 21:15:14,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:14,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:14,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:14,136 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:14,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,148 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:41 [2019-11-06 21:15:14,187 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_19|], 2=[|v_#memory_$Pointer$.base_17|, |v_#memory_$Pointer$.offset_16|]} [2019-11-06 21:15:14,191 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-11-06 21:15:14,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:14,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:14,223 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 35 treesize of output 17 [2019-11-06 21:15:14,224 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:14,245 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 34 treesize of output 16 [2019-11-06 21:15:14,245 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:14,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,260 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:36 [2019-11-06 21:15:14,352 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_20|], 2=[|v_#memory_$Pointer$.offset_17|, |v_#memory_$Pointer$.base_18|]} [2019-11-06 21:15:14,357 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 47 treesize of output 17 [2019-11-06 21:15:14,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:14,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-11-06 21:15:14,391 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:14,411 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:15:14,422 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:14,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 63 [2019-11-06 21:15:14,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:14,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:14,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:14,426 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-06 21:15:14,468 INFO L567 ElimStorePlain]: treesize reduction 73, result has 51.0 percent of original size [2019-11-06 21:15:14,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,470 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:128, output treesize:62 [2019-11-06 21:15:14,515 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_19|, |v_#memory_int_21|], 5=[|v_#memory_$Pointer$.offset_18|]} [2019-11-06 21:15:14,535 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:14,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 118 [2019-11-06 21:15:14,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:14,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:14,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:14,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:14,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:14,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:14,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:14,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:14,546 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:14,602 INFO L567 ElimStorePlain]: treesize reduction 40, result has 64.9 percent of original size [2019-11-06 21:15:14,629 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:14,630 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 1 case distinctions, treesize of input 23 treesize of output 38 [2019-11-06 21:15:14,631 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,678 INFO L567 ElimStorePlain]: treesize reduction 12, result has 86.0 percent of original size [2019-11-06 21:15:14,722 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:14,723 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 49 treesize of output 98 [2019-11-06 21:15:14,724 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:14,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:14,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:14,746 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:122, output treesize:56 [2019-11-06 21:15:14,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:14,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:14,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:14,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:15,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:15,095 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, v_prenex_2], 1=[|#memory_$Pointer$.offset|, v_prenex_3]} [2019-11-06 21:15:15,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2019-11-06 21:15:15,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:15,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:15,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2019-11-06 21:15:15,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:15,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:15,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:15,156 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 43 treesize of output 31 [2019-11-06 21:15:15,157 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:15,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:15,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:15,185 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 36 treesize of output 24 [2019-11-06 21:15:15,186 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:15,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:15,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-06 21:15:15,203 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:110, output treesize:44 [2019-11-06 21:15:15,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:15,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:15,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 37 [2019-11-06 21:15:15,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:15,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:15,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:15,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2019-11-06 21:15:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:15,470 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:15,470 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2019-11-06 21:15:15,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590719613] [2019-11-06 21:15:15,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-06 21:15:15,471 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:15,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-06 21:15:15,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2019-11-06 21:15:15,472 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 31 states. [2019-11-06 21:15:17,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:17,173 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2019-11-06 21:15:17,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-06 21:15:17,173 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 33 [2019-11-06 21:15:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:17,175 INFO L225 Difference]: With dead ends: 81 [2019-11-06 21:15:17,175 INFO L226 Difference]: Without dead ends: 79 [2019-11-06 21:15:17,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=322, Invalid=2030, Unknown=0, NotChecked=0, Total=2352 [2019-11-06 21:15:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-06 21:15:17,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2019-11-06 21:15:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-06 21:15:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-11-06 21:15:17,187 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 33 [2019-11-06 21:15:17,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:17,187 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-11-06 21:15:17,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-06 21:15:17,187 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-11-06 21:15:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 21:15:17,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:17,188 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:17,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:17,392 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:17,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:17,392 INFO L82 PathProgramCache]: Analyzing trace with hash -96612664, now seen corresponding path program 1 times [2019-11-06 21:15:17,393 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:17,393 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684043594] [2019-11-06 21:15:17,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:17,799 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:17,799 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684043594] [2019-11-06 21:15:17,799 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293569452] [2019-11-06 21:15:17,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:17,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-06 21:15:17,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:17,943 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-11-06 21:15:17,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:17,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-06 21:15:18,014 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-11-06 21:15:18,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:18,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-06 21:15:18,069 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:18,069 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-11-06 21:15:18,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,097 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-11-06 21:15:18,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-11-06 21:15:18,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:18,132 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 27 treesize of output 11 [2019-11-06 21:15:18,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:18,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-06 21:15:18,173 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 19 treesize of output 18 [2019-11-06 21:15:18,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:18,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-06 21:15:18,227 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:18,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-06 21:15:18,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:18,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30 [2019-11-06 21:15:18,287 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:15:18,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 21:15:18,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:18,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:18,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-06 21:15:18,346 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 26 treesize of output 28 [2019-11-06 21:15:18,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:18,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:18,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:37 [2019-11-06 21:15:18,469 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:15:18,469 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 1 case distinctions, treesize of input 41 treesize of output 31 [2019-11-06 21:15:18,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:18,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:18,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:40 [2019-11-06 21:15:18,586 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:18,587 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 33 treesize of output 102 [2019-11-06 21:15:18,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,672 INFO L567 ElimStorePlain]: treesize reduction 44, result has 59.3 percent of original size [2019-11-06 21:15:18,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:18,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:48, output treesize:64 [2019-11-06 21:15:18,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:18,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:19,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:19,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-06 21:15:19,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:19,116 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.1 percent of original size [2019-11-06 21:15:19,124 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:19,125 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 1 case distinctions, treesize of input 37 treesize of output 29 [2019-11-06 21:15:19,126 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:19,159 INFO L567 ElimStorePlain]: treesize reduction 4, result has 89.2 percent of original size [2019-11-06 21:15:19,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:19,160 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:83, output treesize:3 [2019-11-06 21:15:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:19,170 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:19,170 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2019-11-06 21:15:19,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431558287] [2019-11-06 21:15:19,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-06 21:15:19,171 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:19,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-06 21:15:19,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=773, Unknown=0, NotChecked=0, Total=930 [2019-11-06 21:15:19,172 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 31 states. [2019-11-06 21:15:20,207 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-06 21:15:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:20,551 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2019-11-06 21:15:20,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-06 21:15:20,552 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 34 [2019-11-06 21:15:20,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:20,553 INFO L225 Difference]: With dead ends: 87 [2019-11-06 21:15:20,553 INFO L226 Difference]: Without dead ends: 85 [2019-11-06 21:15:20,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=305, Invalid=1587, Unknown=0, NotChecked=0, Total=1892 [2019-11-06 21:15:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-06 21:15:20,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 68. [2019-11-06 21:15:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-06 21:15:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2019-11-06 21:15:20,563 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 34 [2019-11-06 21:15:20,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:20,564 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2019-11-06 21:15:20,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-06 21:15:20,564 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2019-11-06 21:15:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-06 21:15:20,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:20,565 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:20,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:20,774 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:20,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:20,775 INFO L82 PathProgramCache]: Analyzing trace with hash -862472195, now seen corresponding path program 1 times [2019-11-06 21:15:20,775 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:20,775 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212187529] [2019-11-06 21:15:20,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:21,485 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:21,486 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212187529] [2019-11-06 21:15:21,486 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86773084] [2019-11-06 21:15:21,486 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-11-06 21:15:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:21,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-06 21:15:21,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:21,605 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-11-06 21:15:21,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:21,677 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,678 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-11-06 21:15:21,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,704 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-06 21:15:21,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-06 21:15:21,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:21,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:21,803 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,820 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:48 [2019-11-06 21:15:21,888 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-06 21:15:21,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 32 [2019-11-06 21:15:21,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,923 INFO L567 ElimStorePlain]: treesize reduction 10, result has 83.6 percent of original size [2019-11-06 21:15:21,927 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-06 21:15:21,928 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,940 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:36 [2019-11-06 21:15:21,982 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,983 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 22 treesize of output 32 [2019-11-06 21:15:21,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:49 [2019-11-06 21:15:22,069 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,070 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 131 [2019-11-06 21:15:22,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:22,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 21:15:22,129 INFO L567 ElimStorePlain]: treesize reduction 130, result has 48.6 percent of original size [2019-11-06 21:15:22,137 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 93 [2019-11-06 21:15:22,137 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,161 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:127 [2019-11-06 21:15:22,210 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_29|], 6=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_23|]} [2019-11-06 21:15:22,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2019-11-06 21:15:22,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,293 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 250 [2019-11-06 21:15:22,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:22,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:22,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:22,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:22,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,307 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-06 21:15:22,398 INFO L567 ElimStorePlain]: treesize reduction 1740, result has 9.9 percent of original size [2019-11-06 21:15:22,437 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,438 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 186 treesize of output 209 [2019-11-06 21:15:22,440 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,479 INFO L567 ElimStorePlain]: treesize reduction 100, result has 47.4 percent of original size [2019-11-06 21:15:22,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,480 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:292, output treesize:90 [2019-11-06 21:15:22,758 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,758 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 103 treesize of output 66 [2019-11-06 21:15:22,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,760 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:22,787 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-11-06 21:15:22,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2019-11-06 21:15:22,791 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:22,804 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:18 [2019-11-06 21:15:22,848 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-11-06 21:15:22,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,857 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-11-06 21:15:22,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-06 21:15:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:22,871 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:22,871 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 30 [2019-11-06 21:15:22,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615180280] [2019-11-06 21:15:22,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-06 21:15:22,872 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:22,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-06 21:15:22,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2019-11-06 21:15:22,873 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 30 states. [2019-11-06 21:15:23,488 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2019-11-06 21:15:24,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:24,621 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2019-11-06 21:15:24,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 21:15:24,621 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 38 [2019-11-06 21:15:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:24,622 INFO L225 Difference]: With dead ends: 93 [2019-11-06 21:15:24,622 INFO L226 Difference]: Without dead ends: 68 [2019-11-06 21:15:24,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=230, Invalid=1750, Unknown=0, NotChecked=0, Total=1980 [2019-11-06 21:15:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-06 21:15:24,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2019-11-06 21:15:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-06 21:15:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-11-06 21:15:24,632 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 38 [2019-11-06 21:15:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:24,632 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-11-06 21:15:24,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-06 21:15:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-11-06 21:15:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-06 21:15:24,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:24,634 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:24,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:24,838 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:24,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:24,839 INFO L82 PathProgramCache]: Analyzing trace with hash 201323493, now seen corresponding path program 2 times [2019-11-06 21:15:24,839 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:24,839 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614153360] [2019-11-06 21:15:24,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:25,822 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614153360] [2019-11-06 21:15:25,822 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227775804] [2019-11-06 21:15:25,822 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 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-11-06 21:15:25,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:15:25,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:25,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 74 conjunts are in the unsatisfiable core [2019-11-06 21:15:25,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:25,952 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-11-06 21:15:25,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:25,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:25,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:25,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-06 21:15:26,042 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,043 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-11-06 21:15:26,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,072 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-06 21:15:26,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-06 21:15:26,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:26,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:26,126 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,143 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:57 [2019-11-06 21:15:26,181 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_30|], 2=[|v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_25|]} [2019-11-06 21:15:26,185 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-11-06 21:15:26,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:26,221 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 46 treesize of output 22 [2019-11-06 21:15:26,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:26,251 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 34 treesize of output 16 [2019-11-06 21:15:26,251 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,273 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:98, output treesize:58 [2019-11-06 21:15:26,332 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,333 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 22 treesize of output 32 [2019-11-06 21:15:26,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:56 [2019-11-06 21:15:26,394 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 2=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_26|]} [2019-11-06 21:15:26,400 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 47 treesize of output 17 [2019-11-06 21:15:26,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,433 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:15:26,444 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,444 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 71 [2019-11-06 21:15:26,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,446 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,496 INFO L567 ElimStorePlain]: treesize reduction 30, result has 74.8 percent of original size [2019-11-06 21:15:26,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:26,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-11-06 21:15:26,501 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,520 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:142, output treesize:73 [2019-11-06 21:15:26,564 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_27|, |v_#memory_int_32|], 6=[|v_#memory_$Pointer$.base_29|]} [2019-11-06 21:15:26,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:26,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-06 21:15:26,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:26,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-06 21:15:26,599 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,629 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:15:26,697 INFO L341 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size [2019-11-06 21:15:26,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 64 [2019-11-06 21:15:26,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,703 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:26,746 INFO L567 ElimStorePlain]: treesize reduction 26, result has 66.2 percent of original size [2019-11-06 21:15:26,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,747 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:114, output treesize:60 [2019-11-06 21:15:26,853 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_28|], 6=[|v_#memory_int_33|, |v_#memory_$Pointer$.base_30|]} [2019-11-06 21:15:26,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2019-11-06 21:15:26,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:26,903 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 80 treesize of output 37 [2019-11-06 21:15:26,903 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,928 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:15:26,975 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 142 [2019-11-06 21:15:26,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:26,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:26,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:26,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,990 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 5 xjuncts. [2019-11-06 21:15:27,175 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-11-06 21:15:27,175 INFO L567 ElimStorePlain]: treesize reduction 1145, result has 10.5 percent of original size [2019-11-06 21:15:27,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:27,177 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:211, output treesize:115 [2019-11-06 21:15:27,248 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_31|], 6=[|v_#memory_$Pointer$.offset_29|, |v_#memory_int_34|]} [2019-11-06 21:15:27,288 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:27,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 195 [2019-11-06 21:15:27,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:27,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:27,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:27,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:27,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:27,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:27,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:27,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:27,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:27,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:27,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:27,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:27,328 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:27,398 INFO L567 ElimStorePlain]: treesize reduction 100, result has 50.0 percent of original size [2019-11-06 21:15:27,438 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:27,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 110 [2019-11-06 21:15:27,440 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:27,507 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.2 percent of original size [2019-11-06 21:15:27,547 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:27,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-06 21:15:27,549 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:27,655 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-11-06 21:15:27,655 INFO L567 ElimStorePlain]: treesize reduction 28, result has 75.2 percent of original size [2019-11-06 21:15:27,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:27,660 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:193, output treesize:131 [2019-11-06 21:15:27,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,241 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-11-06 21:15:28,614 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-11-06 21:15:28,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 21:15:28,633 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_13], 1=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|, v_prenex_12, v_prenex_18, v_prenex_15], 2=[v_prenex_19, v_prenex_16]} [2019-11-06 21:15:28,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2019-11-06 21:15:28,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,815 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-11-06 21:15:28,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,832 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,833 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 70 treesize of output 57 [2019-11-06 21:15:28,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,836 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:29,090 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 116 [2019-11-06 21:15:29,090 INFO L567 ElimStorePlain]: treesize reduction 8, result has 97.5 percent of original size [2019-11-06 21:15:29,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:29,103 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 43 treesize of output 31 [2019-11-06 21:15:29,104 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:29,223 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-06 21:15:29,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:29,237 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:29,238 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 59 treesize of output 46 [2019-11-06 21:15:29,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:29,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:29,241 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:29,467 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2019-11-06 21:15:29,468 INFO L567 ElimStorePlain]: treesize reduction 8, result has 97.1 percent of original size [2019-11-06 21:15:29,482 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:29,483 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 107 treesize of output 74 [2019-11-06 21:15:29,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:29,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:29,485 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:29,622 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 92 [2019-11-06 21:15:29,622 INFO L567 ElimStorePlain]: treesize reduction 8, result has 96.5 percent of original size [2019-11-06 21:15:29,632 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:29,633 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 100 treesize of output 67 [2019-11-06 21:15:29,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:29,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:29,635 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:29,764 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2019-11-06 21:15:29,764 INFO L567 ElimStorePlain]: treesize reduction 8, result has 95.5 percent of original size [2019-11-06 21:15:29,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2019-11-06 21:15:29,771 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:29,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:29,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2019-11-06 21:15:29,834 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:29,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:29,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 8 dim-2 vars, End of recursive call: 11 dim-0 vars, and 4 xjuncts. [2019-11-06 21:15:29,889 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 15 variables, input treesize:348, output treesize:131 [2019-11-06 21:15:30,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:30,188 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:30,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 37 [2019-11-06 21:15:30,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:30,206 INFO L567 ElimStorePlain]: treesize reduction 8, result has 66.7 percent of original size [2019-11-06 21:15:30,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:30,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2019-11-06 21:15:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:30,224 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:30,224 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2019-11-06 21:15:30,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901888745] [2019-11-06 21:15:30,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-06 21:15:30,225 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:30,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-06 21:15:30,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1297, Unknown=0, NotChecked=0, Total=1482 [2019-11-06 21:15:30,226 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 39 states. [2019-11-06 21:15:31,370 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-11-06 21:15:31,625 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-11-06 21:15:31,799 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-11-06 21:15:31,973 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-11-06 21:15:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:32,513 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-11-06 21:15:32,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-06 21:15:32,514 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-11-06 21:15:32,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:32,516 INFO L225 Difference]: With dead ends: 91 [2019-11-06 21:15:32,516 INFO L226 Difference]: Without dead ends: 89 [2019-11-06 21:15:32,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=346, Invalid=2306, Unknown=0, NotChecked=0, Total=2652 [2019-11-06 21:15:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-06 21:15:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 63. [2019-11-06 21:15:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-06 21:15:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-06 21:15:32,526 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 39 [2019-11-06 21:15:32,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:32,526 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-06 21:15:32,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-06 21:15:32,527 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-06 21:15:32,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 21:15:32,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:32,528 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:32,731 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:32,732 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:32,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:32,732 INFO L82 PathProgramCache]: Analyzing trace with hash -435462959, now seen corresponding path program 2 times [2019-11-06 21:15:32,733 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:32,733 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690320598] [2019-11-06 21:15:32,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:33,326 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690320598] [2019-11-06 21:15:33,326 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634576654] [2019-11-06 21:15:33,326 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-11-06 21:15:33,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:15:33,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:33,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 63 conjunts are in the unsatisfiable core [2019-11-06 21:15:33,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:33,467 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-11-06 21:15:33,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:33,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:33,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:33,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:33,525 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-11-06 21:15:33,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:33,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:33,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:33,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-06 21:15:33,579 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:33,579 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-11-06 21:15:33,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:33,609 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-11-06 21:15:33,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:33,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-11-06 21:15:33,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:33,648 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 27 treesize of output 11 [2019-11-06 21:15:33,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:33,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:33,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:33,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-06 21:15:33,703 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 19 treesize of output 18 [2019-11-06 21:15:33,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:33,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:33,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:33,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-06 21:15:33,799 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:33,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-06 21:15:33,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:33,853 INFO L567 ElimStorePlain]: treesize reduction 28, result has 61.6 percent of original size [2019-11-06 21:15:33,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:33,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:45 [2019-11-06 21:15:33,911 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:15:33,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 21:15:33,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:33,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:33,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:33,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:45 [2019-11-06 21:15:34,027 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 26 treesize of output 28 [2019-11-06 21:15:34,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:34,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:52 [2019-11-06 21:15:34,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2019-11-06 21:15:34,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:34,143 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:49 [2019-11-06 21:15:34,207 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:15:34,207 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 1 case distinctions, treesize of input 41 treesize of output 31 [2019-11-06 21:15:34,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:34,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:68, output treesize:49 [2019-11-06 21:15:34,291 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 33 treesize of output 38 [2019-11-06 21:15:34,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:34,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:56 [2019-11-06 21:15:34,447 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:15:34,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 41 [2019-11-06 21:15:34,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:34,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:78, output treesize:59 [2019-11-06 21:15:34,640 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 136 [2019-11-06 21:15:34,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,774 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-11-06 21:15:34,775 INFO L567 ElimStorePlain]: treesize reduction 60, result has 61.0 percent of original size [2019-11-06 21:15:34,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:34,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:70, output treesize:94 [2019-11-06 21:15:34,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:37,333 WARN L191 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-11-06 21:15:37,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:37,618 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 72 [2019-11-06 21:15:37,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:37,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 40 [2019-11-06 21:15:37,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:37,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 40 [2019-11-06 21:15:37,645 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:37,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:37,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:37,678 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 12 variables, input treesize:121, output treesize:3 [2019-11-06 21:15:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:37,692 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:37,692 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2019-11-06 21:15:37,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074503810] [2019-11-06 21:15:37,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-06 21:15:37,693 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:37,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-06 21:15:37,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2019-11-06 21:15:37,694 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 36 states. [2019-11-06 21:15:39,288 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-11-06 21:15:39,599 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2019-11-06 21:15:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:39,947 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2019-11-06 21:15:39,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-06 21:15:39,948 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2019-11-06 21:15:39,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:39,949 INFO L225 Difference]: With dead ends: 91 [2019-11-06 21:15:39,949 INFO L226 Difference]: Without dead ends: 89 [2019-11-06 21:15:39,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=516, Invalid=2454, Unknown=0, NotChecked=0, Total=2970 [2019-11-06 21:15:39,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-06 21:15:39,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2019-11-06 21:15:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-06 21:15:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-11-06 21:15:39,959 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 40 [2019-11-06 21:15:39,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:39,959 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-11-06 21:15:39,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-06 21:15:39,959 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-11-06 21:15:39,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-06 21:15:39,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:39,961 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:40,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:40,165 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:40,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:40,165 INFO L82 PathProgramCache]: Analyzing trace with hash 407461320, now seen corresponding path program 2 times [2019-11-06 21:15:40,165 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:40,166 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665006927] [2019-11-06 21:15:40,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:41,261 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665006927] [2019-11-06 21:15:41,262 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997304227] [2019-11-06 21:15:41,262 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:41,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:15:41,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:41,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 80 conjunts are in the unsatisfiable core [2019-11-06 21:15:41,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:41,393 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-11-06 21:15:41,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:41,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-06 21:15:41,461 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:41,462 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-11-06 21:15:41,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,487 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-06 21:15:41,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-06 21:15:41,524 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 11 treesize of output 7 [2019-11-06 21:15:41,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:41,553 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 11 treesize of output 7 [2019-11-06 21:15:41,553 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:41,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,570 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-06 21:15:41,646 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-06 21:15:41,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2019-11-06 21:15:41,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,680 INFO L567 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-11-06 21:15:41,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-06 21:15:41,686 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:41,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,705 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:32 [2019-11-06 21:15:41,770 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:41,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-06 21:15:41,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,822 INFO L567 ElimStorePlain]: treesize reduction 40, result has 58.8 percent of original size [2019-11-06 21:15:41,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:57 [2019-11-06 21:15:41,910 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:41,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 116 [2019-11-06 21:15:41,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:41,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 21:15:41,981 INFO L567 ElimStorePlain]: treesize reduction 113, result has 51.5 percent of original size [2019-11-06 21:15:41,985 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 88 [2019-11-06 21:15:41,985 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:42,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:42,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:42,010 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:119 [2019-11-06 21:15:42,073 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 6=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_34|]} [2019-11-06 21:15:42,076 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-11-06 21:15:42,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:42,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:42,187 INFO L341 Elim1Store]: treesize reduction 52, result has 54.0 percent of original size [2019-11-06 21:15:42,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 102 [2019-11-06 21:15:42,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,193 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:42,262 INFO L567 ElimStorePlain]: treesize reduction 40, result has 68.3 percent of original size [2019-11-06 21:15:42,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2019-11-06 21:15:42,267 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:42,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:42,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:42,292 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:160, output treesize:84 [2019-11-06 21:15:42,382 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:42,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 41 [2019-11-06 21:15:42,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:42,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:42,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:42,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:92, output treesize:84 [2019-11-06 21:15:42,470 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_45|], 6=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_35|]} [2019-11-06 21:15:42,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:42,476 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 125 treesize of output 39 [2019-11-06 21:15:42,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:42,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:42,571 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:42,572 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 294 treesize of output 231 [2019-11-06 21:15:42,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:42,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,580 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-06 21:15:42,716 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-11-06 21:15:42,717 INFO L567 ElimStorePlain]: treesize reduction 507, result has 35.9 percent of original size [2019-11-06 21:15:42,759 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:42,760 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 276 treesize of output 245 [2019-11-06 21:15:42,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:42,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:42,773 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:42,997 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-11-06 21:15:42,997 INFO L567 ElimStorePlain]: treesize reduction 1306, result has 17.0 percent of original size [2019-11-06 21:15:42,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:42,999 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:390, output treesize:330 [2019-11-06 21:15:43,090 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_46|], 12=[|v_#memory_$Pointer$.offset_36|, |v_#memory_$Pointer$.base_40|]} [2019-11-06 21:15:43,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 114 [2019-11-06 21:15:43,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:43,208 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:43,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 8 new quantified variables, introduced 5 case distinctions, treesize of input 690 treesize of output 482 [2019-11-06 21:15:43,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,213 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,290 INFO L567 ElimStorePlain]: treesize reduction 368, result has 52.9 percent of original size [2019-11-06 21:15:43,350 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:43,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 411 treesize of output 252 [2019-11-06 21:15:43,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:43,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:43,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:43,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,367 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,486 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-06 21:15:43,487 INFO L567 ElimStorePlain]: treesize reduction 3444, result has 8.0 percent of original size [2019-11-06 21:15:43,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,487 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:739, output treesize:297 [2019-11-06 21:15:43,955 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:43,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 290 treesize of output 149 [2019-11-06 21:15:43,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,962 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:44,038 INFO L567 ElimStorePlain]: treesize reduction 72, result has 53.8 percent of original size [2019-11-06 21:15:44,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 24 [2019-11-06 21:15:44,043 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:44,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:44,064 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-11-06 21:15:44,064 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:297, output treesize:30 [2019-11-06 21:15:44,125 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:44,125 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 1 case distinctions, treesize of input 29 treesize of output 21 [2019-11-06 21:15:44,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:44,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:44,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:44,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2019-11-06 21:15:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:44,152 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:44,152 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 36 [2019-11-06 21:15:44,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802273697] [2019-11-06 21:15:44,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-06 21:15:44,153 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:44,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-06 21:15:44,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1134, Unknown=0, NotChecked=0, Total=1260 [2019-11-06 21:15:44,154 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 36 states.