java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 20:39:34,030 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 20:39:34,032 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 20:39:34,046 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 20:39:34,047 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 20:39:34,048 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 20:39:34,049 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 20:39:34,050 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 20:39:34,052 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 20:39:34,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 20:39:34,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 20:39:34,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 20:39:34,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 20:39:34,056 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 20:39:34,057 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 20:39:34,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 20:39:34,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 20:39:34,063 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 20:39:34,064 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 20:39:34,065 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 20:39:34,068 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 20:39:34,068 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 20:39:34,068 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 20:39:34,069 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 20:39:34,070 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 20:39:34,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 20:39:34,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 20:39:34,072 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 20:39:34,073 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 20:39:34,073 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 20:39:34,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 20:39:34,074 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-09 20:39:34,097 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 20:39:34,098 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 20:39:34,098 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 20:39:34,098 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 20:39:34,099 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 20:39:34,099 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 20:39:34,099 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 20:39:34,099 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 20:39:34,100 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 20:39:34,100 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 20:39:34,100 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 20:39:34,100 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 20:39:34,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 20:39:34,101 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 20:39:34,101 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 20:39:34,101 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 20:39:34,101 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 20:39:34,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 20:39:34,102 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 20:39:34,102 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 20:39:34,102 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 20:39:34,102 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 20:39:34,102 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 20:39:34,103 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 20:39:34,103 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 20:39:34,103 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 20:39:34,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 20:39:34,103 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 20:39:34,104 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 20:39:34,104 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 20:39:34,104 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 20:39:34,104 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 20:39:34,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:34,104 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 20:39:34,105 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 20:39:34,106 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 20:39:34,106 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 20:39:34,106 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 20:39:34,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 20:39:34,150 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 20:39:34,154 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 20:39:34,156 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 20:39:34,156 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 20:39:34,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,463 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3d79024c8 [2018-04-09 20:39:34,656 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 20:39:34,656 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 20:39:34,656 INFO L168 CDTParser]: Scanning substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,667 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 20:39:34,667 INFO L215 ultiparseSymbolTable]: [2018-04-09 20:39:34,667 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 20:39:34,667 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ ('') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,667 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,667 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,667 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,667 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 20:39:34,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____nlink_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__register_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__gid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ldiv_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____socklen_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,669 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__timer_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,669 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ssize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,669 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__off_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,669 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,669 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____intptr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,669 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,669 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____mode_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,669 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__size_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,670 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,670 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,670 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsword_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,670 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,670 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,670 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,670 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__uint in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,670 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__id_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ssize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__nlink_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__caddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_short in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__div_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____suseconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____rlim_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__uid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__wchar_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__lldiv_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,673 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,673 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,673 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,673 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,673 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fd_mask in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,673 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__clockid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,673 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____clockid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,673 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_char in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____off64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____gid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____id_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____timer_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____pid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_long in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_char in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ulong in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__clock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__daddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ino_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____off_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__blksize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fd_mask in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____caddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_long in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____sigset_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__sigset_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ino64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__time_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____clock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____daddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__mode_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____useconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__dev_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_short in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fd_set in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____loff_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__suseconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_int in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____dev_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____time_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,677 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ushort in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____qaddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blksize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ino_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__loff_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,678 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____rlim64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,679 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:34,699 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3d79024c8 [2018-04-09 20:39:34,703 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 20:39:34,705 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 20:39:34,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 20:39:34,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 20:39:34,712 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 20:39:34,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 08:39:34" (1/1) ... [2018-04-09 20:39:34,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f383d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:39:34, skipping insertion in model container [2018-04-09 20:39:34,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 08:39:34" (1/1) ... [2018-04-09 20:39:34,728 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 20:39:34,758 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 20:39:34,926 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 20:39:34,974 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 20:39:34,982 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-09 20:39:35,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:39:35 WrapperNode [2018-04-09 20:39:35,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 20:39:35,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 20:39:35,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 20:39:35,031 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 20:39:35,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:39:35" (1/1) ... [2018-04-09 20:39:35,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:39:35" (1/1) ... [2018-04-09 20:39:35,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:39:35" (1/1) ... [2018-04-09 20:39:35,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:39:35" (1/1) ... [2018-04-09 20:39:35,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:39:35" (1/1) ... [2018-04-09 20:39:35,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:39:35" (1/1) ... [2018-04-09 20:39:35,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:39:35" (1/1) ... [2018-04-09 20:39:35,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 20:39:35,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 20:39:35,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 20:39:35,087 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 20:39:35,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:39:35" (1/1) ... No working directory specified, using /storage/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 [2018-04-09 20:39:35,207 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 20:39:35,207 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 20:39:35,207 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-09 20:39:35,207 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-09 20:39:35,207 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-04-09 20:39:35,207 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 20:39:35,208 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-09 20:39:35,208 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-09 20:39:35,208 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 20:39:35,208 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 20:39:35,208 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 20:39:35,208 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 20:39:35,208 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 20:39:35,208 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 20:39:35,209 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 20:39:35,209 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 20:39:35,209 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 20:39:35,209 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 20:39:35,209 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 20:39:35,209 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 20:39:35,210 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 20:39:35,210 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 20:39:35,210 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 20:39:35,210 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 20:39:35,210 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 20:39:35,210 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 20:39:35,210 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 20:39:35,210 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 20:39:35,211 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 20:39:35,211 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 20:39:35,211 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 20:39:35,211 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 20:39:35,211 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 20:39:35,211 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 20:39:35,211 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 20:39:35,211 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 20:39:35,211 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 20:39:35,211 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 20:39:35,212 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 20:39:35,212 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 20:39:35,212 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 20:39:35,212 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 20:39:35,212 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 20:39:35,212 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 20:39:35,212 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 20:39:35,212 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 20:39:35,212 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 20:39:35,212 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 20:39:35,212 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 20:39:35,213 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 20:39:35,213 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 20:39:35,213 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 20:39:35,213 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 20:39:35,213 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 20:39:35,213 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 20:39:35,213 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 20:39:35,213 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 20:39:35,213 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 20:39:35,213 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 20:39:35,213 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 20:39:35,213 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 20:39:35,214 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 20:39:35,214 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 20:39:35,214 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 20:39:35,214 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 20:39:35,214 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 20:39:35,214 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 20:39:35,214 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 20:39:35,214 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 20:39:35,214 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 20:39:35,214 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 20:39:35,214 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 20:39:35,214 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 20:39:35,214 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 20:39:35,214 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 20:39:35,215 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 20:39:35,215 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 20:39:35,215 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 20:39:35,215 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 20:39:35,215 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 20:39:35,215 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 20:39:35,215 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 20:39:35,215 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 20:39:35,215 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 20:39:35,215 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 20:39:35,215 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 20:39:35,215 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 20:39:35,216 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 20:39:35,216 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 20:39:35,216 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 20:39:35,216 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 20:39:35,216 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 20:39:35,216 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 20:39:35,216 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 20:39:35,216 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 20:39:35,217 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 20:39:35,217 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 20:39:35,217 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 20:39:35,217 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 20:39:35,217 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 20:39:35,217 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 20:39:35,217 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 20:39:35,217 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 20:39:35,218 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 20:39:35,218 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 20:39:35,218 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 20:39:35,218 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 20:39:35,218 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 20:39:35,218 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 20:39:35,218 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-04-09 20:39:35,218 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 20:39:35,219 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 20:39:35,219 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 20:39:35,219 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 20:39:35,219 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 20:39:35,219 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 20:39:35,219 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 20:39:35,219 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 20:39:35,585 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 20:39:35,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 08:39:35 BoogieIcfgContainer [2018-04-09 20:39:35,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 20:39:35,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 20:39:35,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 20:39:35,590 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 20:39:35,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 08:39:34" (1/3) ... [2018-04-09 20:39:35,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107c2199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 08:39:35, skipping insertion in model container [2018-04-09 20:39:35,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:39:35" (2/3) ... [2018-04-09 20:39:35,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107c2199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 08:39:35, skipping insertion in model container [2018-04-09 20:39:35,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 08:39:35" (3/3) ... [2018-04-09 20:39:35,593 INFO L107 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:39:35,600 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 20:39:35,607 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-09 20:39:35,643 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 20:39:35,643 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 20:39:35,643 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 20:39:35,643 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 20:39:35,643 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 20:39:35,643 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 20:39:35,644 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 20:39:35,644 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 20:39:35,644 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 20:39:35,644 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 20:39:35,661 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-04-09 20:39:35,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-09 20:39:35,666 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:35,667 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:35,667 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:35,672 INFO L82 PathProgramCache]: Analyzing trace with hash -727582181, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:35,683 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:35,719 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:35,756 INFO L477 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 [2018-04-09 20:39:35,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:35,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:35,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 20:39:35,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-04-09 20:39:35,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:35,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:39:35,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-09 20:39:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:35,797 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:35,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:35,862 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:35,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 20:39:35,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 20:39:35,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 20:39:35,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 20:39:35,882 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 4 states. [2018-04-09 20:39:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:35,973 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-04-09 20:39:35,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 20:39:35,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-09 20:39:35,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:35,982 INFO L225 Difference]: With dead ends: 154 [2018-04-09 20:39:35,983 INFO L226 Difference]: Without dead ends: 88 [2018-04-09 20:39:35,986 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 20:39:36,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-09 20:39:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-04-09 20:39:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-09 20:39:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-04-09 20:39:36,026 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 19 [2018-04-09 20:39:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:36,026 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-04-09 20:39:36,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 20:39:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-04-09 20:39:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-09 20:39:36,027 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:36,027 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:36,027 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:36,027 INFO L82 PathProgramCache]: Analyzing trace with hash -727582180, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:36,033 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:36,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:36,058 INFO L477 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 [2018-04-09 20:39:36,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:36,075 INFO L477 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 [2018-04-09 20:39:36,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:36,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:36,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-09 20:39:36,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:36,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:36,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:39:36,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:36,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-09 20:39:36,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:36,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:36,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-09 20:39:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:36,201 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:36,316 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:36,317 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-04-09 20:39:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:36,346 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:36,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-09 20:39:36,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 20:39:36,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 20:39:36,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-09 20:39:36,349 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 9 states. [2018-04-09 20:39:36,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:36,598 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-04-09 20:39:36,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 20:39:36,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-04-09 20:39:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:36,600 INFO L225 Difference]: With dead ends: 88 [2018-04-09 20:39:36,600 INFO L226 Difference]: Without dead ends: 87 [2018-04-09 20:39:36,601 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-09 20:39:36,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-09 20:39:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-04-09 20:39:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-09 20:39:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-04-09 20:39:36,611 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 19 [2018-04-09 20:39:36,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:36,611 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-04-09 20:39:36,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 20:39:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-04-09 20:39:36,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-09 20:39:36,612 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:36,612 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:36,612 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:36,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1080211127, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:36,619 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:36,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:36,637 INFO L477 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 [2018-04-09 20:39:36,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:36,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:36,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 20:39:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:36,652 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:36,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:36,681 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:36,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 20:39:36,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 20:39:36,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 20:39:36,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 20:39:36,683 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 4 states. [2018-04-09 20:39:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:36,725 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-04-09 20:39:36,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 20:39:36,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-09 20:39:36,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:36,727 INFO L225 Difference]: With dead ends: 87 [2018-04-09 20:39:36,727 INFO L226 Difference]: Without dead ends: 86 [2018-04-09 20:39:36,727 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 20:39:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-09 20:39:36,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-09 20:39:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-09 20:39:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-04-09 20:39:36,733 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 20 [2018-04-09 20:39:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:36,734 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-04-09 20:39:36,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 20:39:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-04-09 20:39:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-09 20:39:36,735 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:36,735 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:36,735 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:36,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1080211126, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:36,741 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:36,757 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:36,766 INFO L477 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 [2018-04-09 20:39:36,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:36,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:36,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-09 20:39:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:36,791 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:36,831 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:36,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-09 20:39:36,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 20:39:36,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 20:39:36,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-09 20:39:36,832 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 7 states. [2018-04-09 20:39:36,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:36,890 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-04-09 20:39:36,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 20:39:36,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-04-09 20:39:36,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:36,892 INFO L225 Difference]: With dead ends: 86 [2018-04-09 20:39:36,892 INFO L226 Difference]: Without dead ends: 85 [2018-04-09 20:39:36,892 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 20:39:36,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-09 20:39:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-04-09 20:39:36,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-09 20:39:36,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-04-09 20:39:36,899 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 20 [2018-04-09 20:39:36,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:36,899 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-04-09 20:39:36,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 20:39:36,899 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-04-09 20:39:36,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-09 20:39:36,900 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:36,900 INFO L355 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] [2018-04-09 20:39:36,900 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:36,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1212360915, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:36,915 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:36,931 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:36,963 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:36,988 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:36,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 20:39:36,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 20:39:36,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 20:39:36,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-09 20:39:36,989 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 6 states. [2018-04-09 20:39:37,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:37,093 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-04-09 20:39:37,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 20:39:37,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-09 20:39:37,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:37,095 INFO L225 Difference]: With dead ends: 89 [2018-04-09 20:39:37,095 INFO L226 Difference]: Without dead ends: 88 [2018-04-09 20:39:37,095 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-09 20:39:37,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-09 20:39:37,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-04-09 20:39:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-09 20:39:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-04-09 20:39:37,100 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 26 [2018-04-09 20:39:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:37,101 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-04-09 20:39:37,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 20:39:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-04-09 20:39:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-09 20:39:37,102 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:37,102 INFO L355 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] [2018-04-09 20:39:37,102 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:37,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1212360916, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:37,111 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:37,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:37,181 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:37,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 12 [2018-04-09 20:39:37,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:37,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 10 [2018-04-09 20:39:37,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:37,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:39:37,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-09 20:39:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:37,239 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:37,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-09 20:39:37,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 20:39:37,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 20:39:37,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-09 20:39:37,241 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 9 states. [2018-04-09 20:39:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:37,371 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-04-09 20:39:37,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-09 20:39:37,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-04-09 20:39:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:37,373 INFO L225 Difference]: With dead ends: 88 [2018-04-09 20:39:37,373 INFO L226 Difference]: Without dead ends: 87 [2018-04-09 20:39:37,373 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-04-09 20:39:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-09 20:39:37,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-04-09 20:39:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-09 20:39:37,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-04-09 20:39:37,381 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 26 [2018-04-09 20:39:37,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:37,381 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-04-09 20:39:37,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 20:39:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-04-09 20:39:37,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-09 20:39:37,382 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:37,382 INFO L355 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, 1] [2018-04-09 20:39:37,383 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:37,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1756922025, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:37,391 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:37,407 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:37,422 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:37,448 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:37,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 20:39:37,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 20:39:37,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 20:39:37,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-09 20:39:37,449 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 6 states. [2018-04-09 20:39:37,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:37,520 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-04-09 20:39:37,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 20:39:37,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-09 20:39:37,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:37,529 INFO L225 Difference]: With dead ends: 99 [2018-04-09 20:39:37,529 INFO L226 Difference]: Without dead ends: 96 [2018-04-09 20:39:37,529 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-09 20:39:37,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-04-09 20:39:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-04-09 20:39:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-09 20:39:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-04-09 20:39:37,536 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 32 [2018-04-09 20:39:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:37,536 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-04-09 20:39:37,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 20:39:37,536 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-04-09 20:39:37,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-09 20:39:37,537 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:37,537 INFO L355 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, 1] [2018-04-09 20:39:37,538 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:37,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1756922024, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:37,551 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:37,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:37,622 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:37,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 10 [2018-04-09 20:39:37,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:37,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 12 [2018-04-09 20:39:37,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:37,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:39:37,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-09 20:39:37,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:37,683 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:37,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-09 20:39:37,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 20:39:37,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 20:39:37,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-09 20:39:37,684 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 9 states. [2018-04-09 20:39:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:37,784 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-04-09 20:39:37,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-09 20:39:37,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-09 20:39:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:37,785 INFO L225 Difference]: With dead ends: 96 [2018-04-09 20:39:37,785 INFO L226 Difference]: Without dead ends: 93 [2018-04-09 20:39:37,785 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-04-09 20:39:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-09 20:39:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-04-09 20:39:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-09 20:39:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-04-09 20:39:37,792 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 32 [2018-04-09 20:39:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:37,793 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-04-09 20:39:37,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 20:39:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-04-09 20:39:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-09 20:39:37,794 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:37,794 INFO L355 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, 1, 1, 1, 1, 1] [2018-04-09 20:39:37,794 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:37,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1638978851, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:37,800 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:37,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:37,841 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:37,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:37,876 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:37,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-09 20:39:37,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 20:39:37,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 20:39:37,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-09 20:39:37,877 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 7 states. [2018-04-09 20:39:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:37,967 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-04-09 20:39:37,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-09 20:39:37,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-04-09 20:39:37,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:37,968 INFO L225 Difference]: With dead ends: 124 [2018-04-09 20:39:37,968 INFO L226 Difference]: Without dead ends: 123 [2018-04-09 20:39:37,969 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-04-09 20:39:37,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-09 20:39:37,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2018-04-09 20:39:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-09 20:39:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-04-09 20:39:37,977 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 36 [2018-04-09 20:39:37,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:37,977 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-04-09 20:39:37,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 20:39:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-04-09 20:39:37,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-09 20:39:37,978 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:37,979 INFO L355 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, 1, 1, 1, 1, 1] [2018-04-09 20:39:37,979 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:37,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1638978850, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:37,986 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:38,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:38,050 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:38,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2018-04-09 20:39:38,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:38,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:38,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:3 [2018-04-09 20:39:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:38,150 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:38,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 12 [2018-04-09 20:39:38,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 20:39:38,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 20:39:38,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-04-09 20:39:38,152 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 13 states. [2018-04-09 20:39:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:38,329 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-04-09 20:39:38,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-09 20:39:38,329 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-04-09 20:39:38,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:38,331 INFO L225 Difference]: With dead ends: 123 [2018-04-09 20:39:38,331 INFO L226 Difference]: Without dead ends: 122 [2018-04-09 20:39:38,331 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-04-09 20:39:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-04-09 20:39:38,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2018-04-09 20:39:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-09 20:39:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-04-09 20:39:38,337 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 36 [2018-04-09 20:39:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:38,337 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-04-09 20:39:38,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 20:39:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-04-09 20:39:38,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-09 20:39:38,339 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:38,339 INFO L355 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:38,339 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:38,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1140513306, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:38,348 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:38,373 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:38,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:38,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-09 20:39:38,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:38,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 20:39:38,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:38,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:38,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:39:38,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:39:38,482 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-09 20:39:38,488 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-09 20:39:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:38,495 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:38,518 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_13| Int)) (or (not (= (select |c_#valid| |v_main_#t~malloc14.base_13|) 0)) (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc14.base_13| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_13| 0)))) is different from false [2018-04-09 20:39:38,523 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_13| Int) (|v_main_#t~malloc13.base_12| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_12| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc13.base_12|) 0)) (not (= (select .cse0 |v_main_#t~malloc14.base_13|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc14.base_13| 1) |v_main_#t~malloc13.base_12| 0) |v_main_#t~malloc14.base_13| 0) |c_old(#valid)|)))) is different from false [2018-04-09 20:39:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:38,566 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:38,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:39:38,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:39:38,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:39:38,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:39:38,567 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 12 states. [2018-04-09 20:39:38,577 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc14.base_13| Int) (|v_main_#t~malloc13.base_12| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_12| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc13.base_12|) 0)) (not (= (select .cse0 |v_main_#t~malloc14.base_13|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc14.base_13| 1) |v_main_#t~malloc13.base_12| 0) |v_main_#t~malloc14.base_13| 0) |c_old(#valid)|))))) is different from false [2018-04-09 20:39:39,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:39,015 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-04-09 20:39:39,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:39:39,015 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-04-09 20:39:39,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:39,017 INFO L225 Difference]: With dead ends: 163 [2018-04-09 20:39:39,017 INFO L226 Difference]: Without dead ends: 148 [2018-04-09 20:39:39,017 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 20:39:39,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-09 20:39:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 142. [2018-04-09 20:39:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-09 20:39:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 158 transitions. [2018-04-09 20:39:39,029 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 158 transitions. Word has length 39 [2018-04-09 20:39:39,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:39,029 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 158 transitions. [2018-04-09 20:39:39,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:39:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 158 transitions. [2018-04-09 20:39:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 20:39:39,030 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:39,030 INFO L355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:39,031 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:39,031 INFO L82 PathProgramCache]: Analyzing trace with hash 816330566, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:39,040 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:39,059 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:39,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:39,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-09 20:39:39,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 20:39:39,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:39,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:39,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:39:39,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:39:39,129 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-09 20:39:39,134 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-09 20:39:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:39,139 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:39,155 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_15| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc14.base_15| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_15| 0)) (not (= (select |c_#valid| |v_main_#t~malloc14.base_15|) 0)))) is different from false [2018-04-09 20:39:39,158 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc13.base_14| Int) (|v_main_#t~malloc14.base_15| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_14| 1))) (or (not (= (select .cse0 |v_main_#t~malloc14.base_15|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc14.base_15| 1) |v_main_#t~malloc13.base_14| 0) |v_main_#t~malloc14.base_15| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc13.base_14|) 0))))) is different from false [2018-04-09 20:39:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:39,192 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:39,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:39:39,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:39:39,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:39:39,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:39:39,193 INFO L87 Difference]: Start difference. First operand 142 states and 158 transitions. Second operand 12 states. [2018-04-09 20:39:39,200 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc13.base_14| Int) (|v_main_#t~malloc14.base_15| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_14| 1))) (or (not (= (select .cse0 |v_main_#t~malloc14.base_15|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc14.base_15| 1) |v_main_#t~malloc13.base_14| 0) |v_main_#t~malloc14.base_15| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc13.base_14|) 0)))))) is different from false [2018-04-09 20:39:39,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:39,569 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-04-09 20:39:39,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:39:39,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-04-09 20:39:39,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:39,570 INFO L225 Difference]: With dead ends: 216 [2018-04-09 20:39:39,570 INFO L226 Difference]: Without dead ends: 201 [2018-04-09 20:39:39,571 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 20:39:39,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-09 20:39:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 143. [2018-04-09 20:39:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-09 20:39:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2018-04-09 20:39:39,580 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 40 [2018-04-09 20:39:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:39,581 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2018-04-09 20:39:39,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:39:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2018-04-09 20:39:39,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 20:39:39,582 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:39,583 INFO L355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:39,583 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:39,583 INFO L82 PathProgramCache]: Analyzing trace with hash 167863009, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:39,589 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:39,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:39,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:39,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-09 20:39:39,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 20:39:39,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:39,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:39,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:39:39,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:39:39,663 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-09 20:39:39,666 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-09 20:39:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:39,670 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:39,689 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_17| Int)) (or (not (= (select |c_#valid| |v_main_#t~malloc14.base_17|) 0)) (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc14.base_17| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_17| 0)))) is different from false [2018-04-09 20:39:39,693 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc13.base_16| Int) (|v_main_#t~malloc14.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_16| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_17| 1) |v_main_#t~malloc13.base_16| 0) |v_main_#t~malloc14.base_17| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_16|))) (not (= (select .cse0 |v_main_#t~malloc14.base_17|) 0))))) is different from false [2018-04-09 20:39:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:39,727 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:39,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:39:39,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:39:39,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:39:39,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:39:39,728 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand 12 states. [2018-04-09 20:39:39,738 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc13.base_16| Int) (|v_main_#t~malloc14.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_16| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_17| 1) |v_main_#t~malloc13.base_16| 0) |v_main_#t~malloc14.base_17| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_16|))) (not (= (select .cse0 |v_main_#t~malloc14.base_17|) 0)))))) is different from false [2018-04-09 20:39:40,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:40,083 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-04-09 20:39:40,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:39:40,084 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-04-09 20:39:40,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:40,085 INFO L225 Difference]: With dead ends: 216 [2018-04-09 20:39:40,085 INFO L226 Difference]: Without dead ends: 201 [2018-04-09 20:39:40,086 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 20:39:40,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-09 20:39:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 143. [2018-04-09 20:39:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-09 20:39:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2018-04-09 20:39:40,094 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 40 [2018-04-09 20:39:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:40,094 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2018-04-09 20:39:40,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:39:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2018-04-09 20:39:40,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-09 20:39:40,095 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:40,095 INFO L355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:40,095 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:40,096 INFO L82 PathProgramCache]: Analyzing trace with hash 728942431, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:40,101 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:40,118 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:40,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:40,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-09 20:39:40,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 20:39:40,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:40,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:40,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:39:40,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:39:40,198 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-09 20:39:40,203 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-09 20:39:40,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:40,207 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:40,229 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_19| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc14.base_19| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_19| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc14.base_19|))))) is different from false [2018-04-09 20:39:40,236 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_19| Int) (|v_main_#t~malloc13.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_18| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc14.base_19| 1) |v_main_#t~malloc13.base_18| 0) |v_main_#t~malloc14.base_19| 0) |c_old(#valid)|) (not (= 0 (select .cse0 |v_main_#t~malloc14.base_19|))) (not (= (select |c_#valid| |v_main_#t~malloc13.base_18|) 0))))) is different from false [2018-04-09 20:39:40,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:40,271 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:40,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:39:40,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:39:40,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:39:40,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:39:40,272 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand 12 states. [2018-04-09 20:39:40,281 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc14.base_19| Int) (|v_main_#t~malloc13.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_18| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc14.base_19| 1) |v_main_#t~malloc13.base_18| 0) |v_main_#t~malloc14.base_19| 0) |c_old(#valid)|) (not (= 0 (select .cse0 |v_main_#t~malloc14.base_19|))) (not (= (select |c_#valid| |v_main_#t~malloc13.base_18|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-09 20:39:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:40,664 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2018-04-09 20:39:40,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:39:40,664 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-04-09 20:39:40,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:40,665 INFO L225 Difference]: With dead ends: 149 [2018-04-09 20:39:40,665 INFO L226 Difference]: Without dead ends: 134 [2018-04-09 20:39:40,666 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 20:39:40,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-09 20:39:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 74. [2018-04-09 20:39:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-09 20:39:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-04-09 20:39:40,675 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 41 [2018-04-09 20:39:40,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:40,676 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-04-09 20:39:40,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:39:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-04-09 20:39:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-09 20:39:40,677 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:40,677 INFO L355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:40,677 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:40,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2128226393, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:40,683 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:40,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:40,708 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:40,731 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:40,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 20:39:40,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 20:39:40,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 20:39:40,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 20:39:40,732 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 3 states. [2018-04-09 20:39:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:40,743 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-04-09 20:39:40,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 20:39:40,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-04-09 20:39:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:40,744 INFO L225 Difference]: With dead ends: 121 [2018-04-09 20:39:40,744 INFO L226 Difference]: Without dead ends: 75 [2018-04-09 20:39:40,744 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 20:39:40,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-09 20:39:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-09 20:39:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-09 20:39:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-04-09 20:39:40,752 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 47 [2018-04-09 20:39:40,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:40,752 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-04-09 20:39:40,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 20:39:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-04-09 20:39:40,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-09 20:39:40,753 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:40,753 INFO L355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:40,753 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:40,753 INFO L82 PathProgramCache]: Analyzing trace with hash 482289896, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:40,759 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:40,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:40,793 INFO L477 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 11 [2018-04-09 20:39:40,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-04-09 20:39:40,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:40,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:40,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:40,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-09 20:39:40,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:40,804 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:40,845 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:40,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2018-04-09 20:39:40,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 20:39:40,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 20:39:40,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-09 20:39:40,846 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 8 states. [2018-04-09 20:39:40,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:40,937 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-04-09 20:39:40,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 20:39:40,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-04-09 20:39:40,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:40,938 INFO L225 Difference]: With dead ends: 128 [2018-04-09 20:39:40,938 INFO L226 Difference]: Without dead ends: 74 [2018-04-09 20:39:40,939 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-04-09 20:39:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-04-09 20:39:40,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-04-09 20:39:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-09 20:39:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-04-09 20:39:40,948 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 47 [2018-04-09 20:39:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:40,948 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-04-09 20:39:40,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 20:39:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-04-09 20:39:40,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-09 20:39:40,949 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:40,949 INFO L355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:40,950 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:40,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1413739344, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:40,958 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:40,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:41,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 20:39:41,003 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 20:39:41,029 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:41,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-09 20:39:41,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 20:39:41,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 20:39:41,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-09 20:39:41,030 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 7 states. [2018-04-09 20:39:41,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:41,086 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-04-09 20:39:41,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 20:39:41,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-04-09 20:39:41,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:41,087 INFO L225 Difference]: With dead ends: 78 [2018-04-09 20:39:41,087 INFO L226 Difference]: Without dead ends: 77 [2018-04-09 20:39:41,087 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-09 20:39:41,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-09 20:39:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-04-09 20:39:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-09 20:39:41,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-04-09 20:39:41,095 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 50 [2018-04-09 20:39:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:41,095 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-04-09 20:39:41,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 20:39:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-04-09 20:39:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-09 20:39:41,095 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:41,095 INFO L355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:41,095 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:41,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1413739345, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:41,108 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:41,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:41,171 INFO L477 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 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:39:41,173 INFO L477 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 11 treesize of output 10 [2018-04-09 20:39:41,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:41,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:41,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:39:41,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-09 20:39:41,225 INFO L477 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 18 treesize of output 14 [2018-04-09 20:39:41,230 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:39:41,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:39:41,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:39:41,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:39:41,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:33 [2018-04-09 20:39:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:41,317 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:41,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 27 treesize of output 25 [2018-04-09 20:39:41,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:41,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 29 treesize of output 25 [2018-04-09 20:39:41,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:41,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-09 20:39:41,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2018-04-09 20:39:41,509 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:41,511 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:41,517 INFO L477 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 17 treesize of output 15 [2018-04-09 20:39:41,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2018-04-09 20:39:41,526 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:41,528 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:41,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:39:41,533 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:57, output treesize:17 [2018-04-09 20:39:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:41,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:39:41,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-04-09 20:39:41,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-09 20:39:41,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-09 20:39:41,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2018-04-09 20:39:41,606 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 25 states. [2018-04-09 20:39:42,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:42,730 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2018-04-09 20:39:42,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-09 20:39:42,764 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-04-09 20:39:42,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:42,766 INFO L225 Difference]: With dead ends: 146 [2018-04-09 20:39:42,766 INFO L226 Difference]: Without dead ends: 145 [2018-04-09 20:39:42,767 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560 [2018-04-09 20:39:42,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-09 20:39:42,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 87. [2018-04-09 20:39:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-09 20:39:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-04-09 20:39:42,780 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 50 [2018-04-09 20:39:42,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:42,781 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-04-09 20:39:42,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-09 20:39:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-04-09 20:39:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-09 20:39:42,781 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:42,782 INFO L355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:42,782 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:42,782 INFO L82 PathProgramCache]: Analyzing trace with hash -270711663, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:42,790 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:42,810 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 20:39:42,831 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:42,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 20:39:42,871 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:42,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-09 20:39:42,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 20:39:42,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 20:39:42,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-09 20:39:42,872 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 7 states. [2018-04-09 20:39:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:42,936 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-04-09 20:39:42,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 20:39:42,936 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-04-09 20:39:42,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:42,937 INFO L225 Difference]: With dead ends: 87 [2018-04-09 20:39:42,937 INFO L226 Difference]: Without dead ends: 86 [2018-04-09 20:39:42,937 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-09 20:39:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-09 20:39:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-09 20:39:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-09 20:39:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-04-09 20:39:42,945 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 50 [2018-04-09 20:39:42,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:42,945 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-04-09 20:39:42,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 20:39:42,946 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-04-09 20:39:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-09 20:39:42,946 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:42,946 INFO L355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:42,946 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:42,947 INFO L82 PathProgramCache]: Analyzing trace with hash -270711662, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:42,965 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:42,986 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:42,999 INFO L477 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 [2018-04-09 20:39:43,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:43,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:43,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 20:39:43,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:43,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:43,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:39:43,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:43,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:43,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-09 20:39:43,043 INFO L477 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 14 treesize of output 11 [2018-04-09 20:39:43,045 INFO L477 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 11 treesize of output 10 [2018-04-09 20:39:43,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:43,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:43,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:39:43,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-09 20:39:43,069 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-09 20:39:43,071 INFO L477 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 11 treesize of output 10 [2018-04-09 20:39:43,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:43,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:43,084 INFO L267 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. [2018-04-09 20:39:43,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-09 20:39:43,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-09 20:39:43,163 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:39:43,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:39:43,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 8 treesize of output 1 [2018-04-09 20:39:43,173 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:43,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:39:43,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:39:43,187 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-04-09 20:39:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:43,293 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:43,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 12 [2018-04-09 20:39:43,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:43,651 INFO L477 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 13 treesize of output 11 [2018-04-09 20:39:43,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-04-09 20:39:43,675 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:43,676 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:43,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:43,682 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-04-09 20:39:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:43,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:39:43,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-04-09 20:39:43,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-09 20:39:43,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-09 20:39:43,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-04-09 20:39:43,744 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 25 states. [2018-04-09 20:39:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:44,453 INFO L93 Difference]: Finished difference Result 198 states and 206 transitions. [2018-04-09 20:39:44,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-09 20:39:44,453 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-04-09 20:39:44,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:44,455 INFO L225 Difference]: With dead ends: 198 [2018-04-09 20:39:44,455 INFO L226 Difference]: Without dead ends: 197 [2018-04-09 20:39:44,455 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=221, Invalid=1185, Unknown=0, NotChecked=0, Total=1406 [2018-04-09 20:39:44,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-09 20:39:44,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 140. [2018-04-09 20:39:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-09 20:39:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2018-04-09 20:39:44,474 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 50 [2018-04-09 20:39:44,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:44,474 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2018-04-09 20:39:44,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-09 20:39:44,474 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2018-04-09 20:39:44,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 20:39:44,475 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:44,475 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:44,476 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:44,476 INFO L82 PathProgramCache]: Analyzing trace with hash -544277930, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:44,489 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:44,509 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-09 20:39:44,530 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-09 20:39:44,557 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:39:44,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2018-04-09 20:39:44,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 20:39:44,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 20:39:44,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-09 20:39:44,558 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 8 states. [2018-04-09 20:39:44,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:44,636 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-04-09 20:39:44,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 20:39:44,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-04-09 20:39:44,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:44,638 INFO L225 Difference]: With dead ends: 140 [2018-04-09 20:39:44,638 INFO L226 Difference]: Without dead ends: 139 [2018-04-09 20:39:44,638 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-04-09 20:39:44,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-09 20:39:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-04-09 20:39:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-09 20:39:44,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2018-04-09 20:39:44,657 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 54 [2018-04-09 20:39:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:44,658 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2018-04-09 20:39:44,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 20:39:44,658 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2018-04-09 20:39:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 20:39:44,659 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:44,659 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:44,659 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:44,659 INFO L82 PathProgramCache]: Analyzing trace with hash -544277929, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:44,668 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:44,687 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:44,691 INFO L477 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 [2018-04-09 20:39:44,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:44,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:44,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 20:39:44,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:44,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:44,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:39:44,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:44,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:44,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-09 20:39:44,728 INFO L477 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 14 treesize of output 11 [2018-04-09 20:39:44,730 INFO L477 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 11 treesize of output 10 [2018-04-09 20:39:44,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:44,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:44,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:39:44,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-09 20:39:44,751 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-09 20:39:44,753 INFO L477 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 11 treesize of output 10 [2018-04-09 20:39:44,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:44,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:44,767 INFO L267 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. [2018-04-09 20:39:44,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-09 20:39:45,621 WARN L148 SmtUtils]: Spent 668ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-09 20:39:45,694 INFO L477 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 43 treesize of output 53 [2018-04-09 20:39:45,702 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2018-04-09 20:39:45,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:39:45,753 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2018-04-09 20:39:45,754 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-09 20:39:45,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-04-09 20:39:45,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:45,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-04-09 20:39:45,809 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:45,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2018-04-09 20:39:45,868 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-09 20:39:45,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 35 treesize of output 28 [2018-04-09 20:39:45,941 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:45,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 31 treesize of output 24 [2018-04-09 20:39:45,942 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:46,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 28 treesize of output 20 [2018-04-09 20:39:46,005 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:46,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 24 treesize of output 16 [2018-04-09 20:39:46,007 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:46,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 35 treesize of output 27 [2018-04-09 20:39:46,066 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:46,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 34 treesize of output 26 [2018-04-09 20:39:46,068 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:46,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 31 treesize of output 23 [2018-04-09 20:39:46,070 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:46,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-09 20:39:46,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 20:39:46,221 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-04-09 20:39:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:46,356 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:46,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 [2018-04-09 20:39:46,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:46,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-04-09 20:39:46,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-04-09 20:39:46,967 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:46,972 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:46,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:46,980 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:69, output treesize:7 [2018-04-09 20:39:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:47,042 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:39:47,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2018-04-09 20:39:47,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-09 20:39:47,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-09 20:39:47,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1205, Unknown=0, NotChecked=0, Total=1332 [2018-04-09 20:39:47,043 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand 37 states. [2018-04-09 20:39:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:49,868 INFO L93 Difference]: Finished difference Result 187 states and 194 transitions. [2018-04-09 20:39:49,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-09 20:39:49,869 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 54 [2018-04-09 20:39:49,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:49,870 INFO L225 Difference]: With dead ends: 187 [2018-04-09 20:39:49,870 INFO L226 Difference]: Without dead ends: 186 [2018-04-09 20:39:49,871 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=797, Invalid=4033, Unknown=0, NotChecked=0, Total=4830 [2018-04-09 20:39:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-09 20:39:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 143. [2018-04-09 20:39:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-09 20:39:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-04-09 20:39:49,885 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 54 [2018-04-09 20:39:49,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:49,885 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-04-09 20:39:49,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-09 20:39:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-04-09 20:39:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-09 20:39:49,885 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:49,886 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:49,886 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:49,886 INFO L82 PathProgramCache]: Analyzing trace with hash -555566326, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:49,891 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:49,912 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:49,915 INFO L477 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 [2018-04-09 20:39:49,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:49,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:49,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 20:39:49,925 INFO L477 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 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-09 20:39:49,927 INFO L477 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 12 treesize of output 11 [2018-04-09 20:39:49,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:49,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:49,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:49,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-09 20:39:49,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 20:39:49,979 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-09 20:39:49,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:39:49,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:39:49,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:39:49,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-09 20:39:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:50,081 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:39:50,375 INFO L477 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 13 [2018-04-09 20:39:50,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2018-04-09 20:39:50,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:50,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:50,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:39:50,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:35 [2018-04-09 20:39:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:39:50,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:39:50,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-04-09 20:39:50,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-09 20:39:50,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-09 20:39:50,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2018-04-09 20:39:50,503 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 30 states. [2018-04-09 20:39:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:39:51,478 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2018-04-09 20:39:51,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-09 20:39:51,479 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 68 [2018-04-09 20:39:51,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:39:51,480 INFO L225 Difference]: With dead ends: 222 [2018-04-09 20:39:51,480 INFO L226 Difference]: Without dead ends: 221 [2018-04-09 20:39:51,480 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=492, Invalid=1958, Unknown=0, NotChecked=0, Total=2450 [2018-04-09 20:39:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-09 20:39:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 128. [2018-04-09 20:39:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-09 20:39:51,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-04-09 20:39:51,493 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 68 [2018-04-09 20:39:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:39:51,494 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-04-09 20:39:51,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-09 20:39:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-04-09 20:39:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-09 20:39:51,495 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:39:51,495 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:39:51,495 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:39:51,496 INFO L82 PathProgramCache]: Analyzing trace with hash -375308912, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:39:51,507 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:39:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:39:51,548 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:39:51,551 INFO L477 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 [2018-04-09 20:39:51,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:51,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:51,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 20:39:51,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:51,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:51,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:39:51,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:51,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:51,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-09 20:39:51,579 INFO L477 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 14 treesize of output 11 [2018-04-09 20:39:51,581 INFO L477 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 11 treesize of output 10 [2018-04-09 20:39:51,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:51,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:51,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:39:51,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-09 20:39:51,599 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-09 20:39:51,601 INFO L477 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 11 treesize of output 10 [2018-04-09 20:39:51,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:51,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:39:51,611 INFO L267 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. [2018-04-09 20:39:51,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-09 20:39:53,745 WARN L148 SmtUtils]: Spent 1997ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-09 20:39:54,796 WARN L148 SmtUtils]: Spent 555ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-09 20:39:54,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 92 [2018-04-09 20:39:54,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 64 treesize of output 57 [2018-04-09 20:39:54,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:55,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:55,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 92 [2018-04-09 20:39:55,831 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-04-09 20:39:56,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:56,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:56,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:56,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 84 [2018-04-09 20:39:56,690 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-04-09 20:39:57,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2018-04-09 20:39:57,684 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:57,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 61 [2018-04-09 20:39:57,687 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:57,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:57,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:57,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-04-09 20:39:57,692 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:57,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:57,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:57,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-04-09 20:39:57,698 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:57,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2018-04-09 20:39:57,701 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:58,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 64 treesize of output 57 [2018-04-09 20:39:58,586 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 20:39:59,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:39:59,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 106 [2018-04-09 20:39:59,474 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 28 xjuncts. [2018-04-09 20:40:00,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:00,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 124 [2018-04-09 20:40:00,696 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 20:40:00,701 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 28 xjuncts. [2018-04-09 20:40:02,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:02,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 106 [2018-04-09 20:40:02,928 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 30 xjuncts. [2018-04-09 20:40:04,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 63 treesize of output 55 [2018-04-09 20:40:04,248 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:04,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 59 treesize of output 51 [2018-04-09 20:40:04,252 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:04,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 58 treesize of output 50 [2018-04-09 20:40:04,254 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:04,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 69 treesize of output 61 [2018-04-09 20:40:04,256 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:05,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 64 treesize of output 56 [2018-04-09 20:40:05,298 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:06,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:06,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 120 [2018-04-09 20:40:06,392 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 20:40:06,396 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 24 xjuncts. [2018-04-09 20:40:07,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:07,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:07,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:07,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 67 [2018-04-09 20:40:07,440 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:08,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 68 treesize of output 61 [2018-04-09 20:40:08,891 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:09,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:09,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 70 [2018-04-09 20:40:09,614 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:11,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 52 treesize of output 45 [2018-04-09 20:40:11,090 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:11,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 56 treesize of output 49 [2018-04-09 20:40:11,121 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:11,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:11,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 76 [2018-04-09 20:40:11,900 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 3 xjuncts. [2018-04-09 20:40:12,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 49 treesize of output 41 [2018-04-09 20:40:12,673 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:12,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 45 treesize of output 37 [2018-04-09 20:40:12,675 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:13,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 55 treesize of output 48 [2018-04-09 20:40:13,419 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:13,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 51 treesize of output 44 [2018-04-09 20:40:13,421 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:14,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2018-04-09 20:40:14,035 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:15,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:15,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 65 [2018-04-09 20:40:15,240 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:15,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:15,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:15,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:15,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 57 [2018-04-09 20:40:15,249 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:15,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 64 treesize of output 56 [2018-04-09 20:40:15,816 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:16,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:16,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:16,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:16,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2018-04-09 20:40:16,903 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:17,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:17,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:17,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:17,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:17,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 109 [2018-04-09 20:40:17,504 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 8 xjuncts. [2018-04-09 20:40:18,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2018-04-09 20:40:18,206 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:20,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2018-04-09 20:40:20,845 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:21,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 72 treesize of output 67 [2018-04-09 20:40:21,535 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:21,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 61 treesize of output 56 [2018-04-09 20:40:21,537 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:21,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 79 treesize of output 77 [2018-04-09 20:40:21,539 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:21,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 78 treesize of output 76 [2018-04-09 20:40:21,542 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:21,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 68 treesize of output 66 [2018-04-09 20:40:21,544 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:22,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:22,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 72 [2018-04-09 20:40:22,189 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 3 xjuncts. [2018-04-09 20:40:22,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2018-04-09 20:40:22,824 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:23,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2018-04-09 20:40:23,446 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:23,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2018-04-09 20:40:23,452 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:23,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 52 treesize of output 45 [2018-04-09 20:40:23,984 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:24,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:24,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 54 [2018-04-09 20:40:24,456 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:24,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 56 treesize of output 48 [2018-04-09 20:40:24,907 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:26,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 60 treesize of output 52 [2018-04-09 20:40:26,176 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:26,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-04-09 20:40:26,597 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:26,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:26,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 61 [2018-04-09 20:40:26,991 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:26,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:26,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:26,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:27,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 53 [2018-04-09 20:40:27,001 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:27,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:27,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:27,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:27,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 82 [2018-04-09 20:40:27,383 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 8 xjuncts. [2018-04-09 20:40:27,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 49 treesize of output 44 [2018-04-09 20:40:27,765 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:29,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:40:29,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 94 [2018-04-09 20:40:29,321 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 30 xjuncts. [2018-04-09 20:40:30,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 57 dim-1 vars, End of recursive call: and 20 xjuncts. [2018-04-09 20:40:31,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-09 20:40:31,024 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 10 variables, input treesize:86, output treesize:135 [2018-04-09 20:40:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:40:31,252 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:40:34,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 12 [2018-04-09 20:40:34,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:34,903 INFO L477 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 0 case distinctions, treesize of input 239 treesize of output 119 [2018-04-09 20:40:35,024 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 74 DAG size of output 55 [2018-04-09 20:40:35,027 INFO L477 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 12 treesize of output 11 [2018-04-09 20:40:35,027 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:35,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 76 [2018-04-09 20:40:35,072 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:35,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 86 [2018-04-09 20:40:35,089 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-04-09 20:40:35,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 58 treesize of output 50 [2018-04-09 20:40:35,275 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:35,347 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:35,348 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:35,350 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:35,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 68 [2018-04-09 20:40:35,355 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:35,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2018-04-09 20:40:35,437 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:35,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 46 treesize of output 44 [2018-04-09 20:40:35,888 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:35,970 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:35,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 49 [2018-04-09 20:40:35,972 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:35,974 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:35,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2018-04-09 20:40:35,974 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:36,105 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:36,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 63 [2018-04-09 20:40:36,112 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:36,227 INFO L267 ElimStorePlain]: Start of recursive call 5: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 20:40:36,242 INFO L477 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 3 case distinctions, treesize of input 62 treesize of output 72 [2018-04-09 20:40:36,246 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:36,247 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:36,247 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:36,248 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:36,249 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:36,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-04-09 20:40:36,249 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:36,363 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:36,363 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:36,365 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:36,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 66 [2018-04-09 20:40:36,371 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:36,491 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:36,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 82 [2018-04-09 20:40:36,507 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 8 xjuncts. [2018-04-09 20:40:36,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 42 treesize of output 40 [2018-04-09 20:40:36,607 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:36,863 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:36,863 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:36,865 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:36,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 69 [2018-04-09 20:40:36,870 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:36,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2018-04-09 20:40:36,944 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:37,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 37 [2018-04-09 20:40:37,106 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:37,141 INFO L267 ElimStorePlain]: Start of recursive call 14: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 20:40:37,155 INFO L477 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 3 case distinctions, treesize of input 55 treesize of output 65 [2018-04-09 20:40:37,159 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:37,160 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:37,160 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:37,160 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:37,161 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:37,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 49 [2018-04-09 20:40:37,162 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:37,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 50 treesize of output 42 [2018-04-09 20:40:37,261 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:37,354 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:37,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 78 [2018-04-09 20:40:37,370 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 8 xjuncts. [2018-04-09 20:40:37,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 47 treesize of output 39 [2018-04-09 20:40:37,490 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:37,585 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:37,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 55 [2018-04-09 20:40:37,591 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:37,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2018-04-09 20:40:37,691 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:37,817 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:37,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 78 [2018-04-09 20:40:37,833 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 8 xjuncts. [2018-04-09 20:40:37,958 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:37,958 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:37,960 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:37,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 59 [2018-04-09 20:40:37,965 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:38,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 30 [2018-04-09 20:40:38,019 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:38,094 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:38,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 75 [2018-04-09 20:40:38,110 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 8 xjuncts. [2018-04-09 20:40:38,151 INFO L267 ElimStorePlain]: Start of recursive call 22: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 20:40:38,166 INFO L477 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 3 case distinctions, treesize of input 62 treesize of output 72 [2018-04-09 20:40:38,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 54 treesize of output 46 [2018-04-09 20:40:38,170 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:38,278 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:38,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 62 [2018-04-09 20:40:38,284 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:38,404 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:38,404 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:38,405 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:38,405 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:38,406 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:38,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2018-04-09 20:40:38,407 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:38,520 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:38,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 82 [2018-04-09 20:40:38,536 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 8 xjuncts. [2018-04-09 20:40:38,637 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:38,638 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:38,640 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:38,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 64 [2018-04-09 20:40:38,645 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:38,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 44 treesize of output 42 [2018-04-09 20:40:38,718 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:38,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 37 [2018-04-09 20:40:38,780 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:38,839 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:38,839 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:38,840 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:38,840 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:38,841 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:40:38,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-04-09 20:40:38,842 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:38,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 42 treesize of output 40 [2018-04-09 20:40:38,900 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-09 20:40:39,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2018-04-09 20:40:39,011 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-04-09 20:40:39,122 INFO L267 ElimStorePlain]: Start of recursive call 33: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 20:40:39,203 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 32 xjuncts. [2018-04-09 20:40:39,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 20:40:39,334 INFO L202 ElimStorePlain]: Needed 43 recursive calls to eliminate 10 variables, input treesize:260, output treesize:37 [2018-04-09 20:40:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:40:39,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:40:39,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27] total 55 [2018-04-09 20:40:39,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-09 20:40:39,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-09 20:40:39,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2824, Unknown=1, NotChecked=0, Total=3080 [2018-04-09 20:40:39,427 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 56 states. [2018-04-09 20:40:41,662 WARN L151 SmtUtils]: Spent 1379ms on a formula simplification. DAG size of input: 87 DAG size of output 75 [2018-04-09 20:40:44,320 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 131 DAG size of output 105 [2018-04-09 20:40:44,512 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 100 DAG size of output 87 [2018-04-09 20:40:44,766 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 114 DAG size of output 101 [2018-04-09 20:40:52,451 WARN L151 SmtUtils]: Spent 5492ms on a formula simplification. DAG size of input: 100 DAG size of output 88 [2018-04-09 20:40:56,699 WARN L151 SmtUtils]: Spent 4119ms on a formula simplification. DAG size of input: 100 DAG size of output 85 [2018-04-09 20:40:57,246 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 122 DAG size of output 92 [2018-04-09 20:40:57,560 WARN L151 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 138 DAG size of output 108 [2018-04-09 20:41:00,366 WARN L151 SmtUtils]: Spent 2680ms on a formula simplification. DAG size of input: 138 DAG size of output 94 [2018-04-09 20:41:03,585 WARN L151 SmtUtils]: Spent 3122ms on a formula simplification. DAG size of input: 137 DAG size of output 93 [2018-04-09 20:41:03,808 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 130 DAG size of output 106 [2018-04-09 20:41:04,937 WARN L151 SmtUtils]: Spent 1029ms on a formula simplification. DAG size of input: 124 DAG size of output 89 [2018-04-09 20:41:05,169 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 126 DAG size of output 102 [2018-04-09 20:41:10,898 WARN L151 SmtUtils]: Spent 1966ms on a formula simplification. DAG size of input: 104 DAG size of output 89 [2018-04-09 20:41:15,471 WARN L151 SmtUtils]: Spent 4234ms on a formula simplification. DAG size of input: 108 DAG size of output 90 [2018-04-09 20:41:16,232 WARN L151 SmtUtils]: Spent 632ms on a formula simplification. DAG size of input: 123 DAG size of output 93 [2018-04-09 20:41:16,454 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 139 DAG size of output 109 [2018-04-09 20:41:16,865 WARN L151 SmtUtils]: Spent 307ms on a formula simplification. DAG size of input: 139 DAG size of output 96 [2018-04-09 20:41:21,686 WARN L151 SmtUtils]: Spent 4682ms on a formula simplification. DAG size of input: 138 DAG size of output 93 [2018-04-09 20:41:22,837 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 131 DAG size of output 107 [2018-04-09 20:41:23,298 WARN L151 SmtUtils]: Spent 371ms on a formula simplification. DAG size of input: 127 DAG size of output 90 [2018-04-09 20:41:25,550 WARN L151 SmtUtils]: Spent 1394ms on a formula simplification. DAG size of input: 127 DAG size of output 103 [2018-04-09 20:41:31,397 WARN L151 SmtUtils]: Spent 4124ms on a formula simplification. DAG size of input: 101 DAG size of output 80 [2018-04-09 20:41:31,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:41:31,735 INFO L93 Difference]: Finished difference Result 173 states and 179 transitions. [2018-04-09 20:41:31,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-09 20:41:31,735 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 72 [2018-04-09 20:41:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:41:31,736 INFO L225 Difference]: With dead ends: 173 [2018-04-09 20:41:31,736 INFO L226 Difference]: Without dead ends: 172 [2018-04-09 20:41:31,739 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3048 ImplicationChecksByTransitivity, 56.0s TimeCoverageRelationStatistics Valid=2533, Invalid=11506, Unknown=3, NotChecked=0, Total=14042 [2018-04-09 20:41:31,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-09 20:41:31,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 104. [2018-04-09 20:41:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-09 20:41:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-04-09 20:41:31,750 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 72 [2018-04-09 20:41:31,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:41:31,750 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-04-09 20:41:31,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-09 20:41:31,750 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-04-09 20:41:31,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-09 20:41:31,751 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:41:31,751 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:41:31,751 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:41:31,752 INFO L82 PathProgramCache]: Analyzing trace with hash 493848144, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:41:31,761 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:41:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:41:31,797 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:41:31,801 INFO L477 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 [2018-04-09 20:41:31,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:31,808 INFO L477 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 [2018-04-09 20:41:31,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:31,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:41:31,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 20:41:31,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:41:31,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-09 20:41:31,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:31,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:41:31,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:41:31,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:41:31,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:31,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:41:31,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-09 20:41:31,872 INFO L477 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 15 treesize of output 12 [2018-04-09 20:41:31,873 INFO L477 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 12 treesize of output 11 [2018-04-09 20:41:31,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:31,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:41:31,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:41:31,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-09 20:41:31,893 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-09 20:41:31,895 INFO L477 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 13 treesize of output 12 [2018-04-09 20:41:31,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:31,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:41:31,903 INFO L267 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. [2018-04-09 20:41:31,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-09 20:41:32,055 INFO L477 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 31 treesize of output 29 [2018-04-09 20:41:32,061 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-09 20:41:32,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:41:32,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 10 treesize of output 1 [2018-04-09 20:41:32,070 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:32,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:41:32,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:41:32,081 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-04-09 20:41:32,188 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:41:32,188 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:41:32,648 INFO L477 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 13 treesize of output 11 [2018-04-09 20:41:32,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-04-09 20:41:32,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:32,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:41:32,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:41:32,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-04-09 20:41:33,182 WARN L148 SmtUtils]: Spent 420ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-09 20:41:34,119 WARN L148 SmtUtils]: Spent 889ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-09 20:41:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:41:34,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:41:34,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2018-04-09 20:41:34,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-09 20:41:34,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-09 20:41:34,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2018-04-09 20:41:34,164 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 32 states. [2018-04-09 20:41:36,473 WARN L151 SmtUtils]: Spent 1977ms on a formula simplification. DAG size of input: 42 DAG size of output 34 [2018-04-09 20:41:36,906 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 65 DAG size of output 50 [2018-04-09 20:41:37,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:41:37,920 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2018-04-09 20:41:37,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-09 20:41:37,921 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 74 [2018-04-09 20:41:37,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:41:37,922 INFO L225 Difference]: With dead ends: 142 [2018-04-09 20:41:37,922 INFO L226 Difference]: Without dead ends: 141 [2018-04-09 20:41:37,923 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=448, Invalid=2204, Unknown=0, NotChecked=0, Total=2652 [2018-04-09 20:41:37,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-09 20:41:37,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 91. [2018-04-09 20:41:37,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-09 20:41:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-04-09 20:41:37,940 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 74 [2018-04-09 20:41:37,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:41:37,940 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-04-09 20:41:37,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-09 20:41:37,940 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-04-09 20:41:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-09 20:41:37,941 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:41:37,941 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2018-04-09 20:41:37,941 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:41:37,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1836176107, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:41:37,950 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:41:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:41:37,980 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:41:37,996 INFO L477 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 [2018-04-09 20:41:37,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:38,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:41:38,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 20:41:38,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:41:38,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:41:38,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:41:38,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:38,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:41:38,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-09 20:41:38,032 INFO L477 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 14 treesize of output 11 [2018-04-09 20:41:38,034 INFO L477 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 11 treesize of output 10 [2018-04-09 20:41:38,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:38,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:41:38,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:41:38,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-09 20:41:38,076 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-09 20:41:38,078 INFO L477 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 11 treesize of output 10 [2018-04-09 20:41:38,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:38,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:41:38,106 INFO L267 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. [2018-04-09 20:41:38,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-09 20:41:39,304 WARN L148 SmtUtils]: Spent 735ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-09 20:41:39,415 INFO L477 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 53 treesize of output 61 [2018-04-09 20:41:39,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:41:39,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 58 [2018-04-09 20:41:39,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:41:39,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:41:39,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 72 [2018-04-09 20:41:39,512 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-09 20:41:39,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:41:39,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 87 [2018-04-09 20:41:39,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-04-09 20:41:39,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-04-09 20:41:39,780 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:39,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-04-09 20:41:39,782 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:39,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 40 treesize of output 32 [2018-04-09 20:41:39,884 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:39,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 43 treesize of output 35 [2018-04-09 20:41:39,886 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:39,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 44 treesize of output 36 [2018-04-09 20:41:39,888 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:39,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 49 treesize of output 42 [2018-04-09 20:41:39,957 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:40,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:41:40,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 51 [2018-04-09 20:41:40,018 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-09 20:41:40,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 37 treesize of output 29 [2018-04-09 20:41:40,081 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:40,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 33 treesize of output 25 [2018-04-09 20:41:40,083 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:40,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-09 20:41:40,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 20:41:40,205 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:75, output treesize:104 [2018-04-09 20:41:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:41:40,378 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:41:41,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 [2018-04-09 20:41:41,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:41,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41 [2018-04-09 20:41:41,510 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:41:41,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-04-09 20:41:41,512 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:41:41,535 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:41:41,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2018-04-09 20:41:41,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-09 20:41:41,550 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:41:41,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:41:41,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:84, output treesize:10 [2018-04-09 20:41:41,631 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:41:41,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:41:41,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 44 [2018-04-09 20:41:41,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-09 20:41:41,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-09 20:41:41,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1817, Unknown=0, NotChecked=0, Total=1980 [2018-04-09 20:41:41,653 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 45 states. [2018-04-09 20:41:47,189 WARN L151 SmtUtils]: Spent 3456ms on a formula simplification. DAG size of input: 108 DAG size of output 92 [2018-04-09 20:41:47,388 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 108 DAG size of output 89 [2018-04-09 20:41:49,557 WARN L151 SmtUtils]: Spent 2106ms on a formula simplification. DAG size of input: 121 DAG size of output 93 [2018-04-09 20:41:54,415 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 116 DAG size of output 91 [2018-04-09 20:41:57,147 WARN L151 SmtUtils]: Spent 2060ms on a formula simplification. DAG size of input: 81 DAG size of output 68 [2018-04-09 20:42:00,327 WARN L151 SmtUtils]: Spent 2076ms on a formula simplification. DAG size of input: 97 DAG size of output 81 [2018-04-09 20:42:01,417 WARN L151 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 82 DAG size of output 70 [2018-04-09 20:42:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:42:03,460 INFO L93 Difference]: Finished difference Result 199 states and 206 transitions. [2018-04-09 20:42:03,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-09 20:42:03,460 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 78 [2018-04-09 20:42:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:42:03,461 INFO L225 Difference]: With dead ends: 199 [2018-04-09 20:42:03,461 INFO L226 Difference]: Without dead ends: 198 [2018-04-09 20:42:03,463 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1993 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=1406, Invalid=7521, Unknown=3, NotChecked=0, Total=8930 [2018-04-09 20:42:03,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-09 20:42:03,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 109. [2018-04-09 20:42:03,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-09 20:42:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-04-09 20:42:03,484 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 78 [2018-04-09 20:42:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:42:03,484 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-04-09 20:42:03,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-09 20:42:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-04-09 20:42:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-04-09 20:42:03,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:42:03,485 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:42:03,485 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-09 20:42:03,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1718385870, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:42:03,491 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:42:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:42:03,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:42:03,525 INFO L477 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 [2018-04-09 20:42:03,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:03,530 INFO L477 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 [2018-04-09 20:42:03,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:03,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:42:03,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 20:42:03,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:03,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:03,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:42:03,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:03,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-09 20:42:03,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:03,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:42:03,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-09 20:42:03,572 INFO L477 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 16 treesize of output 13 [2018-04-09 20:42:03,573 INFO L477 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 13 treesize of output 12 [2018-04-09 20:42:03,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:03,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:42:03,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:42:03,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-09 20:42:03,595 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-09 20:42:03,596 INFO L477 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 13 treesize of output 12 [2018-04-09 20:42:03,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:03,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:42:03,606 INFO L267 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. [2018-04-09 20:42:03,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-04-09 20:42:05,963 WARN L148 SmtUtils]: Spent 2028ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-09 20:42:08,485 WARN L148 SmtUtils]: Spent 2036ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-09 20:42:08,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 96 [2018-04-09 20:42:08,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-04-09 20:42:08,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:09,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:09,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 116 [2018-04-09 20:42:09,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 24 xjuncts. [2018-04-09 20:42:10,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:10,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 140 [2018-04-09 20:42:10,756 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 20:42:10,760 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 24 xjuncts. [2018-04-09 20:42:12,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:12,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 144 [2018-04-09 20:42:12,031 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 20:42:12,035 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 28 xjuncts. [2018-04-09 20:42:13,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 67 treesize of output 57 [2018-04-09 20:42:13,308 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:13,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 79 treesize of output 69 [2018-04-09 20:42:13,310 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:13,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 73 treesize of output 63 [2018-04-09 20:42:13,313 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:13,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 68 treesize of output 58 [2018-04-09 20:42:13,316 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:14,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:14,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 140 [2018-04-09 20:42:14,252 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 20:42:14,258 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 24 xjuncts. [2018-04-09 20:42:16,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 66 [2018-04-09 20:42:16,170 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-09 20:42:17,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:17,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:17,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:17,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:17,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 115 [2018-04-09 20:42:17,065 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-04-09 20:42:18,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:18,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 69 [2018-04-09 20:42:18,091 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-09 20:42:18,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:18,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:18,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:18,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 61 [2018-04-09 20:42:18,101 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-09 20:42:19,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 45 treesize of output 35 [2018-04-09 20:42:19,091 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:19,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 51 treesize of output 41 [2018-04-09 20:42:19,092 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:19,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:19,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:19,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:19,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 76 [2018-04-09 20:42:19,967 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-04-09 20:42:20,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2018-04-09 20:42:20,815 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:20,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2018-04-09 20:42:20,817 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:23,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:23,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 136 [2018-04-09 20:42:23,260 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 20:42:23,264 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 24 xjuncts. [2018-04-09 20:42:24,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:24,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 84 [2018-04-09 20:42:24,065 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 3 xjuncts. [2018-04-09 20:42:24,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 66 [2018-04-09 20:42:24,712 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-04-09 20:42:25,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-04-09 20:42:25,354 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:25,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2018-04-09 20:42:25,356 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:25,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 52 treesize of output 50 [2018-04-09 20:42:25,990 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:25,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 46 treesize of output 44 [2018-04-09 20:42:25,992 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:26,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:26,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:26,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:26,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 61 [2018-04-09 20:42:26,620 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-04-09 20:42:26,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:26,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 69 [2018-04-09 20:42:26,629 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-04-09 20:42:27,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:27,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 107 [2018-04-09 20:42:27,174 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 3 xjuncts. [2018-04-09 20:42:28,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:28,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 88 [2018-04-09 20:42:28,759 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 3 xjuncts. [2018-04-09 20:42:29,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 67 treesize of output 60 [2018-04-09 20:42:29,311 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:29,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 82 treesize of output 75 [2018-04-09 20:42:29,312 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:30,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 67 treesize of output 60 [2018-04-09 20:42:30,308 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:31,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 60 treesize of output 50 [2018-04-09 20:42:31,795 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:32,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:32,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 102 [2018-04-09 20:42:32,330 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 30 xjuncts. [2018-04-09 20:42:35,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:35,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:35,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:35,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 98 [2018-04-09 20:42:35,699 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 8 xjuncts. [2018-04-09 20:42:37,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 56 treesize of output 49 [2018-04-09 20:42:37,885 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:38,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 60 treesize of output 50 [2018-04-09 20:42:38,949 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:39,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 80 treesize of output 75 [2018-04-09 20:42:39,469 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:39,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 86 treesize of output 84 [2018-04-09 20:42:39,472 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:39,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 87 treesize of output 85 [2018-04-09 20:42:39,474 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:39,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 65 treesize of output 60 [2018-04-09 20:42:39,476 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:39,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 72 treesize of output 70 [2018-04-09 20:42:39,477 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:39,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:39,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 60 [2018-04-09 20:42:39,956 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-04-09 20:42:40,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:40,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:40,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:40,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 94 [2018-04-09 20:42:40,881 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 8 xjuncts. [2018-04-09 20:42:41,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:41,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:41,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-04-09 20:42:41,420 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:41,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2018-04-09 20:42:41,422 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:41,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 64 [2018-04-09 20:42:41,424 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:41,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:41,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:42:41,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-04-09 20:42:41,427 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:41,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 65 [2018-04-09 20:42:41,429 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:42,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 65 treesize of output 55 [2018-04-09 20:42:42,809 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:43,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 55 treesize of output 50 [2018-04-09 20:42:43,329 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:43,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 57 dim-1 vars, End of recursive call: and 20 xjuncts. [2018-04-09 20:42:43,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-09 20:42:43,817 INFO L202 ElimStorePlain]: Needed 53 recursive calls to eliminate 8 variables, input treesize:86, output treesize:283 [2018-04-09 20:42:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 11 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:42:44,069 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:42:46,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 67 [2018-04-09 20:42:47,025 WARN L151 SmtUtils]: Spent 260ms on a formula simplification. DAG size of input: 177 DAG size of output 141 [2018-04-09 20:42:47,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 51 treesize of output 43 [2018-04-09 20:42:47,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:42:47,129 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:42:47,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2018-04-09 20:42:47,137 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-09 20:42:47,241 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:42:47,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 64 [2018-04-09 20:42:47,259 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-04-09 20:42:47,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:42:47,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:42:47,331 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:124, output treesize:62 [2018-04-09 20:42:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:42:47,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:42:47,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 63 [2018-04-09 20:42:47,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-09 20:42:47,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-09 20:42:47,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=3734, Unknown=0, NotChecked=0, Total=4032 [2018-04-09 20:42:47,645 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 64 states. [2018-04-09 20:42:48,746 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 130 DAG size of output 111 [2018-04-09 20:42:49,090 WARN L151 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 134 DAG size of output 115 [2018-04-09 20:42:49,455 WARN L151 SmtUtils]: Spent 238ms on a formula simplification. DAG size of input: 138 DAG size of output 119 [2018-04-09 20:42:49,833 WARN L151 SmtUtils]: Spent 253ms on a formula simplification. DAG size of input: 132 DAG size of output 113 [2018-04-09 20:42:50,274 WARN L151 SmtUtils]: Spent 298ms on a formula simplification. DAG size of input: 141 DAG size of output 122 [2018-04-09 20:42:50,997 WARN L151 SmtUtils]: Spent 591ms on a formula simplification. DAG size of input: 148 DAG size of output 111 [2018-04-09 20:42:51,334 WARN L151 SmtUtils]: Spent 212ms on a formula simplification. DAG size of input: 152 DAG size of output 114 [2018-04-09 20:42:51,786 WARN L151 SmtUtils]: Spent 335ms on a formula simplification. DAG size of input: 123 DAG size of output 91 [2018-04-09 20:42:52,120 WARN L151 SmtUtils]: Spent 212ms on a formula simplification. DAG size of input: 156 DAG size of output 118 [2018-04-09 20:42:52,508 WARN L151 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 151 DAG size of output 114 [2018-04-09 20:42:54,940 WARN L151 SmtUtils]: Spent 270ms on a formula simplification. DAG size of input: 146 DAG size of output 110 [2018-04-09 20:42:57,361 WARN L151 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 134 DAG size of output 98 [2018-04-09 20:42:57,711 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 143 DAG size of output 117 [2018-04-09 20:42:58,432 WARN L151 SmtUtils]: Spent 586ms on a formula simplification. DAG size of input: 148 DAG size of output 108 [2018-04-09 20:43:00,892 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 140 DAG size of output 121 [2018-04-09 20:43:01,852 WARN L151 SmtUtils]: Spent 381ms on a formula simplification. DAG size of input: 123 DAG size of output 94 [2018-04-09 20:43:02,185 WARN L151 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 120 DAG size of output 101 [2018-04-09 20:43:02,432 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 109 DAG size of output 84 [2018-04-09 20:43:02,948 WARN L151 SmtUtils]: Spent 382ms on a formula simplification. DAG size of input: 124 DAG size of output 105 [2018-04-09 20:43:03,245 WARN L151 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 111 DAG size of output 86 [2018-04-09 20:43:03,538 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 130 DAG size of output 111 [2018-04-09 20:43:03,821 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 122 DAG size of output 103 [2018-04-09 20:43:04,142 WARN L151 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 127 DAG size of output 108 [2018-04-09 20:43:04,420 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 72 DAG size of output 60 [2018-04-09 20:43:04,704 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 134 DAG size of output 101 [2018-04-09 20:43:05,012 WARN L151 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 138 DAG size of output 104 [2018-04-09 20:43:05,329 WARN L151 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 110 DAG size of output 78 [2018-04-09 20:43:05,681 WARN L151 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 152 DAG size of output 112 [2018-04-09 20:43:05,974 WARN L151 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 78 DAG size of output 66 [2018-04-09 20:43:06,309 WARN L151 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 147 DAG size of output 108 [2018-04-09 20:43:06,641 WARN L151 SmtUtils]: Spent 222ms on a formula simplification. DAG size of input: 85 DAG size of output 73 [2018-04-09 20:43:07,443 WARN L151 SmtUtils]: Spent 275ms on a formula simplification. DAG size of input: 142 DAG size of output 104 [2018-04-09 20:43:07,796 WARN L151 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 85 DAG size of output 70 [2018-04-09 20:43:08,234 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 124 DAG size of output 93 [2018-04-09 20:43:08,484 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 89 DAG size of output 74 [2018-04-09 20:43:08,868 WARN L151 SmtUtils]: Spent 263ms on a formula simplification. DAG size of input: 92 DAG size of output 77 [2018-04-09 20:43:09,321 WARN L151 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 105 DAG size of output 93 [2018-04-09 20:43:09,628 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 108 DAG size of output 80 [2018-04-09 20:43:10,156 WARN L151 SmtUtils]: Spent 361ms on a formula simplification. DAG size of input: 106 DAG size of output 78 [2018-04-09 20:43:11,895 WARN L151 SmtUtils]: Spent 1474ms on a formula simplification. DAG size of input: 103 DAG size of output 91 [2018-04-09 20:43:12,116 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 117 DAG size of output 85 [2018-04-09 20:43:14,499 WARN L151 SmtUtils]: Spent 2249ms on a formula simplification. DAG size of input: 138 DAG size of output 103 [2018-04-09 20:43:15,031 WARN L151 SmtUtils]: Spent 254ms on a formula simplification. DAG size of input: 102 DAG size of output 74 [2018-04-09 20:43:15,577 WARN L151 SmtUtils]: Spent 231ms on a formula simplification. DAG size of input: 99 DAG size of output 87 [2018-04-09 20:43:16,191 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 114 DAG size of output 85 [2018-04-09 20:43:20,228 WARN L151 SmtUtils]: Spent 2160ms on a formula simplification. DAG size of input: 102 DAG size of output 78 [2018-04-09 20:43:20,655 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 84 DAG size of output 72 [2018-04-09 20:43:21,018 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 80 DAG size of output 68 [2018-04-09 20:43:21,518 WARN L151 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 107 DAG size of output 77 [2018-04-09 20:43:21,884 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 88 DAG size of output 68 [2018-04-09 20:43:24,611 WARN L151 SmtUtils]: Spent 279ms on a formula simplification. DAG size of input: 82 DAG size of output 70 [2018-04-09 20:43:27,846 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 90 DAG size of output 70 [2018-04-09 20:43:28,247 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 82 DAG size of output 70 [2018-04-09 20:43:28,568 WARN L151 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 102 DAG size of output 86 [2018-04-09 20:43:29,069 WARN L151 SmtUtils]: Spent 377ms on a formula simplification. DAG size of input: 92 DAG size of output 76 [2018-04-09 20:43:34,220 WARN L151 SmtUtils]: Spent 1715ms on a formula simplification. DAG size of input: 103 DAG size of output 87 [2018-04-09 20:43:36,580 WARN L151 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 90 DAG size of output 74 [2018-04-09 20:43:38,401 WARN L151 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 76 DAG size of output 64 [2018-04-09 20:43:38,922 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 129 DAG size of output 97 [2018-04-09 20:43:40,276 WARN L151 SmtUtils]: Spent 1244ms on a formula simplification. DAG size of input: 89 DAG size of output 77 [2018-04-09 20:43:40,608 WARN L151 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 96 DAG size of output 84 [2018-04-09 20:43:40,881 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 96 DAG size of output 81 [2018-04-09 20:43:41,130 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 100 DAG size of output 85 [2018-04-09 20:43:41,428 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 114 DAG size of output 88 [2018-04-09 20:43:41,862 WARN L151 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 130 DAG size of output 106 [2018-04-09 20:43:42,264 WARN L151 SmtUtils]: Spent 247ms on a formula simplification. DAG size of input: 130 DAG size of output 92 [2018-04-09 20:43:42,760 WARN L151 SmtUtils]: Spent 312ms on a formula simplification. DAG size of input: 129 DAG size of output 90 [2018-04-09 20:43:43,213 WARN L151 SmtUtils]: Spent 237ms on a formula simplification. DAG size of input: 122 DAG size of output 104 [2018-04-09 20:43:43,714 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 121 DAG size of output 87 [2018-04-09 20:43:44,472 WARN L151 SmtUtils]: Spent 518ms on a formula simplification. DAG size of input: 118 DAG size of output 86 [2018-04-09 20:43:45,307 WARN L151 SmtUtils]: Spent 607ms on a formula simplification. DAG size of input: 118 DAG size of output 100 [2018-04-09 20:43:52,236 WARN L151 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 100 DAG size of output 84 [2018-04-09 20:43:52,857 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 91 DAG size of output 79 [2018-04-09 20:43:55,404 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 60 DAG size of output 52 [2018-04-09 20:43:56,211 WARN L151 SmtUtils]: Spent 417ms on a formula simplification. DAG size of input: 98 DAG size of output 82 [2018-04-09 20:43:57,180 WARN L151 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 89 DAG size of output 77 [2018-04-09 20:43:57,585 WARN L151 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 62 DAG size of output 54 [2018-04-09 20:43:58,248 WARN L151 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 92 DAG size of output 76 Received shutdown request... [2018-04-09 20:43:58,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-09 20:43:58,288 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 20:43:58,291 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 20:43:58,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 08:43:58 BoogieIcfgContainer [2018-04-09 20:43:58,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 20:43:58,292 INFO L168 Benchmark]: Toolchain (without parser) took 263588.40 ms. Allocated memory was 304.1 MB in the beginning and 404.2 MB in the end (delta: 100.1 MB). Free memory was 240.0 MB in the beginning and 295.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 44.4 MB. Max. memory is 5.3 GB. [2018-04-09 20:43:58,293 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 304.1 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 20:43:58,293 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.66 ms. Allocated memory is still 304.1 MB. Free memory was 240.0 MB in the beginning and 216.1 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-09 20:43:58,293 INFO L168 Benchmark]: Boogie Preprocessor took 56.30 ms. Allocated memory is still 304.1 MB. Free memory was 216.1 MB in the beginning and 213.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-09 20:43:58,294 INFO L168 Benchmark]: RCFGBuilder took 499.12 ms. Allocated memory was 304.1 MB in the beginning and 464.5 MB in the end (delta: 160.4 MB). Free memory was 213.1 MB in the beginning and 396.8 MB in the end (delta: -183.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-04-09 20:43:58,294 INFO L168 Benchmark]: TraceAbstraction took 262704.28 ms. Allocated memory was 464.5 MB in the beginning and 404.2 MB in the end (delta: -60.3 MB). Free memory was 396.8 MB in the beginning and 295.8 MB in the end (delta: 100.9 MB). Peak memory consumption was 40.6 MB. Max. memory is 5.3 GB. [2018-04-09 20:43:58,295 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 304.1 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 324.66 ms. Allocated memory is still 304.1 MB. Free memory was 240.0 MB in the beginning and 216.1 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 56.30 ms. Allocated memory is still 304.1 MB. Free memory was 216.1 MB in the beginning and 213.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 499.12 ms. Allocated memory was 304.1 MB in the beginning and 464.5 MB in the end (delta: 160.4 MB). Free memory was 213.1 MB in the beginning and 396.8 MB in the end (delta: -183.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 262704.28 ms. Allocated memory was 464.5 MB in the beginning and 404.2 MB in the end (delta: -60.3 MB). Free memory was 396.8 MB in the beginning and 295.8 MB in the end (delta: 100.9 MB). Peak memory consumption was 40.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 567]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 93 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 93 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. - TimeoutResultAtElement [Line: 567]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 93 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 93 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 93 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 93 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 93 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 93 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 93 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 93 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 93 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 93 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 93 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 93 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 93 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 102 locations, 15 error locations. TIMEOUT Result, 262.6s OverallTime, 27 OverallIterations, 4 TraceHistogramMax, 157.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2167 SDtfs, 7809 SDslu, 13467 SDs, 0 SdLazy, 9388 SolverSat, 410 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 19.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2786 GetRequests, 1974 SyntacticMatches, 25 SemanticMatches, 786 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 12236 ImplicationChecksByTransitivity, 159.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 729 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 103.6s InterpolantComputationTime, 1216 NumberOfCodeBlocks, 1216 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2378 ConstructedInterpolants, 500 QuantifiedInterpolants, 2492113 SizeOfPredicates, 344 NumberOfNonLiveVariables, 3803 ConjunctsInSsa, 598 ConjunctsInUnsatCore, 54 InterpolantComputations, 38 PerfectInterpolantSequences, 51/376 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_20-43-58-302.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_20-43-58-302.csv Completed graceful shutdown