/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:14:20,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:14:20,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:14:20,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:14:20,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:14:20,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:14:20,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:14:20,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:14:20,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:14:20,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:14:20,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:14:20,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:14:20,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:14:20,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:14:20,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:14:20,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:14:20,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:14:20,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:14:20,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:14:20,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:14:20,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:14:20,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:14:20,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:14:20,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:14:20,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:14:20,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:14:20,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:14:20,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:14:20,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:14:20,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:14:20,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:14:20,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:14:20,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:14:20,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:14:20,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:14:20,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:14:20,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:14:20,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:14:20,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:14:20,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:14:20,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:14:20,395 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 21:14:20,408 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:14:20,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:14:20,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:14:20,410 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:14:20,410 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:14:20,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:14:20,410 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:14:20,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:14:20,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:14:20,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:14:20,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:14:20,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:14:20,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:14:20,412 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:14:20,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:14:20,412 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:14:20,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:14:20,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:14:20,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:14:20,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:14:20,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:14:20,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:14:20,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:14:20,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:14:20,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:14:20,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:14:20,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:14:20,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:14:20,415 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:14:20,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:14:20,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:14:20,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:14:20,700 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:14:20,700 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:14:20,701 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i [2019-11-06 21:14:20,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c528e1a82/2aeb37bfbab14051b8d016ca0db4fdce/FLAG25354a293 [2019-11-06 21:14:21,305 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:14:21,306 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i [2019-11-06 21:14:21,328 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c528e1a82/2aeb37bfbab14051b8d016ca0db4fdce/FLAG25354a293 [2019-11-06 21:14:21,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c528e1a82/2aeb37bfbab14051b8d016ca0db4fdce [2019-11-06 21:14:21,580 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:14:21,581 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:14:21,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:14:21,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:14:21,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:14:21,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:21" (1/1) ... [2019-11-06 21:14:21,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3743a8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:21, skipping insertion in model container [2019-11-06 21:14:21,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:21" (1/1) ... [2019-11-06 21:14:21,598 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:14:21,659 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:14:22,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:14:22,118 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:14:22,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:14:22,288 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:14:22,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:22 WrapperNode [2019-11-06 21:14:22,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:14:22,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:14:22,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:14:22,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:14:22,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:22" (1/1) ... [2019-11-06 21:14:22,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:22" (1/1) ... [2019-11-06 21:14:22,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:22" (1/1) ... [2019-11-06 21:14:22,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:22" (1/1) ... [2019-11-06 21:14:22,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:22" (1/1) ... [2019-11-06 21:14:22,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:22" (1/1) ... [2019-11-06 21:14:22,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:22" (1/1) ... [2019-11-06 21:14:22,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:14:22,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:14:22,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:14:22,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:14:22,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:14:22,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:14:22,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:14:22,436 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-06 21:14:22,436 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-06 21:14:22,436 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-06 21:14:22,436 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:14:22,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:14:22,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:14:22,437 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 21:14:22,437 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 21:14:22,437 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 21:14:22,437 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 21:14:22,438 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 21:14:22,438 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 21:14:22,438 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 21:14:22,438 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 21:14:22,438 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 21:14:22,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 21:14:22,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 21:14:22,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 21:14:22,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 21:14:22,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 21:14:22,439 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 21:14:22,440 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 21:14:22,440 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-06 21:14:22,440 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-06 21:14:22,440 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 21:14:22,440 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 21:14:22,440 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 21:14:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 21:14:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 21:14:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 21:14:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 21:14:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 21:14:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 21:14:22,442 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 21:14:22,442 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 21:14:22,442 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 21:14:22,442 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 21:14:22,442 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 21:14:22,442 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 21:14:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 21:14:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 21:14:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 21:14:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 21:14:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 21:14:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 21:14:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 21:14:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 21:14:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 21:14:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 21:14:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 21:14:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 21:14:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 21:14:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 21:14:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 21:14:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 21:14:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 21:14:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 21:14:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 21:14:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 21:14:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 21:14:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 21:14:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 21:14:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 21:14:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 21:14:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 21:14:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 21:14:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 21:14:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 21:14:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 21:14:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 21:14:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 21:14:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 21:14:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 21:14:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 21:14:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 21:14:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 21:14:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 21:14:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 21:14:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 21:14:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 21:14:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 21:14:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 21:14:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 21:14:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 21:14:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 21:14:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 21:14:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 21:14:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 21:14:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 21:14:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 21:14:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 21:14:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 21:14:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 21:14:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 21:14:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 21:14:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 21:14:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 21:14:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 21:14:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 21:14:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 21:14:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 21:14:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 21:14:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 21:14:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 21:14:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 21:14:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 21:14:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 21:14:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 21:14:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 21:14:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 21:14:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 21:14:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-06 21:14:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:14:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 21:14:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 21:14:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 21:14:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:14:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 21:14:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 21:14:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:14:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:14:22,768 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-06 21:14:23,102 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:14:23,102 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-06 21:14:23,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:23 BoogieIcfgContainer [2019-11-06 21:14:23,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:14:23,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:14:23,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:14:23,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:14:23,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:14:21" (1/3) ... [2019-11-06 21:14:23,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5134030e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:23, skipping insertion in model container [2019-11-06 21:14:23,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:22" (2/3) ... [2019-11-06 21:14:23,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5134030e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:23, skipping insertion in model container [2019-11-06 21:14:23,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:23" (3/3) ... [2019-11-06 21:14:23,125 INFO L109 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2019-11-06 21:14:23,137 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:14:23,149 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:14:23,163 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:14:23,216 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:14:23,216 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:14:23,216 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:14:23,217 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:14:23,225 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:14:23,226 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:14:23,226 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:14:23,226 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:14:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2019-11-06 21:14:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:14:23,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:23,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:23,264 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:23,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:23,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1575706012, now seen corresponding path program 1 times [2019-11-06 21:14:23,281 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:23,281 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039818150] [2019-11-06 21:14:23,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:14:23,463 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039818150] [2019-11-06 21:14:23,465 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:14:23,466 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:14:23,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610389593] [2019-11-06 21:14:23,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:14:23,474 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:23,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:14:23,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:14:23,493 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2019-11-06 21:14:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:23,735 INFO L93 Difference]: Finished difference Result 108 states and 166 transitions. [2019-11-06 21:14:23,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:14:23,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-06 21:14:23,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:23,746 INFO L225 Difference]: With dead ends: 108 [2019-11-06 21:14:23,747 INFO L226 Difference]: Without dead ends: 47 [2019-11-06 21:14:23,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:14:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-06 21:14:23,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-06 21:14:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-06 21:14:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2019-11-06 21:14:23,797 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 20 [2019-11-06 21:14:23,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:23,798 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2019-11-06 21:14:23,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:14:23,798 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2019-11-06 21:14:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:14:23,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:23,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:23,802 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:23,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:23,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1627887593, now seen corresponding path program 1 times [2019-11-06 21:14:23,803 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:23,804 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58140900] [2019-11-06 21:14:23,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:14:23,955 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58140900] [2019-11-06 21:14:23,955 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:14:23,956 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:14:23,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184633828] [2019-11-06 21:14:23,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:14:23,958 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:23,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:14:23,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:14:23,959 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand 4 states. [2019-11-06 21:14:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:24,095 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2019-11-06 21:14:24,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:14:24,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-06 21:14:24,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:24,099 INFO L225 Difference]: With dead ends: 75 [2019-11-06 21:14:24,099 INFO L226 Difference]: Without dead ends: 55 [2019-11-06 21:14:24,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:14:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-06 21:14:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-06 21:14:24,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-06 21:14:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2019-11-06 21:14:24,124 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 25 [2019-11-06 21:14:24,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:24,126 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2019-11-06 21:14:24,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:14:24,127 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2019-11-06 21:14:24,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:14:24,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:24,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:24,130 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:24,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:24,130 INFO L82 PathProgramCache]: Analyzing trace with hash -164754602, now seen corresponding path program 1 times [2019-11-06 21:14:24,131 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:24,131 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983248841] [2019-11-06 21:14:24,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:14:24,203 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983248841] [2019-11-06 21:14:24,203 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:14:24,203 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:14:24,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253262562] [2019-11-06 21:14:24,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:14:24,206 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:24,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:14:24,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:14:24,207 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand 4 states. [2019-11-06 21:14:24,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:24,361 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2019-11-06 21:14:24,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:14:24,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-06 21:14:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:24,364 INFO L225 Difference]: With dead ends: 93 [2019-11-06 21:14:24,364 INFO L226 Difference]: Without dead ends: 57 [2019-11-06 21:14:24,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:14:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-06 21:14:24,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-06 21:14:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-06 21:14:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2019-11-06 21:14:24,382 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 31 [2019-11-06 21:14:24,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:24,383 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2019-11-06 21:14:24,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:14:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2019-11-06 21:14:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:14:24,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:24,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:24,390 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:24,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:24,390 INFO L82 PathProgramCache]: Analyzing trace with hash -982403052, now seen corresponding path program 1 times [2019-11-06 21:14:24,390 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:24,390 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647511056] [2019-11-06 21:14:24,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:24,535 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647511056] [2019-11-06 21:14:24,536 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:14:24,536 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:14:24,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217879812] [2019-11-06 21:14:24,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:14:24,537 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:24,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:14:24,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:14:24,537 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand 6 states. [2019-11-06 21:14:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:24,767 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2019-11-06 21:14:24,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:14:24,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-06 21:14:24,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:24,769 INFO L225 Difference]: With dead ends: 82 [2019-11-06 21:14:24,769 INFO L226 Difference]: Without dead ends: 78 [2019-11-06 21:14:24,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:14:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-06 21:14:24,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2019-11-06 21:14:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-06 21:14:24,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2019-11-06 21:14:24,786 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 31 [2019-11-06 21:14:24,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:24,786 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2019-11-06 21:14:24,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:14:24,787 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2019-11-06 21:14:24,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 21:14:24,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:24,792 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:24,794 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:24,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:24,795 INFO L82 PathProgramCache]: Analyzing trace with hash 852152367, now seen corresponding path program 1 times [2019-11-06 21:14:24,795 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:24,796 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68975368] [2019-11-06 21:14:24,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:24,928 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68975368] [2019-11-06 21:14:24,929 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:14:24,929 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:14:24,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658774178] [2019-11-06 21:14:24,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:14:24,930 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:24,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:14:24,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:14:24,931 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 6 states. [2019-11-06 21:14:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:25,157 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2019-11-06 21:14:25,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:14:25,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-06 21:14:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:25,158 INFO L225 Difference]: With dead ends: 84 [2019-11-06 21:14:25,158 INFO L226 Difference]: Without dead ends: 76 [2019-11-06 21:14:25,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:14:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-06 21:14:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2019-11-06 21:14:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-06 21:14:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2019-11-06 21:14:25,166 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 33 [2019-11-06 21:14:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:25,166 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2019-11-06 21:14:25,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:14:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2019-11-06 21:14:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 21:14:25,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:25,168 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:25,168 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:25,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:25,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1876855343, now seen corresponding path program 1 times [2019-11-06 21:14:25,169 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:25,169 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827978398] [2019-11-06 21:14:25,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:25,251 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827978398] [2019-11-06 21:14:25,252 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:14:25,252 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:14:25,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017499891] [2019-11-06 21:14:25,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:14:25,253 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:25,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:14:25,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:14:25,255 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 6 states. [2019-11-06 21:14:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:25,434 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2019-11-06 21:14:25,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:14:25,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-06 21:14:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:25,436 INFO L225 Difference]: With dead ends: 84 [2019-11-06 21:14:25,436 INFO L226 Difference]: Without dead ends: 73 [2019-11-06 21:14:25,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:14:25,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-06 21:14:25,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2019-11-06 21:14:25,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-06 21:14:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2019-11-06 21:14:25,443 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 33 [2019-11-06 21:14:25,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:25,443 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2019-11-06 21:14:25,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:14:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2019-11-06 21:14:25,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 21:14:25,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:25,444 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:25,445 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:25,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:25,445 INFO L82 PathProgramCache]: Analyzing trace with hash -778946181, now seen corresponding path program 1 times [2019-11-06 21:14:25,445 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:25,445 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563947924] [2019-11-06 21:14:25,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:25,621 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563947924] [2019-11-06 21:14:25,621 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835964194] [2019-11-06 21:14:25,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:25,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-06 21:14:25,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:25,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:14:25,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:25,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:25,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:25,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 21:14:25,858 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:25,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:14:25,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:25,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:25,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:25,872 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:25,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:25,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:25,881 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-06 21:14:25,900 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:14:25,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:14:25,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:25,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:25,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:25,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-06 21:14:25,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 21:14:25,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:25,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:25,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:25,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-06 21:14:25,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-06 21:14:25,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:25,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:25,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:25,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-06 21:14:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:26,001 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:26,002 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-11-06 21:14:26,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667529191] [2019-11-06 21:14:26,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:14:26,003 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:26,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:14:26,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:14:26,003 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand 11 states. [2019-11-06 21:14:26,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:26,445 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2019-11-06 21:14:26,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:14:26,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-11-06 21:14:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:26,446 INFO L225 Difference]: With dead ends: 86 [2019-11-06 21:14:26,446 INFO L226 Difference]: Without dead ends: 82 [2019-11-06 21:14:26,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:14:26,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-06 21:14:26,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2019-11-06 21:14:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-06 21:14:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 95 transitions. [2019-11-06 21:14:26,454 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 95 transitions. Word has length 35 [2019-11-06 21:14:26,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:26,455 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 95 transitions. [2019-11-06 21:14:26,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:14:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 95 transitions. [2019-11-06 21:14:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 21:14:26,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:26,456 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:26,659 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:26,660 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:26,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:26,661 INFO L82 PathProgramCache]: Analyzing trace with hash 84455483, now seen corresponding path program 1 times [2019-11-06 21:14:26,661 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:26,661 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74410033] [2019-11-06 21:14:26,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:26,769 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74410033] [2019-11-06 21:14:26,769 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335812041] [2019-11-06 21:14:26,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:26,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-06 21:14:26,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:26,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:14:26,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:26,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:26,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:26,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 21:14:26,908 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:26,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:14:26,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:26,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:26,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:26,922 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:26,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:26,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:26,930 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-06 21:14:26,947 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:14:26,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:14:26,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:26,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:26,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:26,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-06 21:14:26,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 21:14:26,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:26,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:26,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:26,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-06 21:14:27,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-06 21:14:27,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:27,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:27,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:27,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-06 21:14:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:27,041 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:27,041 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-11-06 21:14:27,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370573773] [2019-11-06 21:14:27,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:14:27,044 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:27,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:14:27,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:14:27,045 INFO L87 Difference]: Start difference. First operand 70 states and 95 transitions. Second operand 11 states. [2019-11-06 21:14:27,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:27,573 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2019-11-06 21:14:27,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:14:27,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-11-06 21:14:27,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:27,574 INFO L225 Difference]: With dead ends: 97 [2019-11-06 21:14:27,575 INFO L226 Difference]: Without dead ends: 91 [2019-11-06 21:14:27,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:14:27,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-06 21:14:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2019-11-06 21:14:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-06 21:14:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2019-11-06 21:14:27,582 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 35 [2019-11-06 21:14:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:27,583 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2019-11-06 21:14:27,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:14:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2019-11-06 21:14:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-06 21:14:27,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:27,584 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:27,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:27,789 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:27,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:27,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1194290218, now seen corresponding path program 1 times [2019-11-06 21:14:27,791 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:27,791 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442332627] [2019-11-06 21:14:27,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:14:28,086 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442332627] [2019-11-06 21:14:28,087 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435101914] [2019-11-06 21:14:28,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:28,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-06 21:14:28,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:28,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:14:28,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:28,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:28,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:28,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 21:14:28,276 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:28,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:14:28,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:28,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:28,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:28,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-06 21:14:28,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:14:28,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:28,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:28,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:14:28,330 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:28,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:28,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:28,339 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-06 21:14:28,371 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 2=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_43|]} [2019-11-06 21:14:28,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2019-11-06 21:14:28,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:28,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:28,407 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:28,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-06 21:14:28,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:28,413 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:28,433 INFO L567 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2019-11-06 21:14:28,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-06 21:14:28,437 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:28,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:28,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:28,442 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-06 21:14:28,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-11-06 21:14:28,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:28,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:28,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-06 21:14:28,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:28,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:28,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:28,489 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-06 21:14:28,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:14:28,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:28,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:28,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:28,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-06 21:14:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:28,502 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:28,503 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-11-06 21:14:28,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138750028] [2019-11-06 21:14:28,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 21:14:28,504 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:28,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 21:14:28,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-06 21:14:28,504 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand 16 states. [2019-11-06 21:14:29,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:29,285 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2019-11-06 21:14:29,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:14:29,286 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2019-11-06 21:14:29,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:29,287 INFO L225 Difference]: With dead ends: 99 [2019-11-06 21:14:29,287 INFO L226 Difference]: Without dead ends: 95 [2019-11-06 21:14:29,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2019-11-06 21:14:29,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-06 21:14:29,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2019-11-06 21:14:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-06 21:14:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2019-11-06 21:14:29,295 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 37 [2019-11-06 21:14:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:29,296 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 111 transitions. [2019-11-06 21:14:29,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-06 21:14:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2019-11-06 21:14:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-06 21:14:29,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:29,297 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:29,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:29,503 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:29,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:29,503 INFO L82 PathProgramCache]: Analyzing trace with hash -907951247, now seen corresponding path program 2 times [2019-11-06 21:14:29,503 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:29,503 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799060461] [2019-11-06 21:14:29,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:14:29,694 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799060461] [2019-11-06 21:14:29,694 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363719547] [2019-11-06 21:14:29,694 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:29,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:14:29,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:14:29,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-06 21:14:29,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:29,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:14:29,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:29,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:29,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:29,841 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:14:29,863 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:29,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:14:29,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:29,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:29,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:29,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-06 21:14:29,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:29,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:29,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:29,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:29,906 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:29,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:29,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:29,920 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2019-11-06 21:14:29,935 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_43|], 2=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_45|]} [2019-11-06 21:14:29,940 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 23 treesize of output 15 [2019-11-06 21:14:29,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:29,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:29,978 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:29,978 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 94 treesize of output 108 [2019-11-06 21:14:29,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:29,983 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:30,001 INFO L567 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2019-11-06 21:14:30,005 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 51 treesize of output 41 [2019-11-06 21:14:30,005 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:30,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:30,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:30,012 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2019-11-06 21:14:30,040 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 31 treesize of output 19 [2019-11-06 21:14:30,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:30,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:30,050 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 19 treesize of output 11 [2019-11-06 21:14:30,050 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:30,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:30,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:30,055 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2019-11-06 21:14:30,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:14:30,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:30,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:30,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:30,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-06 21:14:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:30,065 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:30,066 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2019-11-06 21:14:30,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881763210] [2019-11-06 21:14:30,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 21:14:30,066 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:30,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 21:14:30,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:14:30,067 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. Second operand 12 states. [2019-11-06 21:14:30,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:30,589 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2019-11-06 21:14:30,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:14:30,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2019-11-06 21:14:30,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:30,591 INFO L225 Difference]: With dead ends: 101 [2019-11-06 21:14:30,591 INFO L226 Difference]: Without dead ends: 91 [2019-11-06 21:14:30,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-11-06 21:14:30,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-06 21:14:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 74. [2019-11-06 21:14:30,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-06 21:14:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2019-11-06 21:14:30,598 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 39 [2019-11-06 21:14:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:30,598 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2019-11-06 21:14:30,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 21:14:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2019-11-06 21:14:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-06 21:14:30,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:30,600 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:30,809 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:30,809 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:30,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:30,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1308800881, now seen corresponding path program 1 times [2019-11-06 21:14:30,810 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:30,810 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762204644] [2019-11-06 21:14:30,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 21:14:30,929 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762204644] [2019-11-06 21:14:30,930 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908027265] [2019-11-06 21:14:30,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:31,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-06 21:14:31,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:31,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-11-06 21:14:31,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:31,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:31,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:31,063 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 21:14:31,076 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:31,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:14:31,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:31,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:31,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:31,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-06 21:14:31,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:14:31,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:31,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:31,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:14:31,126 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:31,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:31,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:31,142 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-06 21:14:31,163 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 2=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_47|]} [2019-11-06 21:14:31,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2019-11-06 21:14:31,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:31,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:31,200 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:31,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-06 21:14:31,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:31,203 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:31,222 INFO L567 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2019-11-06 21:14:31,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-06 21:14:31,228 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:31,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:31,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:31,236 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-06 21:14:31,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-11-06 21:14:31,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:31,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:31,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-06 21:14:31,279 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:31,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:31,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:31,284 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-06 21:14:31,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:14:31,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:31,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:31,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:31,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-06 21:14:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:31,325 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:31,325 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-06 21:14:31,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420338275] [2019-11-06 21:14:31,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 21:14:31,326 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:31,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 21:14:31,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:14:31,326 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand 14 states. [2019-11-06 21:14:32,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:32,033 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2019-11-06 21:14:32,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-06 21:14:32,034 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2019-11-06 21:14:32,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:32,036 INFO L225 Difference]: With dead ends: 103 [2019-11-06 21:14:32,036 INFO L226 Difference]: Without dead ends: 85 [2019-11-06 21:14:32,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2019-11-06 21:14:32,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-06 21:14:32,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2019-11-06 21:14:32,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-06 21:14:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2019-11-06 21:14:32,041 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 39 [2019-11-06 21:14:32,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:32,041 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2019-11-06 21:14:32,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 21:14:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2019-11-06 21:14:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-06 21:14:32,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:32,042 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:32,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:32,247 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:32,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:32,248 INFO L82 PathProgramCache]: Analyzing trace with hash -315248798, now seen corresponding path program 2 times [2019-11-06 21:14:32,248 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:32,248 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134580132] [2019-11-06 21:14:32,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:32,432 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134580132] [2019-11-06 21:14:32,432 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83692307] [2019-11-06 21:14:32,432 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:32,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:14:32,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:14:32,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-06 21:14:32,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:32,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:14:32,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:32,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:32,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:32,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:14:32,625 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:32,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:14:32,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:32,671 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-06 21:14:32,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:32,676 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:32,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:32,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:32,691 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-06 21:14:32,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:32,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:14:32,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:32,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:32,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:32,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-06 21:14:32,794 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:32,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-06 21:14:32,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:32,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:32,812 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 19 treesize of output 18 [2019-11-06 21:14:32,813 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:32,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:32,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:32,824 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-11-06 21:14:32,870 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:14:32,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 21:14:32,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:32,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:32,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:32,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-06 21:14:32,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-06 21:14:32,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:32,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:32,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:32,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-11-06 21:14:33,003 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 29 treesize of output 13 [2019-11-06 21:14:33,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:33,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:33,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:33,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-11-06 21:14:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:33,043 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:33,044 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2019-11-06 21:14:33,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555087550] [2019-11-06 21:14:33,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-06 21:14:33,046 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:33,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-06 21:14:33,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-11-06 21:14:33,047 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand 19 states. [2019-11-06 21:14:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:33,956 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2019-11-06 21:14:33,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-06 21:14:33,956 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2019-11-06 21:14:33,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:33,957 INFO L225 Difference]: With dead ends: 113 [2019-11-06 21:14:33,958 INFO L226 Difference]: Without dead ends: 107 [2019-11-06 21:14:33,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2019-11-06 21:14:33,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-06 21:14:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2019-11-06 21:14:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-06 21:14:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2019-11-06 21:14:33,964 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 39 [2019-11-06 21:14:33,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:33,964 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2019-11-06 21:14:33,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-06 21:14:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2019-11-06 21:14:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-06 21:14:33,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:33,965 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:34,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:34,169 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:34,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:34,170 INFO L82 PathProgramCache]: Analyzing trace with hash -15546846, now seen corresponding path program 1 times [2019-11-06 21:14:34,170 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:34,170 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092321046] [2019-11-06 21:14:34,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:34,391 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092321046] [2019-11-06 21:14:34,391 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655127648] [2019-11-06 21:14:34,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:34,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-06 21:14:34,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:34,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:14:34,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:34,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:34,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:34,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:14:34,602 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:34,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:14:34,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:34,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:34,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:34,621 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:34,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:34,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:34,633 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-11-06 21:14:34,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:34,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:14:34,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:34,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:34,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:34,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-06 21:14:34,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:34,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 21:14:34,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:34,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:34,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:34,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-11-06 21:14:34,779 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:14:34,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 21:14:34,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:34,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:34,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:34,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-06 21:14:34,849 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:34,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-06 21:14:34,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:34,886 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-06 21:14:34,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:34,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:34,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:34,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:34,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-06 21:14:34,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:34,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:34,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:34,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:34,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:34,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:35,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:35,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-06 21:14:35,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:35,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:35,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:35,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-06 21:14:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:35,105 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:35,105 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 18 [2019-11-06 21:14:35,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590533471] [2019-11-06 21:14:35,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 21:14:35,106 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:35,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 21:14:35,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-11-06 21:14:35,107 INFO L87 Difference]: Start difference. First operand 84 states and 111 transitions. Second operand 18 states. [2019-11-06 21:14:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:36,142 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2019-11-06 21:14:36,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-06 21:14:36,143 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2019-11-06 21:14:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:36,144 INFO L225 Difference]: With dead ends: 130 [2019-11-06 21:14:36,144 INFO L226 Difference]: Without dead ends: 124 [2019-11-06 21:14:36,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122 [2019-11-06 21:14:36,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-06 21:14:36,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 88. [2019-11-06 21:14:36,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-06 21:14:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2019-11-06 21:14:36,151 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 39 [2019-11-06 21:14:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:36,151 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2019-11-06 21:14:36,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 21:14:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2019-11-06 21:14:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-06 21:14:36,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:36,152 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:36,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:36,356 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:36,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:36,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2037263357, now seen corresponding path program 3 times [2019-11-06 21:14:36,357 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:36,357 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719517288] [2019-11-06 21:14:36,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:14:36,673 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719517288] [2019-11-06 21:14:36,673 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839502214] [2019-11-06 21:14:36,674 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:36,802 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 21:14:36,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:14:36,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-06 21:14:36,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:36,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:14:36,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:36,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:36,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:36,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:14:36,863 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:36,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:14:36,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:36,911 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-06 21:14:36,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:36,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-06 21:14:36,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:36,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:36,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:36,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:36,973 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:36,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:36,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:36,986 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-06 21:14:37,031 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:37,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-06 21:14:37,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:37,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:37,078 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_55|], 2=[|v_#memory_$Pointer$.offset_50|, |v_#memory_$Pointer$.base_54|]} [2019-11-06 21:14:37,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:37,086 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:37,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:37,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:37,120 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 30 treesize of output 14 [2019-11-06 21:14:37,121 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:37,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:37,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:37,148 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 39 treesize of output 19 [2019-11-06 21:14:37,148 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:37,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:37,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:37,165 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:47 [2019-11-06 21:14:37,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:37,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2019-11-06 21:14:37,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:37,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:37,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 85 [2019-11-06 21:14:37,246 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:37,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:37,278 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:37,279 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 80 treesize of output 70 [2019-11-06 21:14:37,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,281 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:37,320 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.5 percent of original size [2019-11-06 21:14:37,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:37,320 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:169, output treesize:83 [2019-11-06 21:14:37,369 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_57|], 5=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_52|]} [2019-11-06 21:14:37,374 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 38 [2019-11-06 21:14:37,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:37,416 INFO L567 ElimStorePlain]: treesize reduction 16, result has 91.8 percent of original size [2019-11-06 21:14:37,457 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:37,458 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 168 treesize of output 167 [2019-11-06 21:14:37,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:37,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,475 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2019-11-06 21:14:37,577 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 37 [2019-11-06 21:14:37,578 INFO L567 ElimStorePlain]: treesize reduction 1512, result has 7.6 percent of original size [2019-11-06 21:14:37,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:37,604 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:37,604 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 1 case distinctions, treesize of input 120 treesize of output 157 [2019-11-06 21:14:37,605 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:37,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:37,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:37,617 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:206, output treesize:60 [2019-11-06 21:14:37,716 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:37,716 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 57 treesize of output 40 [2019-11-06 21:14:37,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:37,720 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:37,751 INFO L567 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-11-06 21:14:37,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-06 21:14:37,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:37,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:37,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:37,765 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:29 [2019-11-06 21:14:37,819 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:37,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2019-11-06 21:14:37,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:37,834 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-06 21:14:37,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:37,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-11-06 21:14:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:37,846 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:37,846 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2019-11-06 21:14:37,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067323391] [2019-11-06 21:14:37,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-06 21:14:37,847 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:37,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-06 21:14:37,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-11-06 21:14:37,847 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand 21 states. [2019-11-06 21:14:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:38,999 INFO L93 Difference]: Finished difference Result 117 states and 150 transitions. [2019-11-06 21:14:39,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-06 21:14:39,000 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2019-11-06 21:14:39,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:39,002 INFO L225 Difference]: With dead ends: 117 [2019-11-06 21:14:39,002 INFO L226 Difference]: Without dead ends: 113 [2019-11-06 21:14:39,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=185, Invalid=1005, Unknown=0, NotChecked=0, Total=1190 [2019-11-06 21:14:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-06 21:14:39,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2019-11-06 21:14:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-06 21:14:39,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 127 transitions. [2019-11-06 21:14:39,009 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 127 transitions. Word has length 41 [2019-11-06 21:14:39,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:39,009 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 127 transitions. [2019-11-06 21:14:39,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-06 21:14:39,009 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 127 transitions. [2019-11-06 21:14:39,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-06 21:14:39,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:39,010 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:39,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:39,214 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:39,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:39,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1206625923, now seen corresponding path program 1 times [2019-11-06 21:14:39,215 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:39,215 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652956186] [2019-11-06 21:14:39,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:39,390 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652956186] [2019-11-06 21:14:39,390 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880775180] [2019-11-06 21:14:39,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:39,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-06 21:14:39,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:39,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:14:39,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:39,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:39,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:39,528 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:14:39,544 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:39,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:14:39,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:39,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:39,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:39,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:39,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:39,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:39,579 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-11-06 21:14:39,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:39,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:14:39,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:39,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:39,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:39,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-06 21:14:39,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:39,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 21:14:39,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:39,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:39,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:39,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-11-06 21:14:39,664 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:14:39,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 21:14:39,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:39,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:39,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:39,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-06 21:14:39,740 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:39,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-06 21:14:39,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:39,783 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-06 21:14:39,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:39,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:39,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:39,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:39,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-06 21:14:39,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:39,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:39,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:39,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:39,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:39,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:39,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:39,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:39,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:39,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:39,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:39,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:39,883 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 26 treesize of output 14 [2019-11-06 21:14:39,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:39,889 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 26 treesize of output 14 [2019-11-06 21:14:39,889 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:39,905 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:39,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2019-11-06 21:14:39,906 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:39,929 INFO L567 ElimStorePlain]: treesize reduction 20, result has 45.9 percent of original size [2019-11-06 21:14:39,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 21:14:39,930 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:86, output treesize:7 [2019-11-06 21:14:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:39,951 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:39,951 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2019-11-06 21:14:39,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021918448] [2019-11-06 21:14:39,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-06 21:14:39,952 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:39,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-06 21:14:39,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:14:39,952 INFO L87 Difference]: Start difference. First operand 97 states and 127 transitions. Second operand 17 states. [2019-11-06 21:14:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:41,040 INFO L93 Difference]: Finished difference Result 148 states and 186 transitions. [2019-11-06 21:14:41,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-06 21:14:41,040 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2019-11-06 21:14:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:41,042 INFO L225 Difference]: With dead ends: 148 [2019-11-06 21:14:41,042 INFO L226 Difference]: Without dead ends: 136 [2019-11-06 21:14:41,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2019-11-06 21:14:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-06 21:14:41,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 116. [2019-11-06 21:14:41,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-06 21:14:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 150 transitions. [2019-11-06 21:14:41,050 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 150 transitions. Word has length 41 [2019-11-06 21:14:41,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:41,050 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 150 transitions. [2019-11-06 21:14:41,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-06 21:14:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2019-11-06 21:14:41,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-06 21:14:41,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:41,051 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:41,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:41,252 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:41,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:41,253 INFO L82 PathProgramCache]: Analyzing trace with hash -181922947, now seen corresponding path program 1 times [2019-11-06 21:14:41,253 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:41,254 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991375957] [2019-11-06 21:14:41,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:41,549 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:14:41,550 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991375957] [2019-11-06 21:14:41,550 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163832113] [2019-11-06 21:14:41,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:41,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-06 21:14:41,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:41,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:14:41,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:41,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:41,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:41,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:14:41,712 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:41,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:14:41,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:41,734 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-06 21:14:41,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:41,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-06 21:14:41,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:41,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:41,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:41,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:41,787 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:41,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:41,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:41,803 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-06 21:14:41,849 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:41,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-06 21:14:41,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:41,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:41,886 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_63|], 2=[|v_#memory_$Pointer$.base_59|, |v_#memory_$Pointer$.offset_55|]} [2019-11-06 21:14:41,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:41,890 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:41,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:41,945 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-06 21:14:41,945 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 39 treesize of output 27 [2019-11-06 21:14:41,946 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:41,988 INFO L567 ElimStorePlain]: treesize reduction 8, result has 87.3 percent of original size [2019-11-06 21:14:41,996 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 23 treesize of output 11 [2019-11-06 21:14:41,996 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:42,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:42,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:42,012 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:40 [2019-11-06 21:14:42,070 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:42,071 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 155 treesize of output 149 [2019-11-06 21:14:42,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:42,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:42,131 INFO L567 ElimStorePlain]: treesize reduction 26, result has 85.6 percent of original size [2019-11-06 21:14:42,135 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 131 treesize of output 105 [2019-11-06 21:14:42,136 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:42,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:42,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:42,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2019-11-06 21:14:42,172 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:42,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:42,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:42,194 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:162, output treesize:118 [2019-11-06 21:14:42,261 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_65|], 6=[|v_#memory_$Pointer$.offset_57|, |v_#memory_$Pointer$.base_61|]} [2019-11-06 21:14:42,266 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 69 treesize of output 54 [2019-11-06 21:14:42,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:42,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:42,333 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:42,334 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 278 treesize of output 257 [2019-11-06 21:14:42,335 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:42,379 INFO L567 ElimStorePlain]: treesize reduction 100, result has 61.8 percent of original size [2019-11-06 21:14:42,407 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:42,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 159 treesize of output 145 [2019-11-06 21:14:42,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:42,410 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:42,481 INFO L567 ElimStorePlain]: treesize reduction 108, result has 49.3 percent of original size [2019-11-06 21:14:42,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:42,482 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:307, output treesize:105 [2019-11-06 21:14:42,616 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:42,617 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 109 treesize of output 68 [2019-11-06 21:14:42,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:42,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:42,621 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:42,659 INFO L567 ElimStorePlain]: treesize reduction 22, result has 71.1 percent of original size [2019-11-06 21:14:42,663 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 32 treesize of output 19 [2019-11-06 21:14:42,663 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:42,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:42,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:42,677 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:30 [2019-11-06 21:14:42,728 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:42,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2019-11-06 21:14:42,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:42,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:42,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:42,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2019-11-06 21:14:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:42,744 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:42,745 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2019-11-06 21:14:42,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774214003] [2019-11-06 21:14:42,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-06 21:14:42,746 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:42,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-06 21:14:42,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-11-06 21:14:42,746 INFO L87 Difference]: Start difference. First operand 116 states and 150 transitions. Second operand 21 states. [2019-11-06 21:14:43,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:43,964 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2019-11-06 21:14:43,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-06 21:14:43,965 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2019-11-06 21:14:43,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:43,966 INFO L225 Difference]: With dead ends: 138 [2019-11-06 21:14:43,966 INFO L226 Difference]: Without dead ends: 132 [2019-11-06 21:14:43,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2019-11-06 21:14:43,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-06 21:14:43,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 118. [2019-11-06 21:14:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-06 21:14:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 152 transitions. [2019-11-06 21:14:43,978 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 152 transitions. Word has length 41 [2019-11-06 21:14:43,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:43,979 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 152 transitions. [2019-11-06 21:14:43,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-06 21:14:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 152 transitions. [2019-11-06 21:14:43,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-06 21:14:43,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:43,980 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:44,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:44,185 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:44,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:44,186 INFO L82 PathProgramCache]: Analyzing trace with hash -646320680, now seen corresponding path program 4 times [2019-11-06 21:14:44,186 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:44,186 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526681259] [2019-11-06 21:14:44,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:14:44,652 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526681259] [2019-11-06 21:14:44,652 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329427839] [2019-11-06 21:14:44,652 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:44,792 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 21:14:44,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:14:44,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-06 21:14:44,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:44,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:14:44,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:44,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:44,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:44,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 21:14:44,853 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:44,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:14:44,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:44,875 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-06 21:14:44,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:44,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-06 21:14:44,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:14:44,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:44,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:44,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:14:44,932 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:44,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:44,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:44,948 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2019-11-06 21:14:45,011 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:45,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-06 21:14:45,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:45,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:45,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:45,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-06 21:14:45,034 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:45,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:45,066 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-06 21:14:45,067 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 45 treesize of output 31 [2019-11-06 21:14:45,067 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:45,087 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2019-11-06 21:14:45,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:45,087 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:80, output treesize:31 [2019-11-06 21:14:45,123 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 105 treesize of output 83 [2019-11-06 21:14:45,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:45,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:45,162 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:45,162 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 115 treesize of output 127 [2019-11-06 21:14:45,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:45,164 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:45,197 INFO L567 ElimStorePlain]: treesize reduction 34, result has 76.2 percent of original size [2019-11-06 21:14:45,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:45,198 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:129, output treesize:103 [2019-11-06 21:14:45,240 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_66|], 6=[|v_#memory_$Pointer$.offset_61|, |v_#memory_$Pointer$.base_65|]} [2019-11-06 21:14:45,243 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 65 treesize of output 43 [2019-11-06 21:14:45,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:45,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:45,303 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:45,303 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 304 treesize of output 281 [2019-11-06 21:14:45,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:45,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:45,307 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:45,373 INFO L567 ElimStorePlain]: treesize reduction 519, result has 28.8 percent of original size [2019-11-06 21:14:45,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:45,427 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 209 treesize of output 232 [2019-11-06 21:14:45,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:45,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:45,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:45,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:45,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:45,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:45,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:45,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:45,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:45,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:45,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:45,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:45,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:45,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:45,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:45,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:45,439 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 9 xjuncts. [2019-11-06 21:14:45,516 INFO L567 ElimStorePlain]: treesize reduction 1793, result has 5.5 percent of original size [2019-11-06 21:14:45,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:45,516 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:336, output treesize:104 [2019-11-06 21:14:45,615 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:45,616 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 146 treesize of output 75 [2019-11-06 21:14:45,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:45,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:45,617 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:45,639 INFO L567 ElimStorePlain]: treesize reduction 22, result has 68.1 percent of original size [2019-11-06 21:14:45,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2019-11-06 21:14:45,644 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:45,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:45,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:45,651 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:146, output treesize:7 [2019-11-06 21:14:45,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:14:45,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:45,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:45,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:45,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-06 21:14:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:45,665 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:45,665 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2019-11-06 21:14:45,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320606999] [2019-11-06 21:14:45,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-06 21:14:45,666 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:45,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-06 21:14:45,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2019-11-06 21:14:45,666 INFO L87 Difference]: Start difference. First operand 118 states and 152 transitions. Second operand 23 states. [2019-11-06 21:14:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:49,566 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2019-11-06 21:14:49,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 21:14:49,567 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-11-06 21:14:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:49,568 INFO L225 Difference]: With dead ends: 142 [2019-11-06 21:14:49,568 INFO L226 Difference]: Without dead ends: 138 [2019-11-06 21:14:49,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2019-11-06 21:14:49,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-06 21:14:49,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2019-11-06 21:14:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-06 21:14:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 157 transitions. [2019-11-06 21:14:49,578 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 157 transitions. Word has length 43 [2019-11-06 21:14:49,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:49,578 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 157 transitions. [2019-11-06 21:14:49,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-06 21:14:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 157 transitions. [2019-11-06 21:14:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-06 21:14:49,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:49,579 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:49,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:49,784 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:49,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:49,785 INFO L82 PathProgramCache]: Analyzing trace with hash 415338633, now seen corresponding path program 2 times [2019-11-06 21:14:49,785 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:49,786 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812315979] [2019-11-06 21:14:49,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:50,009 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:50,009 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812315979] [2019-11-06 21:14:50,010 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274000403] [2019-11-06 21:14:50,010 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:50,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:14:50,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:14:50,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-06 21:14:50,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:50,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:14:50,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:50,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:50,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:50,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:14:50,176 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:50,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:14:50,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:50,216 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-06 21:14:50,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:50,220 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:50,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:50,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:50,233 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-06 21:14:50,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:50,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:14:50,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:50,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:50,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:50,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-06 21:14:50,319 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:50,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-06 21:14:50,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:50,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:50,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 21:14:50,336 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:50,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:50,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:50,347 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-11-06 21:14:50,402 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:14:50,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 21:14:50,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:50,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:50,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:50,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-06 21:14:50,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-06 21:14:50,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:50,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:50,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:50,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2019-11-06 21:14:50,556 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:14:50,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2019-11-06 21:14:50,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:50,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:50,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:50,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:40 [2019-11-06 21:14:50,705 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:50,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 102 [2019-11-06 21:14:50,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:50,801 INFO L567 ElimStorePlain]: treesize reduction 44, result has 59.3 percent of original size [2019-11-06 21:14:50,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:50,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:50,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:50,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:50,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:50,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:50,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:50,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:48, output treesize:64 [2019-11-06 21:14:50,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:50,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:50,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:50,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:50,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:50,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:50,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:50,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:50,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:50,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:50,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:50,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:51,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:51,162 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 29 treesize of output 13 [2019-11-06 21:14:51,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:51,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:51,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:51,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-11-06 21:14:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:14:51,194 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:51,194 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2019-11-06 21:14:51,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115032812] [2019-11-06 21:14:51,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-06 21:14:51,195 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:51,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-06 21:14:51,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2019-11-06 21:14:51,196 INFO L87 Difference]: Start difference. First operand 122 states and 157 transitions. Second operand 24 states. [2019-11-06 21:14:52,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:52,819 INFO L93 Difference]: Finished difference Result 168 states and 211 transitions. [2019-11-06 21:14:52,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 21:14:52,820 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2019-11-06 21:14:52,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:52,822 INFO L225 Difference]: With dead ends: 168 [2019-11-06 21:14:52,822 INFO L226 Difference]: Without dead ends: 160 [2019-11-06 21:14:52,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=236, Invalid=1096, Unknown=0, NotChecked=0, Total=1332 [2019-11-06 21:14:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-06 21:14:52,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 118. [2019-11-06 21:14:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-06 21:14:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 151 transitions. [2019-11-06 21:14:52,832 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 151 transitions. Word has length 43 [2019-11-06 21:14:52,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:52,832 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 151 transitions. [2019-11-06 21:14:52,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-06 21:14:52,832 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 151 transitions. [2019-11-06 21:14:52,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-06 21:14:52,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:52,833 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:53,036 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:53,037 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:53,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:53,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1704764659, now seen corresponding path program 5 times [2019-11-06 21:14:53,038 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:53,038 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605922485] [2019-11-06 21:14:53,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:14:53,446 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605922485] [2019-11-06 21:14:53,446 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623210438] [2019-11-06 21:14:53,446 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:53,573 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-06 21:14:53,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:14:53,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 63 conjunts are in the unsatisfiable core [2019-11-06 21:14:53,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:53,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:14:53,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:53,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:53,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:53,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:14:53,612 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:53,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:14:53,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:53,642 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-06 21:14:53,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:53,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-06 21:14:53,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:53,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:53,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:53,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:53,706 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:53,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:53,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:53,723 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-06 21:14:53,773 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:53,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-06 21:14:53,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:53,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:53,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:53,810 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 39 treesize of output 19 [2019-11-06 21:14:53,810 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:53,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:53,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:53,831 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 30 treesize of output 14 [2019-11-06 21:14:53,831 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:53,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:53,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:53,843 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:41 [2019-11-06 21:14:53,898 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:53,898 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 77 treesize of output 67 [2019-11-06 21:14:53,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:53,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:53,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:53,938 INFO L567 ElimStorePlain]: treesize reduction 8, result has 90.4 percent of original size [2019-11-06 21:14:53,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:53,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-06 21:14:53,946 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:53,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:53,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:53,964 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:61 [2019-11-06 21:14:54,006 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_74|], 5=[|v_#memory_$Pointer$.base_71|, |v_#memory_$Pointer$.offset_66|]} [2019-11-06 21:14:54,012 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 35 treesize of output 23 [2019-11-06 21:14:54,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:54,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:54,093 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:54,094 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 162 treesize of output 157 [2019-11-06 21:14:54,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:54,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:54,098 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:54,154 INFO L567 ElimStorePlain]: treesize reduction 136, result has 46.2 percent of original size [2019-11-06 21:14:54,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:54,161 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 86 treesize of output 67 [2019-11-06 21:14:54,162 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:54,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:54,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:54,180 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:184, output treesize:62 [2019-11-06 21:14:54,324 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:14:54,345 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-06 21:14:54,346 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 50 [2019-11-06 21:14:54,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:54,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:54,348 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:54,382 INFO L567 ElimStorePlain]: treesize reduction 4, result has 91.7 percent of original size [2019-11-06 21:14:54,391 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:54,392 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2019-11-06 21:14:54,393 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:54,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:54,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:54,404 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:7 [2019-11-06 21:14:54,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:14:54,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:54,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:54,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:54,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-06 21:14:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:14:54,428 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:54,428 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2019-11-06 21:14:54,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350417165] [2019-11-06 21:14:54,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-06 21:14:54,432 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:54,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-06 21:14:54,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2019-11-06 21:14:54,433 INFO L87 Difference]: Start difference. First operand 118 states and 151 transitions. Second operand 21 states. [2019-11-06 21:14:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:55,625 INFO L93 Difference]: Finished difference Result 140 states and 175 transitions. [2019-11-06 21:14:55,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 21:14:55,626 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2019-11-06 21:14:55,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:55,627 INFO L225 Difference]: With dead ends: 140 [2019-11-06 21:14:55,627 INFO L226 Difference]: Without dead ends: 128 [2019-11-06 21:14:55,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2019-11-06 21:14:55,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-06 21:14:55,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2019-11-06 21:14:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-06 21:14:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 134 transitions. [2019-11-06 21:14:55,634 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 134 transitions. Word has length 45 [2019-11-06 21:14:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:55,635 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 134 transitions. [2019-11-06 21:14:55,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-06 21:14:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2019-11-06 21:14:55,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-06 21:14:55,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:55,635 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:55,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:55,840 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:55,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:55,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1570483469, now seen corresponding path program 2 times [2019-11-06 21:14:55,841 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:55,841 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989210326] [2019-11-06 21:14:55,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:55,994 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-06 21:14:55,995 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989210326] [2019-11-06 21:14:55,995 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363537541] [2019-11-06 21:14:55,995 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:56,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:14:56,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:14:56,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-06 21:14:56,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:56,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:14:56,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:56,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:56,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:56,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:14:56,181 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:56,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:14:56,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:56,217 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-06 21:14:56,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:56,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:56,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:56,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:56,235 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-06 21:14:56,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:56,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:14:56,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:56,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:56,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:56,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-06 21:14:56,337 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:56,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-06 21:14:56,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:56,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:56,353 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 19 treesize of output 18 [2019-11-06 21:14:56,353 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:56,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:56,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:56,364 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-11-06 21:14:56,401 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:14:56,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 21:14:56,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:56,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:56,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:56,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-06 21:14:56,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-06 21:14:56,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:56,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:56,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:56,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-11-06 21:14:56,526 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 29 treesize of output 13 [2019-11-06 21:14:56,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:56,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:56,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:56,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-11-06 21:14:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-06 21:14:56,562 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:14:56,562 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2019-11-06 21:14:56,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953931501] [2019-11-06 21:14:56,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-06 21:14:56,564 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:14:56,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-06 21:14:56,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:14:56,565 INFO L87 Difference]: Start difference. First operand 104 states and 134 transitions. Second operand 17 states. [2019-11-06 21:14:57,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:14:57,441 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2019-11-06 21:14:57,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-06 21:14:57,441 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2019-11-06 21:14:57,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:14:57,442 INFO L225 Difference]: With dead ends: 131 [2019-11-06 21:14:57,443 INFO L226 Difference]: Without dead ends: 116 [2019-11-06 21:14:57,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2019-11-06 21:14:57,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-06 21:14:57,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 104. [2019-11-06 21:14:57,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-06 21:14:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions. [2019-11-06 21:14:57,450 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 45 [2019-11-06 21:14:57,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:14:57,451 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions. [2019-11-06 21:14:57,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-06 21:14:57,451 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions. [2019-11-06 21:14:57,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-06 21:14:57,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:14:57,452 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:14:57,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:57,656 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:14:57,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:14:57,657 INFO L82 PathProgramCache]: Analyzing trace with hash 61167780, now seen corresponding path program 6 times [2019-11-06 21:14:57,657 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:14:57,657 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68290740] [2019-11-06 21:14:57,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:14:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:14:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:14:58,317 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68290740] [2019-11-06 21:14:58,317 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976104133] [2019-11-06 21:14:58,317 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:14:58,563 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-06 21:14:58,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:14:58,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-06 21:14:58,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:14:58,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:14:58,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:58,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:58,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:58,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:14:58,604 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:58,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:14:58,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:58,636 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-06 21:14:58,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:58,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-06 21:14:58,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:58,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:58,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:58,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:14:58,681 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:58,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:58,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:58,700 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-06 21:14:58,732 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:58,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-06 21:14:58,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:58,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:58,773 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_80|], 2=[|v_#memory_$Pointer$.offset_68|, |v_#memory_$Pointer$.base_75|]} [2019-11-06 21:14:58,778 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 11 treesize of output 7 [2019-11-06 21:14:58,778 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:58,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:58,814 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 30 treesize of output 14 [2019-11-06 21:14:58,814 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:58,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:58,842 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 23 treesize of output 11 [2019-11-06 21:14:58,842 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:58,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:58,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:58,861 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:44 [2019-11-06 21:14:58,898 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_81|], 3=[|v_#memory_$Pointer$.offset_69|, |v_#memory_$Pointer$.base_76|]} [2019-11-06 21:14:58,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:58,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:14:58,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:58,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:58,990 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:58,991 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 1 case distinctions, treesize of input 78 treesize of output 101 [2019-11-06 21:14:58,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:58,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:58,993 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:59,098 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-11-06 21:14:59,099 INFO L567 ElimStorePlain]: treesize reduction 154, result has 34.7 percent of original size [2019-11-06 21:14:59,103 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:14:59,107 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:14:59,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:59,122 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 1 case distinctions, treesize of input 34 treesize of output 49 [2019-11-06 21:14:59,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,123 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:59,185 INFO L567 ElimStorePlain]: treesize reduction 29, result has 69.8 percent of original size [2019-11-06 21:14:59,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:59,186 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:124, output treesize:83 [2019-11-06 21:14:59,243 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_82|, |v_#memory_$Pointer$.offset_70|], 6=[|v_#memory_$Pointer$.base_77|]} [2019-11-06 21:14:59,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:59,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-11-06 21:14:59,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:59,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:59,328 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-06 21:14:59,329 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 95 treesize of output 75 [2019-11-06 21:14:59,330 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:59,396 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.5 percent of original size [2019-11-06 21:14:59,468 INFO L341 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-11-06 21:14:59,468 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 66 treesize of output 60 [2019-11-06 21:14:59,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,474 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:59,543 INFO L567 ElimStorePlain]: treesize reduction 24, result has 67.6 percent of original size [2019-11-06 21:14:59,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:14:59,544 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:127, output treesize:55 [2019-11-06 21:14:59,615 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_71|], 5=[|v_#memory_$Pointer$.base_78|], 6=[|v_#memory_int_83|]} [2019-11-06 21:14:59,624 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 37 treesize of output 28 [2019-11-06 21:14:59,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:59,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:59,704 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:59,705 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 161 treesize of output 153 [2019-11-06 21:14:59,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:59,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,710 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-06 21:14:59,836 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-11-06 21:14:59,836 INFO L567 ElimStorePlain]: treesize reduction 438, result has 26.8 percent of original size [2019-11-06 21:14:59,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:14:59,843 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 149 treesize of output 112 [2019-11-06 21:14:59,844 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:14:59,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:59,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:14:59,866 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:183, output treesize:99 [2019-11-06 21:14:59,920 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_79|], 6=[|v_#memory_int_84|, |v_#memory_$Pointer$.offset_72|]} [2019-11-06 21:14:59,963 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:14:59,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 195 [2019-11-06 21:14:59,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:59,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:59,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:59,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:59,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:59,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:59,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:14:59,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:14:59,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:00,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,011 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:00,102 INFO L567 ElimStorePlain]: treesize reduction 100, result has 50.0 percent of original size [2019-11-06 21:15:00,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:00,144 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 32 treesize of output 86 [2019-11-06 21:15:00,144 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:00,234 INFO L567 ElimStorePlain]: treesize reduction 34, result has 77.0 percent of original size [2019-11-06 21:15:00,297 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:00,297 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 78 treesize of output 121 [2019-11-06 21:15:00,298 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:00,377 INFO L567 ElimStorePlain]: treesize reduction 24, result has 78.0 percent of original size [2019-11-06 21:15:00,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:00,381 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:193, output treesize:131 [2019-11-06 21:15:00,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:00,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms