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-13a467a-m [2019-10-14 23:11:07,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:11:07,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:11:07,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:11:07,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:11:07,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:11:07,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:11:07,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:11:07,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:11:07,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:11:07,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:11:07,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:11:07,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:11:07,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:11:07,292 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:11:07,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:11:07,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:11:07,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:11:07,300 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:11:07,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:11:07,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:11:07,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:11:07,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:11:07,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:11:07,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:11:07,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:11:07,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:11:07,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:11:07,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:11:07,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:11:07,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:11:07,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:11:07,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:11:07,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:11:07,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:11:07,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:11:07,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:11:07,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:11:07,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:11:07,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:11:07,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:11:07,326 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:11:07,340 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:11:07,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:11:07,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:11:07,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:11:07,342 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:11:07,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:11:07,342 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:11:07,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:11:07,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:11:07,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:11:07,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:11:07,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:11:07,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:11:07,344 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:11:07,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:11:07,344 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:11:07,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:11:07,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:11:07,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:11:07,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:11:07,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:11:07,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:11:07,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:11:07,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:11:07,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:11:07,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:11:07,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:11:07,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:11:07,347 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:11:07,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:11:07,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:11:07,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:11:07,634 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:11:07,634 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:11:07,635 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-10-14 23:11:07,710 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1034a7596/e07164c4c3de4858afbd7c5ddcc3404e/FLAG925a096a7 [2019-10-14 23:11:08,274 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:11:08,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list-1.i [2019-10-14 23:11:08,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1034a7596/e07164c4c3de4858afbd7c5ddcc3404e/FLAG925a096a7 [2019-10-14 23:11:08,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1034a7596/e07164c4c3de4858afbd7c5ddcc3404e [2019-10-14 23:11:08,517 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:11:08,519 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:11:08,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:11:08,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:11:08,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:11:08,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:11:08" (1/1) ... [2019-10-14 23:11:08,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6377ca13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:08, skipping insertion in model container [2019-10-14 23:11:08,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:11:08" (1/1) ... [2019-10-14 23:11:08,537 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:11:08,595 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:11:09,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:11:09,053 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:11:09,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:11:09,158 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:11:09,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:09 WrapperNode [2019-10-14 23:11:09,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:11:09,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:11:09,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:11:09,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:11:09,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:09" (1/1) ... [2019-10-14 23:11:09,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:09" (1/1) ... [2019-10-14 23:11:09,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:09" (1/1) ... [2019-10-14 23:11:09,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:09" (1/1) ... [2019-10-14 23:11:09,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:09" (1/1) ... [2019-10-14 23:11:09,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:09" (1/1) ... [2019-10-14 23:11:09,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:09" (1/1) ... [2019-10-14 23:11:09,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:11:09,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:11:09,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:11:09,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:11:09,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:11:09,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:11:09,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:11:09,282 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 23:11:09,283 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 23:11:09,283 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-10-14 23:11:09,283 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-10-14 23:11:09,283 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-10-14 23:11:09,283 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-14 23:11:09,283 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:11:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:11:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:11:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 23:11:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 23:11:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 23:11:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 23:11:09,285 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 23:11:09,285 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 23:11:09,285 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 23:11:09,285 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 23:11:09,285 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 23:11:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 23:11:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 23:11:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 23:11:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 23:11:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 23:11:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 23:11:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 23:11:09,287 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 23:11:09,287 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 23:11:09,287 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-10-14 23:11:09,287 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-10-14 23:11:09,287 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-10-14 23:11:09,287 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 23:11:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 23:11:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 23:11:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 23:11:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 23:11:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 23:11:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 23:11:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 23:11:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 23:11:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 23:11:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 23:11:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 23:11:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 23:11:09,290 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 23:11:09,290 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 23:11:09,290 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 23:11:09,290 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 23:11:09,290 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 23:11:09,290 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 23:11:09,291 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 23:11:09,291 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 23:11:09,291 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 23:11:09,291 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 23:11:09,291 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 23:11:09,291 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 23:11:09,292 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 23:11:09,292 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 23:11:09,292 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 23:11:09,292 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 23:11:09,292 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 23:11:09,292 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 23:11:09,292 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 23:11:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 23:11:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 23:11:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:11:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 23:11:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 23:11:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 23:11:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 23:11:09,294 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 23:11:09,294 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 23:11:09,294 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 23:11:09,294 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 23:11:09,294 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 23:11:09,294 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 23:11:09,294 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 23:11:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:11:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 23:11:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 23:11:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 23:11:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 23:11:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 23:11:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 23:11:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 23:11:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 23:11:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 23:11:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 23:11:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 23:11:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 23:11:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 23:11:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 23:11:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 23:11:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 23:11:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 23:11:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 23:11:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 23:11:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 23:11:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 23:11:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 23:11:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 23:11:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 23:11:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 23:11:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 23:11:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 23:11:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 23:11:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 23:11:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 23:11:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 23:11:09,300 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 23:11:09,300 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 23:11:09,300 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 23:11:09,300 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 23:11:09,300 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 23:11:09,300 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 23:11:09,300 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 23:11:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 23:11:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-14 23:11:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:11:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:11:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:11:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 23:11:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 23:11:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:11:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:11:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:11:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:11:09,695 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-14 23:11:09,864 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:11:09,865 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 23:11:09,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:11:09 BoogieIcfgContainer [2019-10-14 23:11:09,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:11:09,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:11:09,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:11:09,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:11:09,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:11:08" (1/3) ... [2019-10-14 23:11:09,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664d9e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:11:09, skipping insertion in model container [2019-10-14 23:11:09,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:09" (2/3) ... [2019-10-14 23:11:09,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664d9e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:11:09, skipping insertion in model container [2019-10-14 23:11:09,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:11:09" (3/3) ... [2019-10-14 23:11:09,875 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2019-10-14 23:11:09,885 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:11:09,892 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:11:09,902 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:11:09,922 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:11:09,922 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:11:09,922 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:11:09,922 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:11:09,922 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:11:09,923 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:11:09,923 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:11:09,923 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:11:09,939 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-14 23:11:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 23:11:09,945 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:09,946 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:09,947 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:09,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:09,952 INFO L82 PathProgramCache]: Analyzing trace with hash 209903222, now seen corresponding path program 1 times [2019-10-14 23:11:09,960 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:09,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329803637] [2019-10-14 23:11:09,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:09,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:09,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:10,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329803637] [2019-10-14 23:11:10,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:10,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:11:10,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10857181] [2019-10-14 23:11:10,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:11:10,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:10,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:11:10,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:11:10,151 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-10-14 23:11:10,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:10,285 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-10-14 23:11:10,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:11:10,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-14 23:11:10,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:10,297 INFO L225 Difference]: With dead ends: 52 [2019-10-14 23:11:10,297 INFO L226 Difference]: Without dead ends: 23 [2019-10-14 23:11:10,305 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:11:10,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-14 23:11:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-14 23:11:10,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-14 23:11:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-10-14 23:11:10,342 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2019-10-14 23:11:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:10,343 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-10-14 23:11:10,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:11:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-10-14 23:11:10,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:11:10,344 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:10,344 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:10,344 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:10,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:10,345 INFO L82 PathProgramCache]: Analyzing trace with hash 919137993, now seen corresponding path program 1 times [2019-10-14 23:11:10,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:10,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851114899] [2019-10-14 23:11:10,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:10,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:10,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:10,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851114899] [2019-10-14 23:11:10,500 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:10,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:11:10,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935777830] [2019-10-14 23:11:10,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:11:10,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:10,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:11:10,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:11:10,504 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2019-10-14 23:11:10,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:10,592 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2019-10-14 23:11:10,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:11:10,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-14 23:11:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:10,594 INFO L225 Difference]: With dead ends: 51 [2019-10-14 23:11:10,594 INFO L226 Difference]: Without dead ends: 36 [2019-10-14 23:11:10,595 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:11:10,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-14 23:11:10,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-10-14 23:11:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 23:11:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-10-14 23:11:10,603 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 16 [2019-10-14 23:11:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:10,603 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-10-14 23:11:10,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:11:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-10-14 23:11:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:11:10,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:10,605 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:10,605 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:10,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:10,605 INFO L82 PathProgramCache]: Analyzing trace with hash 919131049, now seen corresponding path program 1 times [2019-10-14 23:11:10,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:10,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318363046] [2019-10-14 23:11:10,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:10,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:10,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:10,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318363046] [2019-10-14 23:11:10,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:10,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:11:10,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202516221] [2019-10-14 23:11:10,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:11:10,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:10,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:11:10,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:11:10,707 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 6 states. [2019-10-14 23:11:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:10,852 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-10-14 23:11:10,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:11:10,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-14 23:11:10,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:10,855 INFO L225 Difference]: With dead ends: 61 [2019-10-14 23:11:10,855 INFO L226 Difference]: Without dead ends: 46 [2019-10-14 23:11:10,856 INFO L600 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-10-14 23:11:10,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-14 23:11:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2019-10-14 23:11:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-14 23:11:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-10-14 23:11:10,870 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 16 [2019-10-14 23:11:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:10,872 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-10-14 23:11:10,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:11:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-10-14 23:11:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:11:10,879 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:10,880 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:10,880 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:10,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:10,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1446652468, now seen corresponding path program 1 times [2019-10-14 23:11:10,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:10,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795087312] [2019-10-14 23:11:10,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:10,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:10,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:11,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795087312] [2019-10-14 23:11:11,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161948238] [2019-10-14 23:11:11,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:11,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-14 23:11:11,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:11,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:11,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:11:11,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:11,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-14 23:11:11,496 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,497 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:11:11,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-10-14 23:11:11,567 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:11:11,568 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-10-14 23:11:11,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-10-14 23:11:11,615 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-10-14 23:11:11,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:11,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-10-14 23:11:11,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-14 23:11:11,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-10-14 23:11:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:11,716 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:11,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2019-10-14 23:11:11,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102755113] [2019-10-14 23:11:11,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 23:11:11,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:11,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 23:11:11,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-10-14 23:11:11,722 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 18 states. [2019-10-14 23:11:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:12,466 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-10-14 23:11:12,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 23:11:12,468 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-10-14 23:11:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:12,470 INFO L225 Difference]: With dead ends: 90 [2019-10-14 23:11:12,470 INFO L226 Difference]: Without dead ends: 88 [2019-10-14 23:11:12,472 INFO L600 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-10-14 23:11:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-14 23:11:12,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 57. [2019-10-14 23:11:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-14 23:11:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-10-14 23:11:12,486 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 22 [2019-10-14 23:11:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:12,487 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-10-14 23:11:12,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 23:11:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-10-14 23:11:12,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:11:12,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:12,488 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:12,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:12,692 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:12,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:12,693 INFO L82 PathProgramCache]: Analyzing trace with hash -825238535, now seen corresponding path program 1 times [2019-10-14 23:11:12,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:12,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269275597] [2019-10-14 23:11:12,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:12,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:12,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:12,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269275597] [2019-10-14 23:11:12,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225392095] [2019-10-14 23:11:12,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:13,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-14 23:11:13,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:13,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:13,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:13,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,063 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:11:13,109 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:13,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:11:13,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:13,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,118 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-10-14 23:11:13,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:11:13,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:13,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:11:13,168 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:13,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,179 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-10-14 23:11:13,212 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_18|], 2=[|v_#memory_$Pointer$.base_15|, |v_#memory_$Pointer$.offset_14|]} [2019-10-14 23:11:13,220 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-10-14 23:11:13,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:13,259 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:13,260 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-10-14 23:11:13,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:13,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:13,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:13,267 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-10-14 23:11:13,304 INFO L567 ElimStorePlain]: treesize reduction 188, result has 28.5 percent of original size [2019-10-14 23:11:13,318 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-10-14 23:11:13,319 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:13,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,328 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-10-14 23:11:13,367 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-10-14 23:11:13,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:13,381 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-10-14 23:11:13,382 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:13,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,390 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-10-14 23:11:13,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 23:11:13,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:13,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-14 23:11:13,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:13,403 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:13,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2019-10-14 23:11:13,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388533417] [2019-10-14 23:11:13,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-14 23:11:13,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:13,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-14 23:11:13,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:11:13,406 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 17 states. [2019-10-14 23:11:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:13,924 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2019-10-14 23:11:13,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:11:13,924 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-10-14 23:11:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:13,926 INFO L225 Difference]: With dead ends: 84 [2019-10-14 23:11:13,926 INFO L226 Difference]: Without dead ends: 64 [2019-10-14 23:11:13,927 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2019-10-14 23:11:13,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-14 23:11:13,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2019-10-14 23:11:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-14 23:11:13,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2019-10-14 23:11:13,936 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 27 [2019-10-14 23:11:13,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:13,936 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2019-10-14 23:11:13,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-14 23:11:13,937 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2019-10-14 23:11:13,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:11:13,938 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:13,938 INFO L380 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-10-14 23:11:14,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:14,140 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:14,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:14,141 INFO L82 PathProgramCache]: Analyzing trace with hash 700551310, now seen corresponding path program 2 times [2019-10-14 23:11:14,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:14,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470684321] [2019-10-14 23:11:14,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:14,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:14,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 23:11:14,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470684321] [2019-10-14 23:11:14,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:14,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:11:14,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453408959] [2019-10-14 23:11:14,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:11:14,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:14,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:11:14,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:11:14,204 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 4 states. [2019-10-14 23:11:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:14,279 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2019-10-14 23:11:14,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:11:14,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-10-14 23:11:14,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:14,281 INFO L225 Difference]: With dead ends: 90 [2019-10-14 23:11:14,281 INFO L226 Difference]: Without dead ends: 55 [2019-10-14 23:11:14,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:11:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-14 23:11:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-10-14 23:11:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-14 23:11:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-10-14 23:11:14,288 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 33 [2019-10-14 23:11:14,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:14,288 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-10-14 23:11:14,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:11:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-10-14 23:11:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:11:14,290 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:14,290 INFO L380 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-10-14 23:11:14,290 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:14,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:14,291 INFO L82 PathProgramCache]: Analyzing trace with hash -887796592, now seen corresponding path program 1 times [2019-10-14 23:11:14,291 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:14,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423082578] [2019-10-14 23:11:14,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:14,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:14,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:14,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423082578] [2019-10-14 23:11:14,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683927855] [2019-10-14 23:11:14,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:14,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-14 23:11:14,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:14,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:14,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:14,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:14,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:14,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:15,059 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:11:15,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-10-14 23:11:15,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-10-14 23:11:15,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,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-10-14 23:11:15,126 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,142 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:41 [2019-10-14 23:11:15,183 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_19|], 2=[|v_#memory_$Pointer$.base_17|, |v_#memory_$Pointer$.offset_16|]} [2019-10-14 23:11:15,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:15,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:15,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 35 treesize of output 17 [2019-10-14 23:11:15,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,248 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-10-14 23:11:15,249 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,266 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:36 [2019-10-14 23:11:15,388 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_20|], 2=[|v_#memory_$Pointer$.offset_17|, |v_#memory_$Pointer$.base_18|]} [2019-10-14 23:11:15,394 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-10-14 23:11:15,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,427 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-10-14 23:11:15,428 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,457 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:15,474 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,474 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-10-14 23:11:15,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:15,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:15,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:15,478 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-10-14 23:11:15,532 INFO L567 ElimStorePlain]: treesize reduction 73, result has 51.0 percent of original size [2019-10-14 23:11:15,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,534 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:128, output treesize:62 [2019-10-14 23:11:15,591 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_19|, |v_#memory_int_21|], 5=[|v_#memory_$Pointer$.offset_18|]} [2019-10-14 23:11:15,610 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,610 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-10-14 23:11:15,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:15,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:15,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:15,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:15,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:15,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:15,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:15,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:15,620 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:15,673 INFO L567 ElimStorePlain]: treesize reduction 40, result has 64.9 percent of original size [2019-10-14 23:11:15,694 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10-14 23:11:15,696 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,736 INFO L567 ElimStorePlain]: treesize reduction 12, result has 86.0 percent of original size [2019-10-14 23:11:15,775 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,776 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-10-14 23:11:15,777 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:15,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:15,796 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:122, output treesize:56 [2019-10-14 23:11:15,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:15,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:15,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:15,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:16,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:16,152 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, v_prenex_2], 1=[|#memory_$Pointer$.offset|, v_prenex_3]} [2019-10-14 23:11:16,157 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-10-14 23:11:16,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:16,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:16,187 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-10-14 23:11:16,188 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:16,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:16,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:16,221 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-10-14 23:11:16,222 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:16,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:16,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:16,248 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-10-14 23:11:16,249 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:16,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:16,267 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-10-14 23:11:16,268 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:110, output treesize:44 [2019-10-14 23:11:16,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:16,506 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:16,507 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-10-14 23:11:16,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:16,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:16,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:16,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2019-10-14 23:11:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:16,540 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:16,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2019-10-14 23:11:16,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709659406] [2019-10-14 23:11:16,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-14 23:11:16,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:16,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-14 23:11:16,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2019-10-14 23:11:16,542 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 31 states. [2019-10-14 23:11:17,552 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-10-14 23:11:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:18,428 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2019-10-14 23:11:18,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-14 23:11:18,432 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 33 [2019-10-14 23:11:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:18,434 INFO L225 Difference]: With dead ends: 81 [2019-10-14 23:11:18,434 INFO L226 Difference]: Without dead ends: 79 [2019-10-14 23:11:18,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=322, Invalid=2030, Unknown=0, NotChecked=0, Total=2352 [2019-10-14 23:11:18,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-14 23:11:18,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2019-10-14 23:11:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-14 23:11:18,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-10-14 23:11:18,444 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 33 [2019-10-14 23:11:18,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:18,444 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-10-14 23:11:18,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-14 23:11:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-10-14 23:11:18,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 23:11:18,445 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:18,445 INFO L380 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-10-14 23:11:18,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:18,647 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:18,647 INFO L82 PathProgramCache]: Analyzing trace with hash -96612664, now seen corresponding path program 1 times [2019-10-14 23:11:18,648 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:18,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165604257] [2019-10-14 23:11:18,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:18,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:18,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:19,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165604257] [2019-10-14 23:11:19,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307302154] [2019-10-14 23:11:19,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:19,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-14 23:11:19,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:19,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:19,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-14 23:11:19,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:19,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 23:11:19,317 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:19,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,344 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-10-14 23:11:19,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-10-14 23:11:19,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:19,380 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-10-14 23:11:19,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-14 23:11:19,418 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-10-14 23:11:19,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-10-14 23:11:19,475 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 23:11:19,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30 [2019-10-14 23:11:19,546 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:11:19,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 23:11:19,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:19,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-10-14 23:11:19,597 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-10-14 23:11:19,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:19,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:37 [2019-10-14 23:11:19,742 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:11:19,742 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-10-14 23:11:19,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:19,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:40 [2019-10-14 23:11:19,869 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,870 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-10-14 23:11:19,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,945 INFO L567 ElimStorePlain]: treesize reduction 44, result has 59.3 percent of original size [2019-10-14 23:11:19,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,951 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-10-14 23:11:19,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:48, output treesize:64 [2019-10-14 23:11:19,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:20,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:20,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:20,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:20,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:20,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:20,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:20,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:20,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:20,338 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-10-14 23:11:20,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,381 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.1 percent of original size [2019-10-14 23:11:20,390 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:20,391 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-10-14 23:11:20,391 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,426 INFO L567 ElimStorePlain]: treesize reduction 4, result has 89.2 percent of original size [2019-10-14 23:11:20,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,428 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:83, output treesize:3 [2019-10-14 23:11:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:20,437 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:20,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2019-10-14 23:11:20,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974501723] [2019-10-14 23:11:20,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-14 23:11:20,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:20,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-14 23:11:20,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=773, Unknown=0, NotChecked=0, Total=930 [2019-10-14 23:11:20,439 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 31 states. [2019-10-14 23:11:21,531 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-14 23:11:21,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:21,901 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2019-10-14 23:11:21,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-14 23:11:21,902 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 34 [2019-10-14 23:11:21,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:21,903 INFO L225 Difference]: With dead ends: 87 [2019-10-14 23:11:21,903 INFO L226 Difference]: Without dead ends: 85 [2019-10-14 23:11:21,904 INFO L600 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-10-14 23:11:21,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-14 23:11:21,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 68. [2019-10-14 23:11:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-14 23:11:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2019-10-14 23:11:21,913 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 34 [2019-10-14 23:11:21,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:21,913 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2019-10-14 23:11:21,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-14 23:11:21,914 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2019-10-14 23:11:21,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 23:11:21,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:21,915 INFO L380 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-10-14 23:11:22,119 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:22,122 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:22,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:22,122 INFO L82 PathProgramCache]: Analyzing trace with hash -862472195, now seen corresponding path program 1 times [2019-10-14 23:11:22,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:22,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957457084] [2019-10-14 23:11:22,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:22,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:22,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:22,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957457084] [2019-10-14 23:11:22,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116508280] [2019-10-14 23:11:22,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:23,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-14 23:11:23,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:23,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:23,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:23,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:23,099 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:23,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:23,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,126 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-10-14 23:11:23,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-10-14 23:11:23,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:11:23,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:23,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:11:23,209 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:23,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,230 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:48 [2019-10-14 23:11:23,307 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-10-14 23:11:23,308 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-10-14 23:11:23,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,347 INFO L567 ElimStorePlain]: treesize reduction 10, result has 83.6 percent of original size [2019-10-14 23:11:23,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-14 23:11:23,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:23,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,367 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:36 [2019-10-14 23:11:23,407 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:23,408 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-10-14 23:11:23,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:23,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:49 [2019-10-14 23:11:23,491 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:23,491 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-10-14 23:11:23,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:23,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:23,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 23:11:23,546 INFO L567 ElimStorePlain]: treesize reduction 130, result has 48.6 percent of original size [2019-10-14 23:11:23,550 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-10-14 23:11:23,551 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:23,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,570 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:127 [2019-10-14 23:11:23,623 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_29|], 6=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_23|]} [2019-10-14 23:11:23,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10-14 23:11:23,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:23,707 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:23,708 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-10-14 23:11:23,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:23,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:23,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:23,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:23,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:23,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:23,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:23,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:23,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:23,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:23,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:23,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:23,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:23,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:23,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:23,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:23,721 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-10-14 23:11:23,803 INFO L567 ElimStorePlain]: treesize reduction 1740, result has 9.9 percent of original size [2019-10-14 23:11:23,843 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:23,844 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-10-14 23:11:23,846 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,882 INFO L567 ElimStorePlain]: treesize reduction 100, result has 47.4 percent of original size [2019-10-14 23:11:23,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,883 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:292, output treesize:90 [2019-10-14 23:11:24,147 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:24,148 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-10-14 23:11:24,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:24,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:24,150 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:24,176 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-10-14 23:11:24,179 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-10-14 23:11:24,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:24,189 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-10-14 23:11:24,190 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:18 [2019-10-14 23:11:24,234 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:24,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-10-14 23:11:24,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,244 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-10-14 23:11:24,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-10-14 23:11:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:24,255 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:24,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 30 [2019-10-14 23:11:24,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951063982] [2019-10-14 23:11:24,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-14 23:11:24,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:24,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-14 23:11:24,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2019-10-14 23:11:24,256 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 30 states. [2019-10-14 23:11:24,895 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2019-10-14 23:11:25,518 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-10-14 23:11:26,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:26,025 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2019-10-14 23:11:26,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 23:11:26,025 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 38 [2019-10-14 23:11:26,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:26,026 INFO L225 Difference]: With dead ends: 93 [2019-10-14 23:11:26,027 INFO L226 Difference]: Without dead ends: 68 [2019-10-14 23:11:26,029 INFO L600 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-10-14 23:11:26,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-14 23:11:26,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2019-10-14 23:11:26,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-14 23:11:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-10-14 23:11:26,041 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 38 [2019-10-14 23:11:26,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:26,042 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-10-14 23:11:26,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-14 23:11:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-10-14 23:11:26,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-14 23:11:26,043 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:26,043 INFO L380 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-10-14 23:11:26,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:26,244 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:26,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:26,244 INFO L82 PathProgramCache]: Analyzing trace with hash 201323493, now seen corresponding path program 2 times [2019-10-14 23:11:26,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:26,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064921471] [2019-10-14 23:11:26,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:26,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:26,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:27,141 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:27,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064921471] [2019-10-14 23:11:27,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142650440] [2019-10-14 23:11:27,141 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-10-14 23:11:27,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:11:27,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:27,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 74 conjunts are in the unsatisfiable core [2019-10-14 23:11:27,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:27,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:27,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-14 23:11:27,368 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:27,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,396 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-14 23:11:27,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-14 23:11:27,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:11:27,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:11:27,472 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,489 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:57 [2019-10-14 23:11:27,529 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_30|], 2=[|v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_25|]} [2019-10-14 23:11:27,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:27,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:27,574 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-10-14 23:11:27,575 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:27,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 34 treesize of output 16 [2019-10-14 23:11:27,614 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,629 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:98, output treesize:58 [2019-10-14 23:11:27,689 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,690 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-10-14 23:11:27,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:56 [2019-10-14 23:11:27,754 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 2=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_26|]} [2019-10-14 23:11:27,760 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-10-14 23:11:27,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,785 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:27,798 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,798 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-10-14 23:11:27,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:27,800 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,861 INFO L567 ElimStorePlain]: treesize reduction 30, result has 74.8 percent of original size [2019-10-14 23:11:27,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:27,866 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-10-14 23:11:27,867 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,887 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:142, output treesize:73 [2019-10-14 23:11:27,929 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_27|, |v_#memory_int_32|], 6=[|v_#memory_$Pointer$.base_29|]} [2019-10-14 23:11:27,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:27,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-14 23:11:27,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:27,966 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-10-14 23:11:27,966 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,997 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:28,050 INFO L341 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size [2019-10-14 23:11:28,051 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-10-14 23:11:28,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,056 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:28,103 INFO L567 ElimStorePlain]: treesize reduction 26, result has 66.2 percent of original size [2019-10-14 23:11:28,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:28,104 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:114, output treesize:60 [2019-10-14 23:11:28,242 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_28|], 6=[|v_#memory_int_33|, |v_#memory_$Pointer$.base_30|]} [2019-10-14 23:11:28,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, 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-10-14 23:11:28,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:28,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:28,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:28,290 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-10-14 23:11:28,291 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:28,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:28,317 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:28,371 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:28,372 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-10-14 23:11:28,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:28,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:28,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:28,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,385 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 5 xjuncts. [2019-10-14 23:11:28,547 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-10-14 23:11:28,547 INFO L567 ElimStorePlain]: treesize reduction 1145, result has 10.5 percent of original size [2019-10-14 23:11:28,548 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-10-14 23:11:28,548 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:211, output treesize:115 [2019-10-14 23:11:28,608 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_31|], 6=[|v_#memory_$Pointer$.offset_29|, |v_#memory_int_34|]} [2019-10-14 23:11:28,649 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:28,649 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-10-14 23:11:28,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:28,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:28,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:28,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:28,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:28,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:28,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:28,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:28,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:28,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:28,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:28,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:28,683 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:28,793 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-10-14 23:11:28,793 INFO L567 ElimStorePlain]: treesize reduction 100, result has 50.0 percent of original size [2019-10-14 23:11:28,835 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:28,835 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-10-14 23:11:28,837 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:28,907 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.2 percent of original size [2019-10-14 23:11:28,956 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:28,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10-14 23:11:28,957 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:29,043 INFO L567 ElimStorePlain]: treesize reduction 28, result has 75.2 percent of original size [2019-10-14 23:11:29,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:29,048 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:193, output treesize:131 [2019-10-14 23:11:29,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,623 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-10-14 23:11:29,982 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-10-14 23:11:29,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 23:11:29,995 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-10-14 23:11:30,008 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-10-14 23:11:30,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,127 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-10-14 23:11:30,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,141 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,142 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-10-14 23:11:30,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:30,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:30,145 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:30,451 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 116 [2019-10-14 23:11:30,451 INFO L567 ElimStorePlain]: treesize reduction 8, result has 97.5 percent of original size [2019-10-14 23:11:30,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:30,468 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-10-14 23:11:30,469 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,584 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-10-14 23:11:30,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,601 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,602 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-10-14 23:11:30,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:30,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:30,605 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:30,831 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2019-10-14 23:11:30,832 INFO L567 ElimStorePlain]: treesize reduction 8, result has 97.1 percent of original size [2019-10-14 23:11:30,844 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,845 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-10-14 23:11:30,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:30,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:30,848 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:31,062 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 92 [2019-10-14 23:11:31,062 INFO L567 ElimStorePlain]: treesize reduction 8, result has 96.5 percent of original size [2019-10-14 23:11:31,077 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:31,078 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-10-14 23:11:31,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:31,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:31,081 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:31,277 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2019-10-14 23:11:31,277 INFO L567 ElimStorePlain]: treesize reduction 8, result has 95.5 percent of original size [2019-10-14 23:11:31,287 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-10-14 23:11:31,287 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:31,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:31,382 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-10-14 23:11:31,383 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:31,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:31,461 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-10-14 23:11:31,461 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 15 variables, input treesize:348, output treesize:131 [2019-10-14 23:11:31,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:31,840 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:31,840 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-10-14 23:11:31,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:31,857 INFO L567 ElimStorePlain]: treesize reduction 8, result has 66.7 percent of original size [2019-10-14 23:11:31,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:31,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2019-10-14 23:11:31,876 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:31,876 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:31,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2019-10-14 23:11:31,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053596889] [2019-10-14 23:11:31,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-14 23:11:31,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:31,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-14 23:11:31,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1297, Unknown=0, NotChecked=0, Total=1482 [2019-10-14 23:11:31,882 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 39 states. [2019-10-14 23:11:33,011 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-10-14 23:11:33,282 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-10-14 23:11:33,436 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-10-14 23:11:33,597 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-10-14 23:11:34,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:34,097 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-10-14 23:11:34,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-14 23:11:34,098 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-10-14 23:11:34,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:34,099 INFO L225 Difference]: With dead ends: 91 [2019-10-14 23:11:34,099 INFO L226 Difference]: Without dead ends: 89 [2019-10-14 23:11:34,100 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=346, Invalid=2306, Unknown=0, NotChecked=0, Total=2652 [2019-10-14 23:11:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-14 23:11:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 63. [2019-10-14 23:11:34,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-14 23:11:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-14 23:11:34,108 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 39 [2019-10-14 23:11:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:34,109 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-14 23:11:34,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-14 23:11:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-14 23:11:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 23:11:34,110 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:34,110 INFO L380 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-10-14 23:11:34,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:34,319 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:34,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:34,320 INFO L82 PathProgramCache]: Analyzing trace with hash -435462959, now seen corresponding path program 2 times [2019-10-14 23:11:34,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:34,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187926832] [2019-10-14 23:11:34,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:34,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:34,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:34,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187926832] [2019-10-14 23:11:34,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084485689] [2019-10-14 23:11:34,913 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:35,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:11:35,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:35,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-14 23:11:35,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:35,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:35,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:35,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:35,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 23:11:35,157 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:35,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,187 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-10-14 23:11:35,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-10-14 23:11:35,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:35,241 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-10-14 23:11:35,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-14 23:11:35,284 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-10-14 23:11:35,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,299 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-10-14 23:11:35,369 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,370 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-10-14 23:11:35,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,424 INFO L567 ElimStorePlain]: treesize reduction 28, result has 61.6 percent of original size [2019-10-14 23:11:35,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:45 [2019-10-14 23:11:35,484 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:11:35,485 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-10-14 23:11:35,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:35,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:45 [2019-10-14 23:11:35,546 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-10-14 23:11:35,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:35,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:52 [2019-10-14 23:11:35,645 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,645 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-10-14 23:11:35,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,669 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-10-14 23:11:35,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:49 [2019-10-14 23:11:35,737 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:11:35,737 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-10-14 23:11:35,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:35,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:68, output treesize:49 [2019-10-14 23:11:35,808 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-10-14 23:11:35,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:35,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:56 [2019-10-14 23:11:35,964 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:11:35,964 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-10-14 23:11:35,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,993 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-10-14 23:11:35,993 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:78, output treesize:59 [2019-10-14 23:11:36,160 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:36,161 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-10-14 23:11:36,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:36,273 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-10-14 23:11:36,274 INFO L567 ElimStorePlain]: treesize reduction 60, result has 61.0 percent of original size [2019-10-14 23:11:36,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,283 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-10-14 23:11:36,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:70, output treesize:94 [2019-10-14 23:11:36,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:36,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:38,674 WARN L191 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-10-14 23:11:38,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:39,164 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 72 [2019-10-14 23:11:39,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:39,182 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-10-14 23:11:39,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:39,187 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-10-14 23:11:39,187 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:39,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:39,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:39,213 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 12 variables, input treesize:121, output treesize:3 [2019-10-14 23:11:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:39,231 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:39,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2019-10-14 23:11:39,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810438565] [2019-10-14 23:11:39,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-14 23:11:39,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:39,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-14 23:11:39,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2019-10-14 23:11:39,233 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 36 states. [2019-10-14 23:11:40,775 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-10-14 23:11:41,066 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2019-10-14 23:11:41,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:41,397 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2019-10-14 23:11:41,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-14 23:11:41,398 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2019-10-14 23:11:41,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:41,399 INFO L225 Difference]: With dead ends: 91 [2019-10-14 23:11:41,399 INFO L226 Difference]: Without dead ends: 89 [2019-10-14 23:11:41,401 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=516, Invalid=2454, Unknown=0, NotChecked=0, Total=2970 [2019-10-14 23:11:41,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-14 23:11:41,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2019-10-14 23:11:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-14 23:11:41,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-14 23:11:41,408 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 40 [2019-10-14 23:11:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:41,408 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-14 23:11:41,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-14 23:11:41,408 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-14 23:11:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-14 23:11:41,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:41,410 INFO L380 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-10-14 23:11:41,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:41,614 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:41,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:41,615 INFO L82 PathProgramCache]: Analyzing trace with hash 407461320, now seen corresponding path program 2 times [2019-10-14 23:11:41,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:41,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923317290] [2019-10-14 23:11:41,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:41,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:41,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:42,286 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-10-14 23:11:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:42,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923317290] [2019-10-14 23:11:42,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849357296] [2019-10-14 23:11:42,722 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-10-14 23:11:42,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:11:42,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:42,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 80 conjunts are in the unsatisfiable core [2019-10-14 23:11:42,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:42,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:42,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:42,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:42,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:42,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-14 23:11:42,928 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:42,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:42,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:42,956 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-10-14 23:11:42,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:42,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-10-14 23:11:42,993 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-10-14 23:11:42,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:43,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:43,016 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-10-14 23:11:43,017 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:43,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:43,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:43,034 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-10-14 23:11:43,104 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-10-14 23:11:43,104 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-10-14 23:11:43,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:43,137 INFO L567 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-10-14 23:11:43,143 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-10-14 23:11:43,144 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:43,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:43,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:43,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:32 [2019-10-14 23:11:43,225 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:43,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-14 23:11:43,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:43,280 INFO L567 ElimStorePlain]: treesize reduction 40, result has 58.8 percent of original size [2019-10-14 23:11:43,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:43,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:57 [2019-10-14 23:11:43,361 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:43,362 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-10-14 23:11:43,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:43,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:43,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 23:11:43,439 INFO L567 ElimStorePlain]: treesize reduction 113, result has 51.5 percent of original size [2019-10-14 23:11:43,442 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-10-14 23:11:43,443 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:43,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:43,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:43,471 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:119 [2019-10-14 23:11:43,533 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 6=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_34|]} [2019-10-14 23:11:43,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:43,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:43,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:43,654 INFO L341 Elim1Store]: treesize reduction 52, result has 54.0 percent of original size [2019-10-14 23:11:43,655 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-10-14 23:11:43,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:43,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:43,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:43,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:43,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:43,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:43,658 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:43,744 INFO L567 ElimStorePlain]: treesize reduction 40, result has 68.3 percent of original size [2019-10-14 23:11:43,749 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-10-14 23:11:43,749 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:43,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:43,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:43,774 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:160, output treesize:84 [2019-10-14 23:11:43,868 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:43,868 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-10-14 23:11:43,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:43,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:43,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:43,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:92, output treesize:84 [2019-10-14 23:11:43,964 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_45|], 6=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_35|]} [2019-10-14 23:11:43,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:43,969 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-10-14 23:11:43,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:44,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:44,080 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:44,080 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-10-14 23:11:44,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:44,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,089 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-14 23:11:44,223 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-14 23:11:44,223 INFO L567 ElimStorePlain]: treesize reduction 507, result has 35.9 percent of original size [2019-10-14 23:11:44,281 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:44,282 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-10-14 23:11:44,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:44,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,295 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:44,540 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-10-14 23:11:44,541 INFO L567 ElimStorePlain]: treesize reduction 1306, result has 17.0 percent of original size [2019-10-14 23:11:44,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:44,542 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:390, output treesize:330 [2019-10-14 23:11:44,621 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_46|], 12=[|v_#memory_$Pointer$.offset_36|, |v_#memory_$Pointer$.base_40|]} [2019-10-14 23:11:44,626 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-10-14 23:11:44,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:44,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:44,735 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:44,736 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-10-14 23:11:44,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,740 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:44,824 INFO L567 ElimStorePlain]: treesize reduction 368, result has 52.9 percent of original size [2019-10-14 23:11:44,898 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:44,899 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-10-14 23:11:44,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:44,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:44,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:44,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:44,910 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:45,032 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-10-14 23:11:45,032 INFO L567 ElimStorePlain]: treesize reduction 3444, result has 8.0 percent of original size [2019-10-14 23:11:45,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:45,033 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:739, output treesize:297 [2019-10-14 23:11:45,489 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:45,489 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-10-14 23:11:45,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:45,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:45,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:45,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:45,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:45,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:45,495 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:45,558 INFO L567 ElimStorePlain]: treesize reduction 72, result has 53.8 percent of original size [2019-10-14 23:11:45,568 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-10-14 23:11:45,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:45,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:45,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:45,585 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:297, output treesize:30 [2019-10-14 23:11:45,652 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:45,652 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-10-14 23:11:45,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:45,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:45,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:45,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2019-10-14 23:11:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:45,676 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:45,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 36 [2019-10-14 23:11:45,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352583512] [2019-10-14 23:11:45,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-14 23:11:45,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:45,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-14 23:11:45,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1134, Unknown=0, NotChecked=0, Total=1260 [2019-10-14 23:11:45,677 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 36 states.