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-1cf7e2d-m [2018-03-29 20:47:48,957 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-29 20:47:48,958 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-29 20:47:48,972 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-29 20:47:48,972 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-29 20:47:48,973 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-29 20:47:48,974 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-29 20:47:48,976 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-29 20:47:48,978 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-29 20:47:48,979 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-29 20:47:48,980 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-29 20:47:48,980 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-29 20:47:48,981 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-29 20:47:48,982 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-29 20:47:48,983 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-29 20:47:48,985 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-29 20:47:48,987 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-29 20:47:48,989 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-29 20:47:48,990 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-29 20:47:48,991 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-29 20:47:48,993 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-29 20:47:48,994 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-29 20:47:48,994 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-29 20:47:48,995 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-29 20:47:48,996 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-29 20:47:48,997 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-29 20:47:48,997 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-29 20:47:48,998 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-29 20:47:48,999 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-29 20:47:48,999 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-29 20:47:49,000 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-29 20:47:49,000 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-03-29 20:47:49,023 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-29 20:47:49,024 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-29 20:47:49,024 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-29 20:47:49,024 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-29 20:47:49,025 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-29 20:47:49,025 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-29 20:47:49,025 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-29 20:47:49,025 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-29 20:47:49,026 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-29 20:47:49,026 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-29 20:47:49,026 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-29 20:47:49,026 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-29 20:47:49,026 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-29 20:47:49,027 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-29 20:47:49,027 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-29 20:47:49,027 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-29 20:47:49,027 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-29 20:47:49,027 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-29 20:47:49,028 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-29 20:47:49,028 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-29 20:47:49,028 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-29 20:47:49,028 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-29 20:47:49,028 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-29 20:47:49,028 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-29 20:47:49,029 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-29 20:47:49,029 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-29 20:47:49,029 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-29 20:47:49,029 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-29 20:47:49,029 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-29 20:47:49,030 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-29 20:47:49,030 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-29 20:47:49,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:47:49,030 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-29 20:47:49,031 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-29 20:47:49,031 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-29 20:47:49,031 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-29 20:47:49,031 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-29 20:47:49,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-29 20:47:49,074 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-29 20:47:49,078 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-29 20:47:49,079 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-29 20:47:49,079 INFO L276 PluginConnector]: CDTParser initialized [2018-03-29 20:47:49,080 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-03-29 20:47:49,369 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6ba7ede35 [2018-03-29 20:47:49,534 INFO L287 CDTParser]: IsIndexed: true [2018-03-29 20:47:49,534 INFO L288 CDTParser]: Found 1 translation units. [2018-03-29 20:47:49,534 INFO L168 CDTParser]: Scanning substring-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:47:49,545 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-29 20:47:49,545 INFO L215 ultiparseSymbolTable]: [2018-03-29 20:47:49,545 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-29 20:47:49,546 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-03-29 20:47:49,546 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-03-29 20:47:49,546 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-03-29 20:47:49,546 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in substring-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:47:49,546 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-29 20:47:49,546 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-03-29 20:47:49,546 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-03-29 20:47:49,546 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-03-29 20:47:49,547 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-03-29 20:47:49,547 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-03-29 20:47:49,547 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-03-29 20:47:49,547 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-03-29 20:47:49,547 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-03-29 20:47:49,547 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-03-29 20:47:49,547 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-03-29 20:47:49,547 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-03-29 20:47:49,547 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-03-29 20:47:49,548 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-03-29 20:47:49,548 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-03-29 20:47:49,548 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-03-29 20:47:49,548 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-03-29 20:47:49,548 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-03-29 20:47:49,548 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-03-29 20:47:49,548 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-03-29 20:47:49,548 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-03-29 20:47:49,548 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-03-29 20:47:49,548 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-03-29 20:47:49,548 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-03-29 20:47:49,548 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-03-29 20:47:49,548 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-03-29 20:47:49,549 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-03-29 20:47:49,549 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-03-29 20:47:49,549 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-03-29 20:47:49,549 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-03-29 20:47:49,549 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-03-29 20:47:49,549 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-03-29 20:47:49,549 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-03-29 20:47:49,549 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-03-29 20:47:49,549 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-03-29 20:47:49,549 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-03-29 20:47:49,549 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-03-29 20:47:49,549 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-03-29 20:47:49,549 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-03-29 20:47:49,550 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-03-29 20:47:49,550 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-03-29 20:47:49,550 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-03-29 20:47:49,550 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-03-29 20:47:49,550 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-03-29 20:47:49,550 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-03-29 20:47:49,550 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-03-29 20:47:49,550 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-03-29 20:47:49,550 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-03-29 20:47:49,550 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-03-29 20:47:49,550 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-03-29 20:47:49,550 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-03-29 20:47:49,550 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-03-29 20:47:49,551 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-03-29 20:47:49,551 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-03-29 20:47:49,551 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-03-29 20:47:49,551 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-03-29 20:47:49,551 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-03-29 20:47:49,551 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-03-29 20:47:49,551 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-03-29 20:47:49,551 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-03-29 20:47:49,551 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-03-29 20:47:49,551 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-03-29 20:47:49,551 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-03-29 20:47:49,552 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-03-29 20:47:49,552 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-03-29 20:47:49,552 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-03-29 20:47:49,552 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-03-29 20:47:49,552 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-03-29 20:47:49,552 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-03-29 20:47:49,552 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-03-29 20:47:49,552 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-03-29 20:47:49,552 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-03-29 20:47:49,553 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-03-29 20:47:49,553 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-03-29 20:47:49,553 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-03-29 20:47:49,553 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-03-29 20:47:49,553 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-03-29 20:47:49,553 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-03-29 20:47:49,553 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-03-29 20:47:49,553 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-03-29 20:47:49,553 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-03-29 20:47:49,553 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-03-29 20:47:49,554 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-03-29 20:47:49,554 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-03-29 20:47:49,554 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-03-29 20:47:49,554 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-03-29 20:47:49,554 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-03-29 20:47:49,554 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-03-29 20:47:49,554 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-03-29 20:47:49,554 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-03-29 20:47:49,554 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-03-29 20:47:49,554 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-03-29 20:47:49,555 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-03-29 20:47:49,555 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-03-29 20:47:49,555 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-03-29 20:47:49,555 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-03-29 20:47:49,555 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-03-29 20:47:49,555 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-03-29 20:47:49,555 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-03-29 20:47:49,555 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-03-29 20:47:49,555 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-03-29 20:47:49,555 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-03-29 20:47:49,556 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-03-29 20:47:49,556 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-03-29 20:47:49,556 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-03-29 20:47:49,556 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-03-29 20:47:49,556 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-03-29 20:47:49,556 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-03-29 20:47:49,556 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-03-29 20:47:49,556 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-03-29 20:47:49,557 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-03-29 20:47:49,557 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-03-29 20:47:49,557 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-03-29 20:47:49,557 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-03-29 20:47:49,557 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-03-29 20:47:49,557 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-03-29 20:47:49,557 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-03-29 20:47:49,557 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-03-29 20:47:49,557 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-03-29 20:47:49,558 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-03-29 20:47:49,558 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-03-29 20:47:49,574 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6ba7ede35 [2018-03-29 20:47:49,579 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-29 20:47:49,582 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-29 20:47:49,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-29 20:47:49,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-29 20:47:49,588 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-29 20:47:49,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 08:47:49" (1/1) ... [2018-03-29 20:47:49,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27278b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:47:49, skipping insertion in model container [2018-03-29 20:47:49,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 08:47:49" (1/1) ... [2018-03-29 20:47:49,604 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 20:47:49,634 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 20:47:49,797 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 20:47:49,844 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 20:47:49,851 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-03-29 20:47:49,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:47:49 WrapperNode [2018-03-29 20:47:49,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-29 20:47:49,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-29 20:47:49,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-29 20:47:49,901 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-29 20:47:49,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:47:49" (1/1) ... [2018-03-29 20:47:49,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:47:49" (1/1) ... [2018-03-29 20:47:49,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:47:49" (1/1) ... [2018-03-29 20:47:49,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:47:49" (1/1) ... [2018-03-29 20:47:49,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:47:49" (1/1) ... [2018-03-29 20:47:49,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:47:49" (1/1) ... [2018-03-29 20:47:49,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:47:49" (1/1) ... [2018-03-29 20:47:49,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-29 20:47:49,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-29 20:47:49,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-29 20:47:49,960 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-29 20:47:49,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:47:49" (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-03-29 20:47:50,074 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-29 20:47:50,074 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-29 20:47:50,074 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-03-29 20:47:50,074 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-03-29 20:47:50,075 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-03-29 20:47:50,075 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-29 20:47:50,075 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-03-29 20:47:50,075 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-03-29 20:47:50,075 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-03-29 20:47:50,075 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-03-29 20:47:50,075 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-03-29 20:47:50,075 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-03-29 20:47:50,076 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-03-29 20:47:50,076 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-03-29 20:47:50,076 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-03-29 20:47:50,076 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-03-29 20:47:50,076 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-03-29 20:47:50,076 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-03-29 20:47:50,076 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-03-29 20:47:50,077 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-03-29 20:47:50,077 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-03-29 20:47:50,077 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-03-29 20:47:50,077 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-03-29 20:47:50,077 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-03-29 20:47:50,077 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-03-29 20:47:50,077 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-03-29 20:47:50,077 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-03-29 20:47:50,078 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-03-29 20:47:50,078 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-03-29 20:47:50,078 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-03-29 20:47:50,078 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-03-29 20:47:50,078 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-03-29 20:47:50,078 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-03-29 20:47:50,078 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-03-29 20:47:50,078 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-03-29 20:47:50,078 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-03-29 20:47:50,078 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-03-29 20:47:50,078 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-03-29 20:47:50,078 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-03-29 20:47:50,079 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-03-29 20:47:50,079 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-03-29 20:47:50,079 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-03-29 20:47:50,079 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-03-29 20:47:50,079 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-03-29 20:47:50,079 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-03-29 20:47:50,079 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-03-29 20:47:50,079 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-03-29 20:47:50,079 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-03-29 20:47:50,080 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-03-29 20:47:50,080 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-03-29 20:47:50,080 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-03-29 20:47:50,080 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-03-29 20:47:50,080 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-03-29 20:47:50,080 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-03-29 20:47:50,080 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-03-29 20:47:50,080 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-03-29 20:47:50,080 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-03-29 20:47:50,080 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-03-29 20:47:50,080 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-29 20:47:50,081 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-03-29 20:47:50,081 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-03-29 20:47:50,081 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-29 20:47:50,081 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-03-29 20:47:50,081 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-03-29 20:47:50,081 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-03-29 20:47:50,081 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-03-29 20:47:50,081 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-03-29 20:47:50,081 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-03-29 20:47:50,081 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-03-29 20:47:50,081 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-03-29 20:47:50,081 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-03-29 20:47:50,081 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-03-29 20:47:50,082 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-03-29 20:47:50,082 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-03-29 20:47:50,082 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-03-29 20:47:50,082 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-03-29 20:47:50,082 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-03-29 20:47:50,082 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-03-29 20:47:50,082 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-03-29 20:47:50,082 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-03-29 20:47:50,082 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-03-29 20:47:50,082 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-03-29 20:47:50,082 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-03-29 20:47:50,082 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-03-29 20:47:50,082 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-03-29 20:47:50,083 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-03-29 20:47:50,083 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-03-29 20:47:50,083 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-03-29 20:47:50,083 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-03-29 20:47:50,083 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-03-29 20:47:50,083 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-03-29 20:47:50,083 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-03-29 20:47:50,083 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-03-29 20:47:50,084 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-03-29 20:47:50,084 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-03-29 20:47:50,084 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-03-29 20:47:50,084 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-03-29 20:47:50,084 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-03-29 20:47:50,084 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-03-29 20:47:50,084 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-03-29 20:47:50,084 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-03-29 20:47:50,085 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-03-29 20:47:50,085 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-03-29 20:47:50,085 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-03-29 20:47:50,085 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-03-29 20:47:50,085 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-03-29 20:47:50,085 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-03-29 20:47:50,085 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-03-29 20:47:50,085 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-03-29 20:47:50,086 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-03-29 20:47:50,086 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-29 20:47:50,086 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-29 20:47:50,086 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-29 20:47:50,086 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-29 20:47:50,086 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-29 20:47:50,086 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-29 20:47:50,087 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-29 20:47:50,087 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-29 20:47:50,491 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-29 20:47:50,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 08:47:50 BoogieIcfgContainer [2018-03-29 20:47:50,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-29 20:47:50,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-29 20:47:50,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-29 20:47:50,495 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-29 20:47:50,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 08:47:49" (1/3) ... [2018-03-29 20:47:50,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ab70c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 08:47:50, skipping insertion in model container [2018-03-29 20:47:50,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:47:49" (2/3) ... [2018-03-29 20:47:50,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ab70c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 08:47:50, skipping insertion in model container [2018-03-29 20:47:50,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 08:47:50" (3/3) ... [2018-03-29 20:47:50,497 INFO L107 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:47:50,504 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-29 20:47:50,509 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-03-29 20:47:50,551 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-29 20:47:50,552 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-29 20:47:50,552 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-29 20:47:50,552 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-29 20:47:50,552 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-29 20:47:50,552 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-29 20:47:50,552 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-29 20:47:50,552 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-29 20:47:50,552 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-29 20:47:50,553 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-29 20:47:50,565 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-03-29 20:47:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-03-29 20:47:50,570 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:50,570 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-03-29 20:47:50,571 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:50,574 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-03-29 20:47:50,585 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:50,625 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:50,661 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-03-29 20:47:50,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:50,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:50,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 20:47:50,693 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-03-29 20:47:50,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:50,701 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-03-29 20:47:50,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-03-29 20:47:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:50,715 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:50,761 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:50,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-29 20:47:50,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-29 20:47:50,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-29 20:47:50,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-29 20:47:50,776 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 4 states. [2018-03-29 20:47:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:50,871 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-03-29 20:47:50,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-29 20:47:50,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-03-29 20:47:50,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:50,880 INFO L225 Difference]: With dead ends: 154 [2018-03-29 20:47:50,880 INFO L226 Difference]: Without dead ends: 88 [2018-03-29 20:47:50,884 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-03-29 20:47:50,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-03-29 20:47:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-03-29 20:47:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-03-29 20:47:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-03-29 20:47:50,920 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 19 [2018-03-29 20:47:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:50,920 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-03-29 20:47:50,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-29 20:47:50,921 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-03-29 20:47:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-03-29 20:47:50,921 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:50,921 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-03-29 20:47:50,921 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:50,922 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-03-29 20:47:50,928 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:50,944 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:50,952 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-03-29 20:47:50,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:50,967 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-03-29 20:47:50,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:50,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:50,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-03-29 20:47:51,012 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:47:51,015 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:47:51,016 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-03-29 20:47:51,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:51,032 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-03-29 20:47:51,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:51,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:51,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-03-29 20:47:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:51,065 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:51,177 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:51,178 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-03-29 20:47:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:51,220 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:51,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-03-29 20:47:51,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-29 20:47:51,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-29 20:47:51,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-03-29 20:47:51,223 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 9 states. [2018-03-29 20:47:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:51,389 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-03-29 20:47:51,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 20:47:51,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-03-29 20:47:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:51,391 INFO L225 Difference]: With dead ends: 88 [2018-03-29 20:47:51,391 INFO L226 Difference]: Without dead ends: 87 [2018-03-29 20:47:51,392 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-03-29 20:47:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-03-29 20:47:51,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-03-29 20:47:51,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-03-29 20:47:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-03-29 20:47:51,402 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 19 [2018-03-29 20:47:51,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:51,402 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-03-29 20:47:51,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-29 20:47:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-03-29 20:47:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-03-29 20:47:51,403 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:51,403 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-03-29 20:47:51,403 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:51,403 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-03-29 20:47:51,409 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:51,423 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:51,428 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-03-29 20:47:51,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:51,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:51,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 20:47:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:51,457 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:51,482 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:51,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-29 20:47:51,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-29 20:47:51,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-29 20:47:51,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-29 20:47:51,483 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 4 states. [2018-03-29 20:47:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:51,525 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-03-29 20:47:51,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-29 20:47:51,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-03-29 20:47:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:51,526 INFO L225 Difference]: With dead ends: 87 [2018-03-29 20:47:51,526 INFO L226 Difference]: Without dead ends: 86 [2018-03-29 20:47:51,527 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-03-29 20:47:51,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-03-29 20:47:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-03-29 20:47:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-03-29 20:47:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-03-29 20:47:51,533 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 20 [2018-03-29 20:47:51,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:51,533 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-03-29 20:47:51,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-29 20:47:51,533 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-03-29 20:47:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-03-29 20:47:51,534 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:51,534 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-03-29 20:47:51,534 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:51,534 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-03-29 20:47:51,540 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:51,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:51,577 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-03-29 20:47:51,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:51,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:51,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-03-29 20:47:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:51,596 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:51,635 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:51,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-03-29 20:47:51,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-29 20:47:51,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-29 20:47:51,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-03-29 20:47:51,636 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 7 states. [2018-03-29 20:47:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:51,725 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-03-29 20:47:51,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 20:47:51,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-03-29 20:47:51,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:51,727 INFO L225 Difference]: With dead ends: 86 [2018-03-29 20:47:51,727 INFO L226 Difference]: Without dead ends: 85 [2018-03-29 20:47:51,727 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-03-29 20:47:51,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-03-29 20:47:51,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-03-29 20:47:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-03-29 20:47:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-03-29 20:47:51,734 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 20 [2018-03-29 20:47:51,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:51,735 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-03-29 20:47:51,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-29 20:47:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-03-29 20:47:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-03-29 20:47:51,736 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:51,737 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-03-29 20:47:51,737 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:51,737 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-03-29 20:47:51,745 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:51,762 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:51,817 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:51,844 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:51,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-03-29 20:47:51,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 20:47:51,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 20:47:51,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-29 20:47:51,846 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 6 states. [2018-03-29 20:47:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:51,921 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-03-29 20:47:51,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 20:47:51,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-03-29 20:47:51,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:51,922 INFO L225 Difference]: With dead ends: 89 [2018-03-29 20:47:51,922 INFO L226 Difference]: Without dead ends: 88 [2018-03-29 20:47:51,922 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-03-29 20:47:51,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-03-29 20:47:51,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-03-29 20:47:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-03-29 20:47:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-03-29 20:47:51,927 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 26 [2018-03-29 20:47:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:51,928 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-03-29 20:47:51,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 20:47:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-03-29 20:47:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-03-29 20:47:51,929 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:51,929 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-03-29 20:47:51,929 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:51,929 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-03-29 20:47:51,937 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:51,953 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:52,010 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:52,020 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-03-29 20:47:52,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:52,038 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-03-29 20:47:52,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:52,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:47:52,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-03-29 20:47:52,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:52,073 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:52,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-03-29 20:47:52,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-29 20:47:52,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-29 20:47:52,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-03-29 20:47:52,074 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 9 states. [2018-03-29 20:47:52,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:52,212 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-03-29 20:47:52,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-29 20:47:52,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-03-29 20:47:52,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:52,213 INFO L225 Difference]: With dead ends: 88 [2018-03-29 20:47:52,214 INFO L226 Difference]: Without dead ends: 87 [2018-03-29 20:47:52,214 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-03-29 20:47:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-03-29 20:47:52,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-03-29 20:47:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-03-29 20:47:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-03-29 20:47:52,223 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 26 [2018-03-29 20:47:52,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:52,223 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-03-29 20:47:52,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-29 20:47:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-03-29 20:47:52,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-03-29 20:47:52,224 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:52,224 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-03-29 20:47:52,224 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:52,225 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-03-29 20:47:52,231 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:52,250 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:52,265 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:52,293 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:52,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-03-29 20:47:52,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 20:47:52,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 20:47:52,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-29 20:47:52,295 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 6 states. [2018-03-29 20:47:52,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:52,367 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-03-29 20:47:52,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 20:47:52,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-03-29 20:47:52,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:52,369 INFO L225 Difference]: With dead ends: 99 [2018-03-29 20:47:52,370 INFO L226 Difference]: Without dead ends: 96 [2018-03-29 20:47:52,370 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-03-29 20:47:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-03-29 20:47:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-03-29 20:47:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-03-29 20:47:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-03-29 20:47:52,376 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 32 [2018-03-29 20:47:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:52,377 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-03-29 20:47:52,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 20:47:52,377 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-03-29 20:47:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-03-29 20:47:52,378 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:52,378 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-03-29 20:47:52,378 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:52,378 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-03-29 20:47:52,384 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:52,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:52,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:52,442 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:52,450 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-03-29 20:47:52,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:52,457 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-03-29 20:47:52,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:52,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:47:52,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-03-29 20:47:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:52,495 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:52,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-03-29 20:47:52,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-29 20:47:52,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-29 20:47:52,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-03-29 20:47:52,496 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 9 states. [2018-03-29 20:47:52,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:52,594 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-03-29 20:47:52,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-29 20:47:52,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-03-29 20:47:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:52,595 INFO L225 Difference]: With dead ends: 96 [2018-03-29 20:47:52,595 INFO L226 Difference]: Without dead ends: 93 [2018-03-29 20:47:52,595 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-03-29 20:47:52,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-03-29 20:47:52,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-03-29 20:47:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-03-29 20:47:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-03-29 20:47:52,603 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 32 [2018-03-29 20:47:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:52,603 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-03-29 20:47:52,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-29 20:47:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-03-29 20:47:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-03-29 20:47:52,605 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:52,605 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-03-29 20:47:52,605 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:52,605 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-03-29 20:47:52,611 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:52,629 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:52,656 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:52,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:52,681 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:52,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-03-29 20:47:52,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-29 20:47:52,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-29 20:47:52,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-03-29 20:47:52,682 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 7 states. [2018-03-29 20:47:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:52,767 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-03-29 20:47:52,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-29 20:47:52,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-03-29 20:47:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:52,768 INFO L225 Difference]: With dead ends: 124 [2018-03-29 20:47:52,768 INFO L226 Difference]: Without dead ends: 123 [2018-03-29 20:47:52,769 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-03-29 20:47:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-03-29 20:47:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2018-03-29 20:47:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-03-29 20:47:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-03-29 20:47:52,776 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 36 [2018-03-29 20:47:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:52,776 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-03-29 20:47:52,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-29 20:47:52,777 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-03-29 20:47:52,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-03-29 20:47:52,778 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:52,778 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-03-29 20:47:52,778 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:52,778 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-03-29 20:47:52,784 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:52,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:52,859 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:52,908 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-03-29 20:47:52,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:52,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:52,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:3 [2018-03-29 20:47:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:52,947 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:52,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 12 [2018-03-29 20:47:52,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-03-29 20:47:52,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-03-29 20:47:52,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-03-29 20:47:52,947 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 13 states. [2018-03-29 20:47:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:53,155 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-03-29 20:47:53,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-29 20:47:53,156 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-03-29 20:47:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:53,156 INFO L225 Difference]: With dead ends: 123 [2018-03-29 20:47:53,157 INFO L226 Difference]: Without dead ends: 122 [2018-03-29 20:47:53,157 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-03-29 20:47:53,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-03-29 20:47:53,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2018-03-29 20:47:53,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-03-29 20:47:53,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-03-29 20:47:53,164 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 36 [2018-03-29 20:47:53,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:53,164 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-03-29 20:47:53,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-03-29 20:47:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-03-29 20:47:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-03-29 20:47:53,166 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:53,166 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-03-29 20:47:53,166 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:53,166 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-03-29 20:47:53,175 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:53,207 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:53,243 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:47:53,244 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-03-29 20:47:53,247 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:47:53,247 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-03-29 20:47:53,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:53,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:53,257 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-03-29 20:47:53,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:47:53,291 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-03-29 20:47:53,297 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-03-29 20:47:53,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:53,305 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:53,334 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-03-29 20:47:53,340 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-03-29 20:47:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:53,377 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:53,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:47:53,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:47:53,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:47:53,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:47:53,378 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 12 states. [2018-03-29 20:47:53,387 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-03-29 20:47:53,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:53,895 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-03-29 20:47:53,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:47:53,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-03-29 20:47:53,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:53,896 INFO L225 Difference]: With dead ends: 163 [2018-03-29 20:47:53,896 INFO L226 Difference]: Without dead ends: 148 [2018-03-29 20:47:53,897 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-03-29 20:47:53,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-03-29 20:47:53,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 142. [2018-03-29 20:47:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-03-29 20:47:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 158 transitions. [2018-03-29 20:47:53,905 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 158 transitions. Word has length 39 [2018-03-29 20:47:53,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:53,905 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 158 transitions. [2018-03-29 20:47:53,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:47:53,905 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 158 transitions. [2018-03-29 20:47:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-03-29 20:47:53,906 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:53,906 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-03-29 20:47:53,906 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:53,906 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-03-29 20:47:53,914 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:53,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:53,967 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:47:53,967 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-03-29 20:47:53,972 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-03-29 20:47:53,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:53,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:53,982 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-03-29 20:47:53,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:47:54,014 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-03-29 20:47:54,018 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-03-29 20:47:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:54,022 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:54,038 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-03-29 20:47:54,042 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-03-29 20:47:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:54,074 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:54,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:47:54,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:47:54,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:47:54,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:47:54,075 INFO L87 Difference]: Start difference. First operand 142 states and 158 transitions. Second operand 12 states. [2018-03-29 20:47:54,083 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-03-29 20:47:54,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:54,484 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-03-29 20:47:54,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:47:54,484 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-03-29 20:47:54,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:54,485 INFO L225 Difference]: With dead ends: 216 [2018-03-29 20:47:54,485 INFO L226 Difference]: Without dead ends: 201 [2018-03-29 20:47:54,486 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-03-29 20:47:54,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-03-29 20:47:54,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 143. [2018-03-29 20:47:54,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-03-29 20:47:54,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2018-03-29 20:47:54,498 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 40 [2018-03-29 20:47:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:54,498 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2018-03-29 20:47:54,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:47:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2018-03-29 20:47:54,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-03-29 20:47:54,500 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:54,500 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-03-29 20:47:54,500 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:54,500 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-03-29 20:47:54,510 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:54,527 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:54,559 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:47:54,560 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-03-29 20:47:54,562 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-03-29 20:47:54,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:54,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:54,570 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-03-29 20:47:54,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:47:54,595 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-03-29 20:47:54,598 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-03-29 20:47:54,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:54,603 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:54,621 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-03-29 20:47:54,625 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-03-29 20:47:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:54,660 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:54,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:47:54,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:47:54,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:47:54,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:47:54,661 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand 12 states. [2018-03-29 20:47:54,671 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-03-29 20:47:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:55,008 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-03-29 20:47:55,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:47:55,009 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-03-29 20:47:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:55,009 INFO L225 Difference]: With dead ends: 216 [2018-03-29 20:47:55,010 INFO L226 Difference]: Without dead ends: 201 [2018-03-29 20:47:55,010 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-03-29 20:47:55,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-03-29 20:47:55,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 143. [2018-03-29 20:47:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-03-29 20:47:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2018-03-29 20:47:55,020 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 40 [2018-03-29 20:47:55,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:55,020 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2018-03-29 20:47:55,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:47:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2018-03-29 20:47:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-03-29 20:47:55,021 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:55,021 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-03-29 20:47:55,021 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:55,021 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-03-29 20:47:55,027 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:55,042 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:55,074 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:47:55,075 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-03-29 20:47:55,076 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-03-29 20:47:55,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:55,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:55,083 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-03-29 20:47:55,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:47:55,108 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-03-29 20:47:55,112 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-03-29 20:47:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:55,117 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:55,134 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-03-29 20:47:55,141 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-03-29 20:47:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:55,186 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:55,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:47:55,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:47:55,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:47:55,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:47:55,187 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand 12 states. [2018-03-29 20:47:55,201 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-03-29 20:47:55,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:55,549 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2018-03-29 20:47:55,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:47:55,550 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-03-29 20:47:55,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:55,550 INFO L225 Difference]: With dead ends: 149 [2018-03-29 20:47:55,551 INFO L226 Difference]: Without dead ends: 134 [2018-03-29 20:47:55,551 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-03-29 20:47:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-03-29 20:47:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 74. [2018-03-29 20:47:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-03-29 20:47:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-03-29 20:47:55,559 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 41 [2018-03-29 20:47:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:55,559 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-03-29 20:47:55,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:47:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-03-29 20:47:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-03-29 20:47:55,560 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:55,560 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-03-29 20:47:55,560 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:55,561 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-03-29 20:47:55,569 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:55,588 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:55,594 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:55,618 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:55,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-29 20:47:55,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-29 20:47:55,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-29 20:47:55,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-29 20:47:55,619 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 3 states. [2018-03-29 20:47:55,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:55,631 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-03-29 20:47:55,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-29 20:47:55,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-03-29 20:47:55,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:55,632 INFO L225 Difference]: With dead ends: 121 [2018-03-29 20:47:55,632 INFO L226 Difference]: Without dead ends: 75 [2018-03-29 20:47:55,632 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-03-29 20:47:55,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-03-29 20:47:55,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-03-29 20:47:55,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-03-29 20:47:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-03-29 20:47:55,638 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 47 [2018-03-29 20:47:55,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:55,638 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-03-29 20:47:55,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-29 20:47:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-03-29 20:47:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-03-29 20:47:55,639 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:55,639 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-03-29 20:47:55,639 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:55,639 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-03-29 20:47:55,645 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:55,659 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:55,678 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-03-29 20:47:55,680 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-03-29 20:47:55,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:55,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:55,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:55,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-03-29 20:47:55,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:55,688 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:55,730 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:55,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2018-03-29 20:47:55,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-29 20:47:55,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-29 20:47:55,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-03-29 20:47:55,731 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 8 states. [2018-03-29 20:47:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:55,816 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-03-29 20:47:55,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-29 20:47:55,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-03-29 20:47:55,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:55,817 INFO L225 Difference]: With dead ends: 128 [2018-03-29 20:47:55,817 INFO L226 Difference]: Without dead ends: 74 [2018-03-29 20:47:55,817 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-03-29 20:47:55,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-03-29 20:47:55,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-03-29 20:47:55,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-03-29 20:47:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-03-29 20:47:55,823 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 47 [2018-03-29 20:47:55,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:55,824 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-03-29 20:47:55,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-29 20:47:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-03-29 20:47:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-03-29 20:47:55,825 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:55,825 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-03-29 20:47:55,825 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:55,825 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-03-29 20:47:55,832 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:55,852 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-29 20:47:55,873 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-29 20:47:55,903 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:55,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-03-29 20:47:55,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-29 20:47:55,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-29 20:47:55,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-03-29 20:47:55,904 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 7 states. [2018-03-29 20:47:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:55,957 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-03-29 20:47:55,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-29 20:47:55,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-03-29 20:47:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:55,958 INFO L225 Difference]: With dead ends: 78 [2018-03-29 20:47:55,958 INFO L226 Difference]: Without dead ends: 77 [2018-03-29 20:47:55,958 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-03-29 20:47:55,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-03-29 20:47:55,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-03-29 20:47:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-03-29 20:47:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-03-29 20:47:55,964 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 50 [2018-03-29 20:47:55,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:55,964 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-03-29 20:47:55,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-29 20:47:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-03-29 20:47:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-03-29 20:47:55,965 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:55,965 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-03-29 20:47:55,965 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:55,965 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-03-29 20:47:55,971 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:55,991 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:56,047 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-03-29 20:47:56,049 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-03-29 20:47:56,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:56,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:56,057 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-03-29 20:47:56,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-03-29 20:47:56,105 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-03-29 20:47:56,111 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-03-29 20:47:56,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:47:56,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:47:56,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:47:56,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:33 [2018-03-29 20:47:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:56,205 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:56,364 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-03-29 20:47:56,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:56,373 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-03-29 20:47:56,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:56,381 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-03-29 20:47:56,390 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-03-29 20:47:56,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:56,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:56,399 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-03-29 20:47:56,407 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-03-29 20:47:56,408 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:56,410 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:56,415 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-03-29 20:47:56,415 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:57, output treesize:17 [2018-03-29 20:47:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:56,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:47:56,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-03-29 20:47:56,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-03-29 20:47:56,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-03-29 20:47:56,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2018-03-29 20:47:56,489 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 25 states. [2018-03-29 20:47:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:57,202 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2018-03-29 20:47:57,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-03-29 20:47:57,202 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-03-29 20:47:57,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:57,205 INFO L225 Difference]: With dead ends: 146 [2018-03-29 20:47:57,205 INFO L226 Difference]: Without dead ends: 145 [2018-03-29 20:47:57,205 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-03-29 20:47:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-03-29 20:47:57,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 87. [2018-03-29 20:47:57,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-03-29 20:47:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-03-29 20:47:57,219 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 50 [2018-03-29 20:47:57,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:57,219 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-03-29 20:47:57,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-03-29 20:47:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-03-29 20:47:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-03-29 20:47:57,220 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:57,220 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-03-29 20:47:57,220 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:57,220 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-03-29 20:47:57,229 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:57,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-29 20:47:57,272 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-29 20:47:57,345 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:57,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-03-29 20:47:57,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-29 20:47:57,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-29 20:47:57,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-03-29 20:47:57,347 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 7 states. [2018-03-29 20:47:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:57,405 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-03-29 20:47:57,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-29 20:47:57,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-03-29 20:47:57,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:57,406 INFO L225 Difference]: With dead ends: 87 [2018-03-29 20:47:57,406 INFO L226 Difference]: Without dead ends: 86 [2018-03-29 20:47:57,406 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-03-29 20:47:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-03-29 20:47:57,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-03-29 20:47:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-03-29 20:47:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-03-29 20:47:57,415 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 50 [2018-03-29 20:47:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:57,415 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-03-29 20:47:57,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-29 20:47:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-03-29 20:47:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-03-29 20:47:57,416 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:57,416 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-03-29 20:47:57,417 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:57,417 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-03-29 20:47:57,428 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:57,449 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:57,453 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-03-29 20:47:57,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:57,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:57,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 20:47:57,481 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:47:57,482 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:47:57,482 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-03-29 20:47:57,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:57,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:57,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-03-29 20:47:57,503 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-03-29 20:47:57,505 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-03-29 20:47:57,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:57,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:57,514 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-03-29 20:47:57,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-03-29 20:47:57,529 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-03-29 20:47:57,540 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-03-29 20:47:57,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:57,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:57,552 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-03-29 20:47:57,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-03-29 20:47:57,628 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-03-29 20:47:57,636 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-03-29 20:47:57,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:47:57,644 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-03-29 20:47:57,644 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:57,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:47:57,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:47:57,659 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-03-29 20:47:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:57,741 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:58,062 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-03-29 20:47:58,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:58,079 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-03-29 20:47:58,115 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-03-29 20:47:58,115 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:58,117 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:58,125 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-03-29 20:47:58,125 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-03-29 20:47:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:47:58,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:47:58,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-03-29 20:47:58,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-03-29 20:47:58,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-03-29 20:47:58,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-03-29 20:47:58,183 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 25 states. [2018-03-29 20:47:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:58,861 INFO L93 Difference]: Finished difference Result 198 states and 206 transitions. [2018-03-29 20:47:58,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-03-29 20:47:58,861 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-03-29 20:47:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:58,862 INFO L225 Difference]: With dead ends: 198 [2018-03-29 20:47:58,862 INFO L226 Difference]: Without dead ends: 197 [2018-03-29 20:47:58,863 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=1185, Unknown=0, NotChecked=0, Total=1406 [2018-03-29 20:47:58,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-03-29 20:47:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 140. [2018-03-29 20:47:58,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-03-29 20:47:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2018-03-29 20:47:58,875 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 50 [2018-03-29 20:47:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:58,875 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2018-03-29 20:47:58,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-03-29 20:47:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2018-03-29 20:47:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-03-29 20:47:58,876 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:58,876 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-03-29 20:47:58,876 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:58,876 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-03-29 20:47:58,885 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:58,909 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:58,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-03-29 20:47:58,934 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:47:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-03-29 20:47:58,974 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:47:58,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2018-03-29 20:47:58,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-29 20:47:58,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-29 20:47:58,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-03-29 20:47:58,975 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 8 states. [2018-03-29 20:47:59,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:47:59,057 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-03-29 20:47:59,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-29 20:47:59,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-03-29 20:47:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:47:59,058 INFO L225 Difference]: With dead ends: 140 [2018-03-29 20:47:59,059 INFO L226 Difference]: Without dead ends: 139 [2018-03-29 20:47:59,059 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-03-29 20:47:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-03-29 20:47:59,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-03-29 20:47:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-03-29 20:47:59,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2018-03-29 20:47:59,077 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 54 [2018-03-29 20:47:59,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:47:59,078 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2018-03-29 20:47:59,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-29 20:47:59,078 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2018-03-29 20:47:59,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-03-29 20:47:59,079 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:47:59,079 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-03-29 20:47:59,079 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:47:59,079 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-03-29 20:47:59,087 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:47:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:47:59,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:47:59,111 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-03-29 20:47:59,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:59,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:59,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 20:47:59,123 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:47:59,123 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:47:59,124 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-03-29 20:47:59,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:59,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:59,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-03-29 20:47:59,138 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-03-29 20:47:59,140 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-03-29 20:47:59,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:59,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:59,147 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-03-29 20:47:59,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-03-29 20:47:59,160 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-03-29 20:47:59,162 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-03-29 20:47:59,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:47:59,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:47:59,173 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-03-29 20:47:59,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-03-29 20:48:01,399 WARN L148 SmtUtils]: Spent 2043ms on a formula simplification that was a NOOP. DAG size: 42 [2018-03-29 20:48:01,494 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-03-29 20:48:01,504 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-03-29 20:48:01,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:01,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, 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-03-29 20:48:01,565 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:01,628 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-03-29 20:48:01,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:01,631 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-03-29 20:48:01,631 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:01,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, 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-03-29 20:48:01,712 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-03-29 20:48:01,793 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-03-29 20:48:01,794 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:01,795 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-03-29 20:48:01,796 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:01,865 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-03-29 20:48:01,865 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:01,867 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-03-29 20:48:01,867 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:01,925 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-03-29 20:48:01,925 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:01,927 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-03-29 20:48:01,927 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:01,929 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-03-29 20:48:01,929 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:02,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-03-29 20:48:02,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-03-29 20:48:02,069 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-03-29 20:48:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:48:02,208 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:48:02,782 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-03-29 20:48:02,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:02,827 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-03-29 20:48:02,862 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-03-29 20:48:02,862 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:02,867 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:48:02,875 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-03-29 20:48:02,875 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:69, output treesize:7 [2018-03-29 20:48:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:48:02,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:48:02,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2018-03-29 20:48:02,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-03-29 20:48:02,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-03-29 20:48:02,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1205, Unknown=0, NotChecked=0, Total=1332 [2018-03-29 20:48:02,938 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand 37 states. [2018-03-29 20:48:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:48:05,660 INFO L93 Difference]: Finished difference Result 187 states and 194 transitions. [2018-03-29 20:48:05,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-03-29 20:48:05,660 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 54 [2018-03-29 20:48:05,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:48:05,662 INFO L225 Difference]: With dead ends: 187 [2018-03-29 20:48:05,662 INFO L226 Difference]: Without dead ends: 186 [2018-03-29 20:48:05,663 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=763, Invalid=3929, Unknown=0, NotChecked=0, Total=4692 [2018-03-29 20:48:05,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-03-29 20:48:05,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 143. [2018-03-29 20:48:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-03-29 20:48:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-03-29 20:48:05,679 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 54 [2018-03-29 20:48:05,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:48:05,679 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-03-29 20:48:05,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-03-29 20:48:05,679 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-03-29 20:48:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-03-29 20:48:05,680 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:48:05,680 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-03-29 20:48:05,680 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:48:05,680 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-03-29 20:48:05,686 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:48:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:48:05,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:48:05,709 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-03-29 20:48:05,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:05,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:48:05,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 20:48:05,720 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-03-29 20:48:05,721 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-03-29 20:48:05,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:05,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:48:05,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:48:05,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-03-29 20:48:05,769 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-03-29 20:48:05,774 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-03-29 20:48:05,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:05,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:48:05,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:48:05,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-03-29 20:48:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:48:05,870 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:48:06,156 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-03-29 20:48:06,166 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-03-29 20:48:06,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:06,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:48:06,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:48:06,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:35 [2018-03-29 20:48:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:48:06,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:48:06,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-03-29 20:48:06,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-03-29 20:48:06,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-03-29 20:48:06,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2018-03-29 20:48:06,305 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 30 states. [2018-03-29 20:48:07,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:48:07,250 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2018-03-29 20:48:07,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-03-29 20:48:07,250 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 68 [2018-03-29 20:48:07,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:48:07,251 INFO L225 Difference]: With dead ends: 222 [2018-03-29 20:48:07,251 INFO L226 Difference]: Without dead ends: 221 [2018-03-29 20:48:07,252 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-03-29 20:48:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-03-29 20:48:07,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 128. [2018-03-29 20:48:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-03-29 20:48:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-03-29 20:48:07,271 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 68 [2018-03-29 20:48:07,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:48:07,272 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-03-29 20:48:07,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-03-29 20:48:07,272 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-03-29 20:48:07,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-03-29 20:48:07,273 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:48:07,273 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-03-29 20:48:07,273 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:48:07,273 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-03-29 20:48:07,282 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:48:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:48:07,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:48:07,322 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-03-29 20:48:07,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:07,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:48:07,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 20:48:07,333 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:07,333 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:07,334 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-03-29 20:48:07,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:07,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:48:07,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-03-29 20:48:07,348 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-03-29 20:48:07,349 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-03-29 20:48:07,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:07,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:48:07,355 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-03-29 20:48:07,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-03-29 20:48:07,368 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-03-29 20:48:07,370 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-03-29 20:48:07,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:07,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:48:07,379 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-03-29 20:48:07,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-03-29 20:48:08,082 WARN L148 SmtUtils]: Spent 568ms on a formula simplification that was a NOOP. DAG size: 42 [2018-03-29 20:48:09,380 WARN L148 SmtUtils]: Spent 810ms on a formula simplification that was a NOOP. DAG size: 55 [2018-03-29 20:48:09,935 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-03-29 20:48:09,951 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-03-29 20:48:09,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:10,834 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:10,848 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-03-29 20:48:10,849 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-03-29 20:48:11,696 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:11,697 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:11,700 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:11,710 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-03-29 20:48:11,711 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-03-29 20:48:12,714 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:12,715 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:12,715 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-03-29 20:48:12,716 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:12,718 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-03-29 20:48:12,719 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:12,721 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-03-29 20:48:12,721 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:12,723 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:12,724 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:12,724 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-03-29 20:48:12,725 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:12,727 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-03-29 20:48:12,727 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:13,620 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-03-29 20:48:13,620 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:14,486 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:14,512 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-03-29 20:48:14,547 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 28 xjuncts. [2018-03-29 20:48:15,674 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:15,736 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-03-29 20:48:15,737 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-03-29 20:48:15,745 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 28 xjuncts. [2018-03-29 20:48:17,923 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:17,942 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-03-29 20:48:17,947 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 30 xjuncts. [2018-03-29 20:48:19,227 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-03-29 20:48:19,228 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:19,232 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-03-29 20:48:19,232 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:19,234 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-03-29 20:48:19,234 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:19,236 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-03-29 20:48:19,236 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:20,279 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-03-29 20:48:20,279 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:21,339 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:21,363 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-03-29 20:48:21,363 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-03-29 20:48:21,367 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 24 xjuncts. [2018-03-29 20:48:22,329 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:22,330 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:22,332 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:22,335 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-03-29 20:48:22,336 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:23,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, 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-03-29 20:48:23,817 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:24,535 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:24,545 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-03-29 20:48:24,546 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:26,047 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-03-29 20:48:26,047 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:26,083 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-03-29 20:48:26,083 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:26,814 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:26,823 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-03-29 20:48:26,823 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 3 xjuncts. [2018-03-29 20:48:27,579 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-03-29 20:48:27,579 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:27,581 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-03-29 20:48:27,581 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:28,323 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-03-29 20:48:28,324 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:28,329 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-03-29 20:48:28,330 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:28,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, 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-03-29 20:48:28,972 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:30,173 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:30,177 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-03-29 20:48:30,178 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:30,181 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:30,181 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:30,183 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:30,186 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-03-29 20:48:30,187 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:30,769 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-03-29 20:48:30,769 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:31,841 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:31,842 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:31,844 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:31,847 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-03-29 20:48:31,848 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:32,430 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:32,431 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:32,432 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:32,436 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:32,449 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-03-29 20:48:32,450 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 8 xjuncts. [2018-03-29 20:48:33,159 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-03-29 20:48:33,159 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:35,799 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-03-29 20:48:35,800 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:36,522 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-03-29 20:48:36,523 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:36,524 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-03-29 20:48:36,525 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:36,527 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-03-29 20:48:36,527 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:36,529 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-03-29 20:48:36,529 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:36,531 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-03-29 20:48:36,531 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:37,178 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:37,189 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-03-29 20:48:37,210 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 3 xjuncts. [2018-03-29 20:48:37,850 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-03-29 20:48:37,850 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:38,493 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-03-29 20:48:38,493 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:38,499 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-03-29 20:48:38,499 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:39,031 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-03-29 20:48:39,032 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:39,505 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:39,511 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-03-29 20:48:39,512 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:39,966 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-03-29 20:48:39,966 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:41,235 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-03-29 20:48:41,235 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:41,652 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-03-29 20:48:41,653 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:42,048 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:42,053 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-03-29 20:48:42,054 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:42,061 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:42,062 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:42,064 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:42,068 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-03-29 20:48:42,069 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:42,440 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:42,441 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:42,444 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:42,453 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-03-29 20:48:42,455 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 8 xjuncts. [2018-03-29 20:48:42,830 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-03-29 20:48:42,830 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:44,353 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:48:44,372 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-03-29 20:48:44,375 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 30 xjuncts. [2018-03-29 20:48:45,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 57 dim-1 vars, End of recursive call: and 20 xjuncts. [2018-03-29 20:48:46,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-03-29 20:48:46,066 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 10 variables, input treesize:86, output treesize:135 [2018-03-29 20:48:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:48:46,297 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:48:49,809 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-03-29 20:48:49,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:49,835 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-03-29 20:48:49,955 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 74 DAG size of output 55 [2018-03-29 20:48:49,957 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-03-29 20:48:49,958 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:49,997 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-03-29 20:48:50,003 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:50,018 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-03-29 20:48:50,020 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-03-29 20:48:50,198 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-03-29 20:48:50,199 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:50,272 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:50,273 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:50,275 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:50,279 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-03-29 20:48:50,280 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:50,360 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-03-29 20:48:50,361 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:50,529 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-03-29 20:48:50,530 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:50,610 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:50,611 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-03-29 20:48:50,611 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:50,613 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:50,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, 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-03-29 20:48:50,614 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:50,739 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:50,745 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-03-29 20:48:50,746 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:50,860 INFO L267 ElimStorePlain]: Start of recursive call 5: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:48:50,874 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-03-29 20:48:50,879 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:50,879 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:50,879 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:50,880 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:50,881 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:50,881 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-03-29 20:48:50,882 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:50,994 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:50,994 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:50,996 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:51,001 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-03-29 20:48:51,002 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:51,125 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:51,140 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-03-29 20:48:51,142 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 8 xjuncts. [2018-03-29 20:48:51,235 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-03-29 20:48:51,236 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:51,491 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:51,492 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:51,494 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:51,498 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-03-29 20:48:51,499 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:51,569 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-03-29 20:48:51,569 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:51,721 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-03-29 20:48:51,721 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:51,756 INFO L267 ElimStorePlain]: Start of recursive call 14: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:48:51,770 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-03-29 20:48:51,774 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:51,774 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:51,775 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:51,775 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:51,776 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:51,777 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-03-29 20:48:51,777 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:51,875 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-03-29 20:48:51,875 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:51,967 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:51,981 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-03-29 20:48:51,982 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 8 xjuncts. [2018-03-29 20:48:52,102 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-03-29 20:48:52,103 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:52,195 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:52,200 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-03-29 20:48:52,201 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:52,298 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-03-29 20:48:52,299 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:52,428 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:52,442 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-03-29 20:48:52,444 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 8 xjuncts. [2018-03-29 20:48:52,562 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:52,563 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:52,565 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:52,569 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-03-29 20:48:52,569 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:52,621 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-03-29 20:48:52,621 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:52,696 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:52,711 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-03-29 20:48:52,712 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 8 xjuncts. [2018-03-29 20:48:52,755 INFO L267 ElimStorePlain]: Start of recursive call 22: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:48:52,773 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-03-29 20:48:52,777 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-03-29 20:48:52,778 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:52,883 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:52,889 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-03-29 20:48:52,889 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:53,005 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:53,006 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:53,006 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:53,006 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:53,007 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:53,008 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-03-29 20:48:53,008 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:53,118 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:53,133 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-03-29 20:48:53,134 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 8 xjuncts. [2018-03-29 20:48:53,230 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:53,231 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:53,232 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:53,237 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-03-29 20:48:53,237 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:53,306 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-03-29 20:48:53,306 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:53,367 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-03-29 20:48:53,368 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:53,425 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:53,426 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:53,426 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:53,426 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:53,427 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:48:53,428 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-03-29 20:48:53,428 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:53,482 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-03-29 20:48:53,483 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-03-29 20:48:53,591 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-03-29 20:48:53,592 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-03-29 20:48:53,700 INFO L267 ElimStorePlain]: Start of recursive call 33: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:48:53,778 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 32 xjuncts. [2018-03-29 20:48:53,907 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-03-29 20:48:53,907 INFO L202 ElimStorePlain]: Needed 43 recursive calls to eliminate 10 variables, input treesize:260, output treesize:37 [2018-03-29 20:48:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:48:53,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:48:53,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27] total 55 [2018-03-29 20:48:53,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-03-29 20:48:53,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-03-29 20:48:54,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2824, Unknown=1, NotChecked=0, Total=3080 [2018-03-29 20:48:54,000 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 56 states. [2018-03-29 20:48:58,284 WARN L151 SmtUtils]: Spent 3422ms on a formula simplification. DAG size of input: 87 DAG size of output 75 [2018-03-29 20:49:00,696 WARN L151 SmtUtils]: Spent 2092ms on a formula simplification. DAG size of input: 104 DAG size of output 79 [2018-03-29 20:49:00,916 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 116 DAG size of output 96 [2018-03-29 20:49:01,413 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 114 DAG size of output 94 [2018-03-29 20:49:01,843 WARN L151 SmtUtils]: Spent 375ms on a formula simplification. DAG size of input: 103 DAG size of output 75 [2018-03-29 20:49:02,058 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 108 DAG size of output 88 [2018-03-29 20:49:06,188 WARN L151 SmtUtils]: Spent 1957ms on a formula simplification. DAG size of input: 100 DAG size of output 88 [2018-03-29 20:49:08,386 WARN L151 SmtUtils]: Spent 2077ms on a formula simplification. DAG size of input: 100 DAG size of output 85 [2018-03-29 20:49:10,613 WARN L151 SmtUtils]: Spent 2088ms on a formula simplification. DAG size of input: 104 DAG size of output 89 [2018-03-29 20:49:10,870 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 122 DAG size of output 92 [2018-03-29 20:49:11,245 WARN L151 SmtUtils]: Spent 277ms on a formula simplification. DAG size of input: 138 DAG size of output 108 [2018-03-29 20:49:12,778 WARN L151 SmtUtils]: Spent 1448ms on a formula simplification. DAG size of input: 138 DAG size of output 95 [2018-03-29 20:49:13,212 WARN L151 SmtUtils]: Spent 362ms on a formula simplification. DAG size of input: 136 DAG size of output 93 [2018-03-29 20:49:14,515 WARN L151 SmtUtils]: Spent 1226ms on a formula simplification. DAG size of input: 136 DAG size of output 106 [2018-03-29 20:49:17,168 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 124 DAG size of output 100 [2018-03-29 20:49:22,060 WARN L151 SmtUtils]: Spent 3197ms on a formula simplification. DAG size of input: 104 DAG size of output 89 [2018-03-29 20:49:26,839 WARN L151 SmtUtils]: Spent 4235ms on a formula simplification. DAG size of input: 123 DAG size of output 93 [2018-03-29 20:49:27,082 WARN L151 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 139 DAG size of output 109 [2018-03-29 20:49:27,318 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 139 DAG size of output 96 [2018-03-29 20:49:27,532 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 137 DAG size of output 94 [2018-03-29 20:49:27,752 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 137 DAG size of output 107 [2018-03-29 20:49:31,437 WARN L151 SmtUtils]: Spent 3614ms on a formula simplification. DAG size of input: 125 DAG size of output 87 [2018-03-29 20:49:31,695 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 125 DAG size of output 101 [2018-03-29 20:49:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:49:33,419 INFO L93 Difference]: Finished difference Result 173 states and 179 transitions. [2018-03-29 20:49:33,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-03-29 20:49:33,420 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 72 [2018-03-29 20:49:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:49:33,420 INFO L225 Difference]: With dead ends: 173 [2018-03-29 20:49:33,420 INFO L226 Difference]: Without dead ends: 172 [2018-03-29 20:49:33,423 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3040 ImplicationChecksByTransitivity, 43.6s TimeCoverageRelationStatistics Valid=2418, Invalid=11387, Unknown=1, NotChecked=0, Total=13806 [2018-03-29 20:49:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-03-29 20:49:33,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 104. [2018-03-29 20:49:33,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-03-29 20:49:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-03-29 20:49:33,434 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 72 [2018-03-29 20:49:33,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:49:33,434 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-03-29 20:49:33,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-03-29 20:49:33,435 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-03-29 20:49:33,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-03-29 20:49:33,435 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:49:33,436 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-03-29 20:49:33,436 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:49:33,436 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-03-29 20:49:33,448 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:49:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:49:33,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:49:33,489 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-03-29 20:49:33,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:33,502 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-03-29 20:49:33,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:33,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:49:33,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:49:33,525 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:49:33,527 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-03-29 20:49:33,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:33,538 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:49:33,539 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:49:33,540 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-03-29 20:49:33,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:33,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:49:33,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-03-29 20:49:33,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 15 treesize of output 12 [2018-03-29 20:49:33,580 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-03-29 20:49:33,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:33,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:49:33,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:49:33,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-03-29 20:49:33,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 28 treesize of output 29 [2018-03-29 20:49:33,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 13 treesize of output 12 [2018-03-29 20:49:33,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:33,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:49:33,610 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-03-29 20:49:33,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-03-29 20:49:33,760 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-03-29 20:49:33,767 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-03-29 20:49:33,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:49:33,774 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-03-29 20:49:33,774 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:33,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:49:33,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:49:33,785 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-03-29 20:49:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:49:33,898 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:49:34,342 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-03-29 20:49:34,352 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-03-29 20:49:34,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:34,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:49:34,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:49:34,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-03-29 20:49:34,846 WARN L148 SmtUtils]: Spent 388ms on a formula simplification that was a NOOP. DAG size: 34 [2018-03-29 20:49:35,119 WARN L148 SmtUtils]: Spent 224ms on a formula simplification that was a NOOP. DAG size: 34 [2018-03-29 20:49:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:49:35,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:49:35,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2018-03-29 20:49:35,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-03-29 20:49:35,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-03-29 20:49:35,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2018-03-29 20:49:35,165 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 32 states. [2018-03-29 20:49:35,904 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 67 DAG size of output 49 [2018-03-29 20:49:36,483 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 66 DAG size of output 53 [2018-03-29 20:49:37,298 WARN L151 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 71 DAG size of output 54 [2018-03-29 20:49:37,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:49:37,313 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2018-03-29 20:49:37,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-03-29 20:49:37,314 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 74 [2018-03-29 20:49:37,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:49:37,315 INFO L225 Difference]: With dead ends: 142 [2018-03-29 20:49:37,315 INFO L226 Difference]: Without dead ends: 141 [2018-03-29 20:49:37,316 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=448, Invalid=2204, Unknown=0, NotChecked=0, Total=2652 [2018-03-29 20:49:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-03-29 20:49:37,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 91. [2018-03-29 20:49:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-03-29 20:49:37,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-03-29 20:49:37,333 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 74 [2018-03-29 20:49:37,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:49:37,333 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-03-29 20:49:37,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-03-29 20:49:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-03-29 20:49:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-03-29 20:49:37,334 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:49:37,334 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-03-29 20:49:37,334 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-03-29 20:49:37,334 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-03-29 20:49:37,341 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:49:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:49:37,370 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:49:37,389 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-03-29 20:49:37,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:37,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:49:37,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 20:49:37,402 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:49:37,403 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:49:37,404 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-03-29 20:49:37,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:37,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:49:37,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-03-29 20:49:37,421 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-03-29 20:49:37,422 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-03-29 20:49:37,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:37,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:49:37,429 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-03-29 20:49:37,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-03-29 20:49:37,456 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-03-29 20:49:37,458 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-03-29 20:49:37,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:37,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:49:37,469 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-03-29 20:49:37,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-03-29 20:49:41,901 WARN L148 SmtUtils]: Spent 2028ms on a formula simplification that was a NOOP. DAG size: 48 [2018-03-29 20:49:41,996 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-03-29 20:49:42,000 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:49:42,008 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-03-29 20:49:42,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:49:42,071 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:49:42,084 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-03-29 20:49:42,085 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-03-29 20:49:42,188 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:49:42,206 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-03-29 20:49:42,207 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-03-29 20:49:42,337 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-03-29 20:49:42,337 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:42,339 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-03-29 20:49:42,339 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:42,441 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-03-29 20:49:42,442 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:42,443 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-03-29 20:49:42,444 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:42,446 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-03-29 20:49:42,446 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:42,513 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-03-29 20:49:42,514 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:42,569 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:49:42,575 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-03-29 20:49:42,575 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-03-29 20:49:42,640 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-03-29 20:49:42,640 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:42,642 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-03-29 20:49:42,642 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:42,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-03-29 20:49:42,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:49:42,767 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:75, output treesize:104 [2018-03-29 20:49:42,946 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:49:42,946 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:49:45,938 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-03-29 20:49:45,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:45,964 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 161 treesize of output 85 [2018-03-29 20:49:46,039 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-03-29 20:49:46,039 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:46,064 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 1 case distinctions, treesize of input 43 treesize of output 41 [2018-03-29 20:49: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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-03-29 20:49:46,066 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:46,082 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:49:46,083 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2018-03-29 20:49:46,084 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:46,101 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:49:46,105 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 33 treesize of output 47 [2018-03-29 20:49:46,106 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-03-29 20:49:46,122 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:49:46,128 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 47 treesize of output 45 [2018-03-29 20:49:46,130 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 40 treesize of output 32 [2018-03-29 20:49:46,130 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:46,149 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:49:46,153 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 37 treesize of output 51 [2018-03-29 20:49:46,154 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-03-29 20:49:46,174 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:49:46,176 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 32 treesize of output 36 [2018-03-29 20:49:46,176 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-03-29 20:49:46,190 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:49:46,220 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 16 xjuncts. [2018-03-29 20:49:46,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:49:46,276 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:182, output treesize:24 [2018-03-29 20:49:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:49:46,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:49:46,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2018-03-29 20:49:46,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-03-29 20:49:46,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-03-29 20:49:46,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1901, Unknown=2, NotChecked=0, Total=2070 [2018-03-29 20:49:46,367 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 46 states. [2018-03-29 20:49:49,633 WARN L151 SmtUtils]: Spent 1205ms on a formula simplification. DAG size of input: 101 DAG size of output 85 [2018-03-29 20:49:52,458 WARN L151 SmtUtils]: Spent 2756ms on a formula simplification. DAG size of input: 108 DAG size of output 92 [2018-03-29 20:49:52,773 WARN L151 SmtUtils]: Spent 247ms on a formula simplification. DAG size of input: 108 DAG size of output 89 [2018-03-29 20:49:52,947 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 121 DAG size of output 93 [2018-03-29 20:50:03,288 WARN L151 SmtUtils]: Spent 6173ms on a formula simplification. DAG size of input: 116 DAG size of output 91 [2018-03-29 20:50:03,473 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 114 DAG size of output 89 [2018-03-29 20:50:07,333 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 81 DAG size of output 69 [2018-03-29 20:50:11,592 WARN L151 SmtUtils]: Spent 2050ms on a formula simplification. DAG size of input: 79 DAG size of output 66 [2018-03-29 20:50:11,943 WARN L151 SmtUtils]: Spent 269ms on a formula simplification. DAG size of input: 101 DAG size of output 85 [2018-03-29 20:50:12,134 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 113 DAG size of output 93 [2018-03-29 20:50:15,685 WARN L151 SmtUtils]: Spent 2093ms on a formula simplification. DAG size of input: 98 DAG size of output 81 Received shutdown request... [2018-03-29 20:50:17,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-03-29 20:50:17,829 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-29 20:50:17,832 WARN L197 ceAbstractionStarter]: Timeout [2018-03-29 20:50:17,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 08:50:17 BoogieIcfgContainer [2018-03-29 20:50:17,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-29 20:50:17,833 INFO L168 Benchmark]: Toolchain (without parser) took 148253.67 ms. Allocated memory was 308.8 MB in the beginning and 569.4 MB in the end (delta: 260.6 MB). Free memory was 246.0 MB in the beginning and 406.5 MB in the end (delta: -160.5 MB). Peak memory consumption was 100.1 MB. Max. memory is 5.3 GB. [2018-03-29 20:50:17,834 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 308.8 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-29 20:50:17,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.01 ms. Allocated memory is still 308.8 MB. Free memory was 246.0 MB in the beginning and 222.1 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-03-29 20:50:17,834 INFO L168 Benchmark]: Boogie Preprocessor took 57.64 ms. Allocated memory is still 308.8 MB. Free memory was 222.1 MB in the beginning and 218.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-03-29 20:50:17,834 INFO L168 Benchmark]: RCFGBuilder took 532.59 ms. Allocated memory was 308.8 MB in the beginning and 475.5 MB in the end (delta: 166.7 MB). Free memory was 218.1 MB in the beginning and 407.7 MB in the end (delta: -189.6 MB). Peak memory consumption was 20.1 MB. Max. memory is 5.3 GB. [2018-03-29 20:50:17,835 INFO L168 Benchmark]: TraceAbstraction took 147340.04 ms. Allocated memory was 475.5 MB in the beginning and 569.4 MB in the end (delta: 93.8 MB). Free memory was 407.7 MB in the beginning and 406.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 95.1 MB. Max. memory is 5.3 GB. [2018-03-29 20:50:17,836 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.13 ms. Allocated memory is still 308.8 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 318.01 ms. Allocated memory is still 308.8 MB. Free memory was 246.0 MB in the beginning and 222.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 57.64 ms. Allocated memory is still 308.8 MB. Free memory was 222.1 MB in the beginning and 218.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 532.59 ms. Allocated memory was 308.8 MB in the beginning and 475.5 MB in the end (delta: 166.7 MB). Free memory was 218.1 MB in the beginning and 407.7 MB in the end (delta: -189.6 MB). Peak memory consumption was 20.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 147340.04 ms. Allocated memory was 475.5 MB in the beginning and 569.4 MB in the end (delta: 93.8 MB). Free memory was 407.7 MB in the beginning and 406.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 95.1 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 (91states) and interpolant automaton (currently 49 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 90 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 (91states) and interpolant automaton (currently 49 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 90 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 (91states) and interpolant automaton (currently 49 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 90 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 (91states) and interpolant automaton (currently 49 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 90 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 (91states) and interpolant automaton (currently 49 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 90 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 (91states) and interpolant automaton (currently 49 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 90 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 (91states) and interpolant automaton (currently 49 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 90 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 (91states) and interpolant automaton (currently 49 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 90 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 (91states) and interpolant automaton (currently 49 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 90 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 (91states) and interpolant automaton (currently 49 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 90 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 (91states) and interpolant automaton (currently 49 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 90 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 (91states) and interpolant automaton (currently 49 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 90 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 (91states) and interpolant automaton (currently 49 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 90 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 (91states) and interpolant automaton (currently 49 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 90 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 (91states) and interpolant automaton (currently 49 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 90 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 102 locations, 15 error locations. TIMEOUT Result, 147.2s OverallTime, 26 OverallIterations, 3 TraceHistogramMax, 81.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2067 SDtfs, 6636 SDslu, 10872 SDs, 0 SdLazy, 7259 SolverSat, 318 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 11.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2498 GetRequests, 1846 SyntacticMatches, 23 SemanticMatches, 628 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 6861 ImplicationChecksByTransitivity, 86.3s 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, 25 MinimizatonAttempts, 640 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 64.4s InterpolantComputationTime, 1120 NumberOfCodeBlocks, 1120 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2188 ConstructedInterpolants, 384 QuantifiedInterpolants, 1616466 SizeOfPredicates, 293 NumberOfNonLiveVariables, 3526 ConjunctsInSsa, 525 ConjunctsInUnsatCore, 52 InterpolantComputations, 38 PerfectInterpolantSequences, 40/260 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-03-29_20-50-17-844.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-03-29_20-50-17-844.csv Completed graceful shutdown