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/cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 19:50:05,860 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 19:50:05,862 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 19:50:05,875 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 19:50:05,876 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 19:50:05,876 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 19:50:05,877 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 19:50:05,879 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 19:50:05,881 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 19:50:05,882 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 19:50:05,883 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 19:50:05,883 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 19:50:05,884 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 19:50:05,885 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 19:50:05,886 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 19:50:05,888 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 19:50:05,891 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 19:50:05,892 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 19:50:05,894 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 19:50:05,895 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 19:50:05,897 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 19:50:05,898 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 19:50:05,898 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 19:50:05,899 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 19:50:05,900 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 19:50:05,901 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 19:50:05,901 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 19:50:05,902 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 19:50:05,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 19:50:05,903 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 19:50:05,904 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 19:50:05,904 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-09 19:50:05,927 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 19:50:05,928 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 19:50:05,928 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 19:50:05,928 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 19:50:05,928 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 19:50:05,929 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 19:50:05,929 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 19:50:05,929 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 19:50:05,929 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 19:50:05,929 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 19:50:05,930 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 19:50:05,930 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 19:50:05,930 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 19:50:05,930 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 19:50:05,930 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 19:50:05,930 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 19:50:05,931 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 19:50:05,931 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 19:50:05,931 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 19:50:05,931 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 19:50:05,931 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 19:50:05,931 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 19:50:05,932 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 19:50:05,932 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 19:50:05,932 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 19:50:05,932 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 19:50:05,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 19:50:05,933 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 19:50:05,933 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 19:50:05,933 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 19:50:05,933 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 19:50:05,933 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 19:50:05,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:05,933 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 19:50:05,934 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 19:50:05,934 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 19:50:05,935 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 19:50:05,935 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 19:50:05,968 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 19:50:05,979 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 19:50:05,982 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 19:50:05,984 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 19:50:05,984 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 19:50:05,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,284 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf5c728914 [2018-04-09 19:50:06,505 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 19:50:06,505 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 19:50:06,506 INFO L168 CDTParser]: Scanning cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,518 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 19:50:06,519 INFO L215 ultiparseSymbolTable]: [2018-04-09 19:50:06,519 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 19:50:06,519 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,519 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,519 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,519 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,519 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 19:50:06,519 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,520 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__time_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,520 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,520 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,520 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,520 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,520 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,520 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,520 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____id_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__div_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,521 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_short in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__key_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ulong in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,522 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_short in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__off_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_char in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_long in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__size_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,525 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_char in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,526 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__id_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_int in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,527 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,528 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____off_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__uint in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_long in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,529 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ushort in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____time_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,530 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,531 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,531 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,531 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,531 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,531 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,531 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__register_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,531 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,531 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,531 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,531 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____key_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,531 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,531 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:06,550 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf5c728914 [2018-04-09 19:50:06,555 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 19:50:06,556 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 19:50:06,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 19:50:06,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 19:50:06,562 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 19:50:06,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 07:50:06" (1/1) ... [2018-04-09 19:50:06,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7466a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:50:06, skipping insertion in model container [2018-04-09 19:50:06,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 07:50:06" (1/1) ... [2018-04-09 19:50:06,580 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 19:50:06,611 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 19:50:06,782 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 19:50:06,831 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 19:50:06,839 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-09 19:50:06,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:50:06 WrapperNode [2018-04-09 19:50:06,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 19:50:06,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 19:50:06,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 19:50:06,886 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 19:50:06,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:50:06" (1/1) ... [2018-04-09 19:50:06,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:50:06" (1/1) ... [2018-04-09 19:50:06,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:50:06" (1/1) ... [2018-04-09 19:50:06,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:50:06" (1/1) ... [2018-04-09 19:50:06,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:50:06" (1/1) ... [2018-04-09 19:50:06,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:50:06" (1/1) ... [2018-04-09 19:50:06,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:50:06" (1/1) ... [2018-04-09 19:50:06,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 19:50:06,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 19:50:06,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 19:50:06,941 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 19:50:06,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:50:06" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 19:50:07,078 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 19:50:07,078 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 19:50:07,078 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-09 19:50:07,078 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-09 19:50:07,078 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-04-09 19:50:07,078 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 19:50:07,079 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-09 19:50:07,079 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-09 19:50:07,079 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 19:50:07,079 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 19:50:07,079 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 19:50:07,079 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 19:50:07,079 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 19:50:07,080 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 19:50:07,080 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 19:50:07,080 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 19:50:07,080 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 19:50:07,080 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 19:50:07,080 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 19:50:07,081 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 19:50:07,081 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 19:50:07,081 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 19:50:07,081 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 19:50:07,081 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 19:50:07,081 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 19:50:07,082 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 19:50:07,082 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 19:50:07,082 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 19:50:07,082 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 19:50:07,082 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 19:50:07,082 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 19:50:07,082 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 19:50:07,083 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 19:50:07,083 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 19:50:07,083 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 19:50:07,083 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 19:50:07,083 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 19:50:07,083 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 19:50:07,083 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 19:50:07,083 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 19:50:07,083 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 19:50:07,084 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 19:50:07,084 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 19:50:07,084 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 19:50:07,084 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 19:50:07,084 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 19:50:07,084 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 19:50:07,084 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 19:50:07,084 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 19:50:07,085 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 19:50:07,085 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 19:50:07,085 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 19:50:07,085 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 19:50:07,085 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 19:50:07,085 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 19:50:07,085 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 19:50:07,085 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 19:50:07,085 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 19:50:07,085 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 19:50:07,085 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 19:50:07,086 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 19:50:07,086 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 19:50:07,086 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 19:50:07,086 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 19:50:07,086 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 19:50:07,086 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 19:50:07,086 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 19:50:07,086 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 19:50:07,086 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 19:50:07,086 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 19:50:07,087 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 19:50:07,087 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 19:50:07,087 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 19:50:07,087 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 19:50:07,087 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 19:50:07,087 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 19:50:07,087 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 19:50:07,087 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 19:50:07,087 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 19:50:07,088 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 19:50:07,088 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 19:50:07,088 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 19:50:07,088 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 19:50:07,088 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 19:50:07,088 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 19:50:07,088 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 19:50:07,088 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 19:50:07,088 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 19:50:07,089 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 19:50:07,089 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 19:50:07,089 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 19:50:07,089 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 19:50:07,089 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 19:50:07,089 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 19:50:07,089 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 19:50:07,090 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 19:50:07,090 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 19:50:07,090 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 19:50:07,090 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 19:50:07,090 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 19:50:07,090 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 19:50:07,090 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 19:50:07,090 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 19:50:07,091 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 19:50:07,091 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 19:50:07,091 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 19:50:07,091 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 19:50:07,091 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 19:50:07,091 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 19:50:07,091 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-04-09 19:50:07,091 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 19:50:07,092 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 19:50:07,092 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 19:50:07,092 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 19:50:07,092 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 19:50:07,092 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 19:50:07,092 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 19:50:07,092 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 19:50:07,512 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 19:50:07,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 07:50:07 BoogieIcfgContainer [2018-04-09 19:50:07,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 19:50:07,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 19:50:07,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 19:50:07,515 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 19:50:07,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 07:50:06" (1/3) ... [2018-04-09 19:50:07,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ce9656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 07:50:07, skipping insertion in model container [2018-04-09 19:50:07,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:50:06" (2/3) ... [2018-04-09 19:50:07,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ce9656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 07:50:07, skipping insertion in model container [2018-04-09 19:50:07,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 07:50:07" (3/3) ... [2018-04-09 19:50:07,518 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:50:07,525 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 19:50:07,531 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-04-09 19:50:07,574 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 19:50:07,575 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 19:50:07,575 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 19:50:07,575 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 19:50:07,575 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 19:50:07,575 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 19:50:07,575 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 19:50:07,575 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 19:50:07,575 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 19:50:07,576 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 19:50:07,588 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-04-09 19:50:07,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-09 19:50:07,594 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:07,595 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] [2018-04-09 19:50:07,595 INFO L408 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:07,598 INFO L82 PathProgramCache]: Analyzing trace with hash -921233729, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:07,611 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:07,645 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:07,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:07,673 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:07,710 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:07,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 19:50:07,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 19:50:07,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 19:50:07,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 19:50:07,724 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states. [2018-04-09 19:50:07,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:07,806 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-04-09 19:50:07,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 19:50:07,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-04-09 19:50:07,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:07,820 INFO L225 Difference]: With dead ends: 112 [2018-04-09 19:50:07,820 INFO L226 Difference]: Without dead ends: 75 [2018-04-09 19:50:07,824 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 19:50:07,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-09 19:50:07,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-09 19:50:07,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-09 19:50:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-04-09 19:50:07,864 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 21 [2018-04-09 19:50:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:07,865 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-04-09 19:50:07,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 19:50:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-04-09 19:50:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-09 19:50:07,866 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:07,866 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] [2018-04-09 19:50:07,866 INFO L408 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:07,867 INFO L82 PathProgramCache]: Analyzing trace with hash 425643425, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:07,874 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:07,895 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:07,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:07,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:07,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:07,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:07,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:07,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-09 19:50:08,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:08,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 19:50:08,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:08,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:08,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:08,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:50:08,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:08,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:08,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-09 19:50:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:08,120 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:08,229 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:08,229 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-04-09 19:50:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:08,274 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:08,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-09 19:50:08,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 19:50:08,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 19:50:08,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-09 19:50:08,278 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 9 states. [2018-04-09 19:50:08,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:08,498 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-04-09 19:50:08,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 19:50:08,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-04-09 19:50:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:08,501 INFO L225 Difference]: With dead ends: 75 [2018-04-09 19:50:08,501 INFO L226 Difference]: Without dead ends: 73 [2018-04-09 19:50:08,502 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-09 19:50:08,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-09 19:50:08,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-04-09 19:50:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-09 19:50:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-04-09 19:50:08,513 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 24 [2018-04-09 19:50:08,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:08,513 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-04-09 19:50:08,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 19:50:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-04-09 19:50:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-09 19:50:08,514 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:08,515 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] [2018-04-09 19:50:08,515 INFO L408 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:08,515 INFO L82 PathProgramCache]: Analyzing trace with hash 310044275, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:08,522 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:08,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:08,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:08,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:08,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:08,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 19:50:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:08,571 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:08,618 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:08,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 19:50:08,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 19:50:08,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 19:50:08,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 19:50:08,619 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2018-04-09 19:50:08,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:08,666 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-04-09 19:50:08,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 19:50:08,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-09 19:50:08,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:08,667 INFO L225 Difference]: With dead ends: 73 [2018-04-09 19:50:08,668 INFO L226 Difference]: Without dead ends: 72 [2018-04-09 19:50:08,668 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 19:50:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-09 19:50:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-04-09 19:50:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-09 19:50:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-04-09 19:50:08,673 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 25 [2018-04-09 19:50:08,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:08,674 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-04-09 19:50:08,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 19:50:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-04-09 19:50:08,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-09 19:50:08,675 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:08,675 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] [2018-04-09 19:50:08,675 INFO L408 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:08,675 INFO L82 PathProgramCache]: Analyzing trace with hash 310044276, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:08,682 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:08,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:08,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:08,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:08,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:08,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-04-09 19:50:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:08,766 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:08,824 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:08,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-04-09 19:50:08,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 19:50:08,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 19:50:08,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-09 19:50:08,825 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 8 states. [2018-04-09 19:50:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:08,907 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-04-09 19:50:08,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 19:50:08,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-09 19:50:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:08,909 INFO L225 Difference]: With dead ends: 72 [2018-04-09 19:50:08,909 INFO L226 Difference]: Without dead ends: 71 [2018-04-09 19:50:08,909 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-09 19:50:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-09 19:50:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-04-09 19:50:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-09 19:50:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-04-09 19:50:08,916 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 25 [2018-04-09 19:50:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:08,916 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-04-09 19:50:08,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 19:50:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-04-09 19:50:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-09 19:50:08,917 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:08,917 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] [2018-04-09 19:50:08,917 INFO L408 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:08,917 INFO L82 PathProgramCache]: Analyzing trace with hash 178192733, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:08,924 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:08,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:08,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:08,953 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:08,980 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:08,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 19:50:08,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 19:50:08,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 19:50:08,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-09 19:50:08,981 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2018-04-09 19:50:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:09,098 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-04-09 19:50:09,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 19:50:09,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-09 19:50:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:09,100 INFO L225 Difference]: With dead ends: 78 [2018-04-09 19:50:09,100 INFO L226 Difference]: Without dead ends: 77 [2018-04-09 19:50:09,100 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-09 19:50:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-09 19:50:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-04-09 19:50:09,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-09 19:50:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-04-09 19:50:09,107 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 31 [2018-04-09 19:50:09,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:09,107 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-04-09 19:50:09,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 19:50:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-04-09 19:50:09,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-09 19:50:09,108 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:09,108 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] [2018-04-09 19:50:09,109 INFO L408 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:09,109 INFO L82 PathProgramCache]: Analyzing trace with hash 178192734, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:09,115 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:09,136 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:09,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:09,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:09,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:09,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-09 19:50:09,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:09,216 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:09,309 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:09,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2018-04-09 19:50:09,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-09 19:50:09,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-09 19:50:09,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-04-09 19:50:09,310 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 14 states. [2018-04-09 19:50:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:09,510 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-04-09 19:50:09,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-09 19:50:09,510 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-04-09 19:50:09,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:09,511 INFO L225 Difference]: With dead ends: 85 [2018-04-09 19:50:09,511 INFO L226 Difference]: Without dead ends: 84 [2018-04-09 19:50:09,512 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-04-09 19:50:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-09 19:50:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2018-04-09 19:50:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-09 19:50:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-04-09 19:50:09,518 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 31 [2018-04-09 19:50:09,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:09,519 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-04-09 19:50:09,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-09 19:50:09,519 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-04-09 19:50:09,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-09 19:50:09,520 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:09,521 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] [2018-04-09 19:50:09,521 INFO L408 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:09,521 INFO L82 PathProgramCache]: Analyzing trace with hash 404305818, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:09,528 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:09,548 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:09,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 19:50:09,584 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:09,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 19:50:09,614 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:09,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-09 19:50:09,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 19:50:09,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 19:50:09,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-09 19:50:09,615 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 7 states. [2018-04-09 19:50:09,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:09,702 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-04-09 19:50:09,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 19:50:09,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-04-09 19:50:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:09,703 INFO L225 Difference]: With dead ends: 76 [2018-04-09 19:50:09,703 INFO L226 Difference]: Without dead ends: 75 [2018-04-09 19:50:09,704 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-09 19:50:09,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-09 19:50:09,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-04-09 19:50:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-09 19:50:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-04-09 19:50:09,711 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 38 [2018-04-09 19:50:09,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:09,712 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-04-09 19:50:09,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 19:50:09,712 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-04-09 19:50:09,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-09 19:50:09,713 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:09,713 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] [2018-04-09 19:50:09,714 INFO L408 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:09,714 INFO L82 PathProgramCache]: Analyzing trace with hash 404305819, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:09,720 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:09,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:09,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:09,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:09,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:09,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-09 19:50:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:09,831 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:09,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:50:09,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-04-09 19:50:09,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-09 19:50:09,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-09 19:50:09,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-04-09 19:50:09,974 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 19 states. [2018-04-09 19:50:10,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:10,318 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-04-09 19:50:10,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 19:50:10,318 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-04-09 19:50:10,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:10,321 INFO L225 Difference]: With dead ends: 95 [2018-04-09 19:50:10,321 INFO L226 Difference]: Without dead ends: 94 [2018-04-09 19:50:10,322 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-04-09 19:50:10,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-04-09 19:50:10,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2018-04-09 19:50:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-09 19:50:10,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-04-09 19:50:10,329 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 38 [2018-04-09 19:50:10,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:10,329 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-04-09 19:50:10,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-09 19:50:10,330 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-04-09 19:50:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-09 19:50:10,331 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:10,331 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:50:10,331 INFO L408 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:10,331 INFO L82 PathProgramCache]: Analyzing trace with hash 585207874, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:10,346 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:10,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:10,403 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:10,446 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:10,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 19:50:10,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 19:50:10,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 19:50:10,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-09 19:50:10,447 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2018-04-09 19:50:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:10,505 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-04-09 19:50:10,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 19:50:10,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-04-09 19:50:10,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:10,506 INFO L225 Difference]: With dead ends: 79 [2018-04-09 19:50:10,506 INFO L226 Difference]: Without dead ends: 78 [2018-04-09 19:50:10,507 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-09 19:50:10,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-09 19:50:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-04-09 19:50:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-09 19:50:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-04-09 19:50:10,514 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-04-09 19:50:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:10,514 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-04-09 19:50:10,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 19:50:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-04-09 19:50:10,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-09 19:50:10,515 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:10,515 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:50:10,515 INFO L408 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:10,516 INFO L82 PathProgramCache]: Analyzing trace with hash 585207875, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:10,522 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:10,542 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:10,608 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:10,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-09 19:50:10,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:10,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-09 19:50:10,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:10,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:10,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-09 19:50:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:10,685 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:10,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-09 19:50:10,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 19:50:10,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 19:50:10,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-09 19:50:10,686 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 9 states. [2018-04-09 19:50:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:10,952 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-04-09 19:50:10,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:50:10,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-04-09 19:50:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:10,953 INFO L225 Difference]: With dead ends: 85 [2018-04-09 19:50:10,953 INFO L226 Difference]: Without dead ends: 84 [2018-04-09 19:50:10,954 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-04-09 19:50:10,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-09 19:50:10,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-04-09 19:50:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-09 19:50:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-04-09 19:50:10,960 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 39 [2018-04-09 19:50:10,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:10,960 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-04-09 19:50:10,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 19:50:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-04-09 19:50:10,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 19:50:10,961 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:10,961 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:50:10,961 INFO L408 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:10,961 INFO L82 PathProgramCache]: Analyzing trace with hash 961574980, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:10,972 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:10,992 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:11,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-04-09 19:50:11,022 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:11,048 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:11,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-09 19:50:11,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 19:50:11,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 19:50:11,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-09 19:50:11,049 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 7 states. [2018-04-09 19:50:11,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:11,149 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-04-09 19:50:11,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 19:50:11,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-04-09 19:50:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:11,150 INFO L225 Difference]: With dead ends: 84 [2018-04-09 19:50:11,150 INFO L226 Difference]: Without dead ends: 83 [2018-04-09 19:50:11,151 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-09 19:50:11,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-09 19:50:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-09 19:50:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-09 19:50:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-04-09 19:50:11,157 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 40 [2018-04-09 19:50:11,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:11,157 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-04-09 19:50:11,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 19:50:11,157 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-04-09 19:50:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 19:50:11,158 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:11,158 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:50:11,159 INFO L408 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:11,159 INFO L82 PathProgramCache]: Analyzing trace with hash 961574981, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:11,166 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:11,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:11,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:11,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:11,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:11,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-09 19:50:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:11,283 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:11,398 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:11,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2018-04-09 19:50:11,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-09 19:50:11,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-09 19:50:11,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-04-09 19:50:11,399 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 18 states. [2018-04-09 19:50:11,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:11,691 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-04-09 19:50:11,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 19:50:11,691 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-04-09 19:50:11,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:11,693 INFO L225 Difference]: With dead ends: 110 [2018-04-09 19:50:11,693 INFO L226 Difference]: Without dead ends: 109 [2018-04-09 19:50:11,694 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2018-04-09 19:50:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-09 19:50:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2018-04-09 19:50:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-09 19:50:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-04-09 19:50:11,700 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 40 [2018-04-09 19:50:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:11,701 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-04-09 19:50:11,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-09 19:50:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-04-09 19:50:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-09 19:50:11,701 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:11,701 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:50:11,701 INFO L408 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:11,702 INFO L82 PathProgramCache]: Analyzing trace with hash 226357950, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:11,708 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:11,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:11,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:11,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:11,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:11,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-09 19:50:11,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 19:50:11,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 19:50:11,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:11,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:11,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 19:50:11,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-09 19:50:11,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-09 19:50:11,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 19:50:11,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:50:11,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:11,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:11,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35 [2018-04-09 19:50:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:12,095 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:12,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-09 19:50:12,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 19:50:12,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:12,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:12,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:12,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:38 [2018-04-09 19:50:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:12,554 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:50:12,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-04-09 19:50:12,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-09 19:50:12,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-09 19:50:12,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2018-04-09 19:50:12,556 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 31 states. [2018-04-09 19:50:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:13,733 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-04-09 19:50:13,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-09 19:50:13,733 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-04-09 19:50:13,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:13,734 INFO L225 Difference]: With dead ends: 124 [2018-04-09 19:50:13,734 INFO L226 Difference]: Without dead ends: 123 [2018-04-09 19:50:13,735 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=351, Invalid=2301, Unknown=0, NotChecked=0, Total=2652 [2018-04-09 19:50:13,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-09 19:50:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2018-04-09 19:50:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-09 19:50:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-04-09 19:50:13,742 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 45 [2018-04-09 19:50:13,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:13,742 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-04-09 19:50:13,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-09 19:50:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-04-09 19:50:13,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-09 19:50:13,743 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:13,743 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] [2018-04-09 19:50:13,743 INFO L408 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:13,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1360561045, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:13,751 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:13,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:13,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:13,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:13,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:13,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 19:50:13,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:13,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:13,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:50:13,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:13,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:13,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-09 19:50:13,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 19:50:13,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 19:50:13,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:13,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:13,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 19:50:13,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-09 19:50:13,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-09 19:50:13,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 19:50:13,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:13,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:13,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-09 19:50:13,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-09 19:50:14,084 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 30 treesize of output 28 [2018-04-09 19:50:14,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 19:50:14,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:14,096 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 16 treesize of output 13 [2018-04-09 19:50:14,097 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-09 19:50:14,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:14,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:14,120 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-04-09 19:50:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:14,181 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:14,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-09 19:50:14,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:14,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-09 19:50:14,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 19:50:14,420 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:14,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:14,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:14,427 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-04-09 19:50:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:14,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:50:14,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-04-09 19:50:14,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-09 19:50:14,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-09 19:50:14,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-04-09 19:50:14,493 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 25 states. [2018-04-09 19:50:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:15,156 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2018-04-09 19:50:15,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-09 19:50:15,156 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-04-09 19:50:15,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:15,157 INFO L225 Difference]: With dead ends: 128 [2018-04-09 19:50:15,157 INFO L226 Difference]: Without dead ends: 127 [2018-04-09 19:50:15,157 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=1349, Unknown=0, NotChecked=0, Total=1560 [2018-04-09 19:50:15,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-09 19:50:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2018-04-09 19:50:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-09 19:50:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-04-09 19:50:15,164 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 50 [2018-04-09 19:50:15,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:15,164 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-04-09 19:50:15,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-09 19:50:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-04-09 19:50:15,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-09 19:50:15,164 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:15,165 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:50:15,165 INFO L408 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:15,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1356203461, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:15,171 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:15,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:15,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:15,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:15,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:15,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-09 19:50:15,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 19:50:15,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 19:50:15,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:15,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:15,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 19:50:15,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-09 19:50:15,414 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 28 treesize of output 22 [2018-04-09 19:50:15,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:15,422 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 22 treesize of output 31 [2018-04-09 19:50:15,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:50:15,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:15,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:15,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2018-04-09 19:50:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:15,583 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:16,083 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 29 treesize of output 25 [2018-04-09 19:50:16,099 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 19:50:16,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-09 19:50:16,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:16,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:16,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:16,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:54 [2018-04-09 19:50:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:16,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:50:16,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-04-09 19:50:16,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-09 19:50:16,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-09 19:50:16,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1356, Unknown=0, NotChecked=0, Total=1482 [2018-04-09 19:50:16,305 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 39 states. [2018-04-09 19:50:17,764 WARN L151 SmtUtils]: Spent 467ms on a formula simplification. DAG size of input: 61 DAG size of output 58 [2018-04-09 19:50:18,443 WARN L151 SmtUtils]: Spent 584ms on a formula simplification. DAG size of input: 77 DAG size of output 72 [2018-04-09 19:50:19,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:19,472 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2018-04-09 19:50:19,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-09 19:50:19,472 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-04-09 19:50:19,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:19,473 INFO L225 Difference]: With dead ends: 148 [2018-04-09 19:50:19,473 INFO L226 Difference]: Without dead ends: 147 [2018-04-09 19:50:19,475 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=599, Invalid=4231, Unknown=0, NotChecked=0, Total=4830 [2018-04-09 19:50:19,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-09 19:50:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2018-04-09 19:50:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-09 19:50:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-04-09 19:50:19,483 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 52 [2018-04-09 19:50:19,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:19,483 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-04-09 19:50:19,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-09 19:50:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-04-09 19:50:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 19:50:19,484 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:19,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:50:19,484 INFO L408 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:19,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1296239548, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:19,490 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:19,507 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:19,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:19,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-09 19:50:19,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 19:50:19,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:19,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:19,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:50:19,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 19:50:19,590 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-09 19:50:19,594 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-09 19:50:19,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-04-09 19:50:19,602 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:19,649 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_16| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_16|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_16| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_16| 0) |c_old(#valid)|))) is different from false [2018-04-09 19:50:19,654 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_15| Int) (|v_main_#t~malloc11.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_15| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_16|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_16| 1) |v_main_#t~malloc10.base_15| 0) |v_main_#t~malloc11.base_16| 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_15|) 0))))) is different from false [2018-04-09 19:50:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:19,708 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:19,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 19:50:19,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 19:50:19,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 19:50:19,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 19:50:19,709 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 12 states. [2018-04-09 19:50:19,726 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_15| Int) (|v_main_#t~malloc11.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_15| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_16|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_16| 1) |v_main_#t~malloc10.base_15| 0) |v_main_#t~malloc11.base_16| 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_15|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-09 19:50:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:20,041 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions. [2018-04-09 19:50:20,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:50:20,042 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-04-09 19:50:20,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:20,043 INFO L225 Difference]: With dead ends: 249 [2018-04-09 19:50:20,043 INFO L226 Difference]: Without dead ends: 235 [2018-04-09 19:50:20,044 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 19:50:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-04-09 19:50:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-04-09 19:50:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-09 19:50:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 252 transitions. [2018-04-09 19:50:20,065 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 252 transitions. Word has length 54 [2018-04-09 19:50:20,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:20,066 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 252 transitions. [2018-04-09 19:50:20,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 19:50:20,066 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 252 transitions. [2018-04-09 19:50:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-09 19:50:20,067 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:20,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:50:20,067 INFO L408 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:20,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1324238768, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:20,076 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:20,098 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:20,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:20,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-09 19:50:20,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:20,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 19:50:20,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:20,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:20,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:50:20,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 19:50:20,197 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-09 19:50:20,202 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-09 19:50:20,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:20,208 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:20,235 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_18| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_18| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_18| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_18|))))) is different from false [2018-04-09 19:50:20,239 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_17| Int) (|v_main_#t~malloc11.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_17| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_18| 1) |v_main_#t~malloc10.base_17| 0) |v_main_#t~malloc11.base_18| 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_18|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_17|) 0))))) is different from false [2018-04-09 19:50:20,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-04-09 19:50:20,286 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:20,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 19:50:20,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 19:50:20,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 19:50:20,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 19:50:20,287 INFO L87 Difference]: Start difference. First operand 232 states and 252 transitions. Second operand 12 states. [2018-04-09 19:50:20,295 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_17| Int) (|v_main_#t~malloc11.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_17| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_18| 1) |v_main_#t~malloc10.base_17| 0) |v_main_#t~malloc11.base_18| 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_18|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_17|) 0)))))) is different from false [2018-04-09 19:50:20,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:20,556 INFO L93 Difference]: Finished difference Result 346 states and 374 transitions. [2018-04-09 19:50:20,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:50:20,557 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-09 19:50:20,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:20,559 INFO L225 Difference]: With dead ends: 346 [2018-04-09 19:50:20,559 INFO L226 Difference]: Without dead ends: 332 [2018-04-09 19:50:20,560 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 19:50:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-04-09 19:50:20,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 231. [2018-04-09 19:50:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-04-09 19:50:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 250 transitions. [2018-04-09 19:50:20,583 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 250 transitions. Word has length 55 [2018-04-09 19:50:20,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:20,583 INFO L459 AbstractCegarLoop]: Abstraction has 231 states and 250 transitions. [2018-04-09 19:50:20,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 19:50:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 250 transitions. [2018-04-09 19:50:20,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-09 19:50:20,584 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:20,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:50:20,584 INFO L408 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:20,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1202236565, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:20,594 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:20,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:20,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:20,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-09 19:50:20,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 19:50:20,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:20,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:20,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:50:20,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 19:50:20,689 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-09 19:50:20,693 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-09 19:50:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:20,702 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:20,722 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_20| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_20| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_20|))))) is different from false [2018-04-09 19:50:20,734 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_20| Int) (|v_main_#t~malloc10.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_19| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_20|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_20| 1) |v_main_#t~malloc10.base_19| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_19|)))))) is different from false [2018-04-09 19:50:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:20,782 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:20,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 19:50:20,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 19:50:20,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 19:50:20,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 19:50:20,784 INFO L87 Difference]: Start difference. First operand 231 states and 250 transitions. Second operand 12 states. [2018-04-09 19:50:20,794 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc11.base_20| Int) (|v_main_#t~malloc10.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_19| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_20|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_20| 1) |v_main_#t~malloc10.base_19| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_19|))))))) is different from false [2018-04-09 19:50:21,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:21,040 INFO L93 Difference]: Finished difference Result 347 states and 375 transitions. [2018-04-09 19:50:21,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:50:21,040 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-09 19:50:21,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:21,042 INFO L225 Difference]: With dead ends: 347 [2018-04-09 19:50:21,042 INFO L226 Difference]: Without dead ends: 333 [2018-04-09 19:50:21,043 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 19:50:21,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-09 19:50:21,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 233. [2018-04-09 19:50:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-09 19:50:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 253 transitions. [2018-04-09 19:50:21,065 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 253 transitions. Word has length 55 [2018-04-09 19:50:21,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:21,065 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 253 transitions. [2018-04-09 19:50:21,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 19:50:21,065 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 253 transitions. [2018-04-09 19:50:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-09 19:50:21,066 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:21,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:50:21,066 INFO L408 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:21,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1018456304, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:21,076 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:21,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:21,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:21,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-09 19:50:21,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:21,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 19:50:21,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:21,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:21,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:50:21,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 19:50:21,160 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-09 19:50:21,164 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-09 19:50:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:21,175 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:21,193 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_22| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_22|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_22| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|))) is different from false [2018-04-09 19:50:21,197 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_21| Int) (|v_main_#t~malloc11.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_22| 1) |v_main_#t~malloc10.base_21| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_22|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_21|) 0))))) is different from false [2018-04-09 19:50:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:21,254 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:21,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 19:50:21,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 19:50:21,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 19:50:21,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 19:50:21,255 INFO L87 Difference]: Start difference. First operand 233 states and 253 transitions. Second operand 12 states. [2018-04-09 19:50:21,266 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_21| Int) (|v_main_#t~malloc11.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_22| 1) |v_main_#t~malloc10.base_21| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_22|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_21|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-09 19:50:21,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:21,619 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-04-09 19:50:21,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:50:21,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-09 19:50:21,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:21,621 INFO L225 Difference]: With dead ends: 348 [2018-04-09 19:50:21,621 INFO L226 Difference]: Without dead ends: 334 [2018-04-09 19:50:21,622 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 19:50:21,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-09 19:50:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 235. [2018-04-09 19:50:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-09 19:50:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions. [2018-04-09 19:50:21,651 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 55 [2018-04-09 19:50:21,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:21,651 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions. [2018-04-09 19:50:21,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 19:50:21,651 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions. [2018-04-09 19:50:21,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-09 19:50:21,652 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:21,653 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:50:21,653 INFO L408 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:21,653 INFO L82 PathProgramCache]: Analyzing trace with hash 832685737, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:21,671 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:21,690 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:21,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:21,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-09 19:50:21,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 19:50:21,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:21,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:21,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:50:21,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 19:50:21,771 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-09 19:50:21,774 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-09 19:50:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:21,781 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:21,797 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_24| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_24| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_24|))))) is different from false [2018-04-09 19:50:21,800 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_24| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc11.base_24|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_24| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|)))) is different from false [2018-04-09 19:50:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:21,847 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:21,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 19:50:21,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 19:50:21,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 19:50:21,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 19:50:21,848 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand 12 states. [2018-04-09 19:50:21,856 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_24| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc11.base_24|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_24| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|)))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-09 19:50:22,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:22,163 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-04-09 19:50:22,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:50:22,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-04-09 19:50:22,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:22,166 INFO L225 Difference]: With dead ends: 348 [2018-04-09 19:50:22,166 INFO L226 Difference]: Without dead ends: 334 [2018-04-09 19:50:22,166 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 19:50:22,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-09 19:50:22,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 233. [2018-04-09 19:50:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-09 19:50:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 253 transitions. [2018-04-09 19:50:22,193 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 253 transitions. Word has length 56 [2018-04-09 19:50:22,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:22,193 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 253 transitions. [2018-04-09 19:50:22,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 19:50:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 253 transitions. [2018-04-09 19:50:22,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-09 19:50:22,195 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:22,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:50:22,195 INFO L408 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:22,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1388007132, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:22,205 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:22,227 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:22,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:22,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-09 19:50:22,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 19:50:22,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:22,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:22,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:50:22,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 19:50:22,305 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-09 19:50:22,317 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-09 19:50:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:22,324 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:22,346 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_26| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_26|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_26| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_26| 0) |c_old(#valid)|))) is different from false [2018-04-09 19:50:22,349 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_25| Int) (|v_main_#t~malloc11.base_26| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_25|) 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_26|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_26| 1) |v_main_#t~malloc10.base_25| 0) |v_main_#t~malloc11.base_26| 0))))) is different from false [2018-04-09 19:50:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:22,383 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:22,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 19:50:22,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 19:50:22,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 19:50:22,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 19:50:22,383 INFO L87 Difference]: Start difference. First operand 233 states and 253 transitions. Second operand 12 states. [2018-04-09 19:50:22,392 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_25| Int) (|v_main_#t~malloc11.base_26| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_25|) 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_26|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_26| 1) |v_main_#t~malloc10.base_25| 0) |v_main_#t~malloc11.base_26| 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-09 19:50:22,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:22,671 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-04-09 19:50:22,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:50:22,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-04-09 19:50:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:22,673 INFO L225 Difference]: With dead ends: 348 [2018-04-09 19:50:22,673 INFO L226 Difference]: Without dead ends: 334 [2018-04-09 19:50:22,674 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 19:50:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-09 19:50:22,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 232. [2018-04-09 19:50:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-09 19:50:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-04-09 19:50:22,700 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 56 [2018-04-09 19:50:22,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:22,700 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-04-09 19:50:22,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 19:50:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-04-09 19:50:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-09 19:50:22,701 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:22,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:50:22,702 INFO L408 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:22,702 INFO L82 PathProgramCache]: Analyzing trace with hash -875108129, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:22,710 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:22,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:22,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:22,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-09 19:50:22,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 19:50:22,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:22,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:22,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:50:22,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 19:50:22,790 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-09 19:50:22,794 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-09 19:50:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:22,800 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:22,830 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_28| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_28|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_28| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_28| 0) |c_old(#valid)|))) is different from false [2018-04-09 19:50:22,832 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_27| Int) (|v_main_#t~malloc11.base_28| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_27| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_28|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_28| 1) |v_main_#t~malloc10.base_27| 0) |v_main_#t~malloc11.base_28| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc10.base_27|) 0))))) is different from false [2018-04-09 19:50:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:22,907 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:22,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 19:50:22,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 19:50:22,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 19:50:22,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 19:50:22,909 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 12 states. [2018-04-09 19:50:22,930 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_27| Int) (|v_main_#t~malloc11.base_28| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_27| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_28|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_28| 1) |v_main_#t~malloc10.base_27| 0) |v_main_#t~malloc11.base_28| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc10.base_27|) 0)))))) is different from false [2018-04-09 19:50:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:23,326 INFO L93 Difference]: Finished difference Result 349 states and 377 transitions. [2018-04-09 19:50:23,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:50:23,326 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-04-09 19:50:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:23,328 INFO L225 Difference]: With dead ends: 349 [2018-04-09 19:50:23,328 INFO L226 Difference]: Without dead ends: 335 [2018-04-09 19:50:23,329 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 19:50:23,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-04-09 19:50:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 234. [2018-04-09 19:50:23,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-09 19:50:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 254 transitions. [2018-04-09 19:50:23,356 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 254 transitions. Word has length 56 [2018-04-09 19:50:23,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:23,356 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 254 transitions. [2018-04-09 19:50:23,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 19:50:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 254 transitions. [2018-04-09 19:50:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-09 19:50:23,357 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:23,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:50:23,358 INFO L408 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:23,358 INFO L82 PathProgramCache]: Analyzing trace with hash 553718091, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:23,366 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:23,391 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:23,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:23,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-09 19:50:23,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 19:50:23,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:23,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:23,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:50:23,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 19:50:23,499 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-09 19:50:23,503 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-09 19:50:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:23,510 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:23,529 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_30| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_30|))) (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc11.base_30| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_30| 0)))) is different from false [2018-04-09 19:50:23,533 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_30| Int) (|v_main_#t~malloc10.base_29| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_29| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_29|) 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_30|))) (= (store (store (store .cse0 |v_main_#t~malloc11.base_30| 1) |v_main_#t~malloc10.base_29| 0) |v_main_#t~malloc11.base_30| 0) |c_old(#valid)|)))) is different from false [2018-04-09 19:50:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:23,591 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:50:23,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 19:50:23,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 19:50:23,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 19:50:23,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 19:50:23,592 INFO L87 Difference]: Start difference. First operand 234 states and 254 transitions. Second operand 12 states. [2018-04-09 19:50:23,609 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc11.base_30| Int) (|v_main_#t~malloc10.base_29| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_29| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_29|) 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_30|))) (= (store (store (store .cse0 |v_main_#t~malloc11.base_30| 1) |v_main_#t~malloc10.base_29| 0) |v_main_#t~malloc11.base_30| 0) |c_old(#valid)|))))) is different from false [2018-04-09 19:50:23,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:23,927 INFO L93 Difference]: Finished difference Result 237 states and 254 transitions. [2018-04-09 19:50:23,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:50:23,928 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-04-09 19:50:23,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:23,929 INFO L225 Difference]: With dead ends: 237 [2018-04-09 19:50:23,929 INFO L226 Difference]: Without dead ends: 223 [2018-04-09 19:50:23,929 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 19:50:23,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-09 19:50:23,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 120. [2018-04-09 19:50:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-09 19:50:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-04-09 19:50:23,941 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 57 [2018-04-09 19:50:23,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:23,941 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-04-09 19:50:23,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 19:50:23,941 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-04-09 19:50:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-09 19:50:23,942 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:23,942 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-09 19:50:23,942 INFO L408 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:23,942 INFO L82 PathProgramCache]: Analyzing trace with hash -21117222, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:23,952 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:23,977 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:24,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:24,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:24,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:24,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:24,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:24,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-09 19:50:24,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:24,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:24,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 19:50:24,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:24,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:24,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:24,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:50:24,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:24,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:24,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-09 19:50:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:24,297 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:24,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-04-09 19:50:24,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:24,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 15 [2018-04-09 19:50:24,879 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 19:50:24,879 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:24,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3 [2018-04-09 19:50:24,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:24,882 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:24,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:24,885 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-09 19:50:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:24,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:50:24,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-04-09 19:50:24,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-09 19:50:24,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-09 19:50:24,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1687, Unknown=0, NotChecked=0, Total=1806 [2018-04-09 19:50:24,943 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 43 states. [2018-04-09 19:50:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:27,388 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2018-04-09 19:50:27,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-09 19:50:27,389 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 58 [2018-04-09 19:50:27,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:27,389 INFO L225 Difference]: With dead ends: 149 [2018-04-09 19:50:27,389 INFO L226 Difference]: Without dead ends: 148 [2018-04-09 19:50:27,391 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=769, Invalid=6203, Unknown=0, NotChecked=0, Total=6972 [2018-04-09 19:50:27,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-09 19:50:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 120. [2018-04-09 19:50:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-09 19:50:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-04-09 19:50:27,403 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 58 [2018-04-09 19:50:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:27,403 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-04-09 19:50:27,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-09 19:50:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-04-09 19:50:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-09 19:50:27,403 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:27,403 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:50:27,404 INFO L408 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:27,404 INFO L82 PathProgramCache]: Analyzing trace with hash -705173693, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:27,415 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:27,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:27,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:27,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:27,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:27,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:27,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:27,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 19:50:27,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:27,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 19:50:27,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:27,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:27,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:27,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:50:27,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:27,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:27,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 19:50:27,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-09 19:50:27,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 19:50:27,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:27,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:27,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:27,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-09 19:50:27,551 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 26 treesize of output 27 [2018-04-09 19:50:27,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 19:50:27,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:27,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:27,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:50:27,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-09 19:50:27,732 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 33 treesize of output 32 [2018-04-09 19:50:27,740 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 2 case distinctions, treesize of input 17 treesize of output 25 [2018-04-09 19:50:27,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:50:27,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:27,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-09 19:50:27,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:45 [2018-04-09 19:50:27,828 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 21 treesize of output 17 [2018-04-09 19:50:27,834 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 17 treesize of output 14 [2018-04-09 19:50:27,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:50:27,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:27,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:27,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-09 19:50:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:27,949 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:28,669 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 37 treesize of output 28 [2018-04-09 19:50:28,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 19:50:28,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:28,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 19:50:28,695 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 15 treesize of output 10 [2018-04-09 19:50:28,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:28,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:28,698 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 20 treesize of output 18 [2018-04-09 19:50:28,700 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 9 treesize of output 1 [2018-04-09 19:50:28,700 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:28,702 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:28,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 19:50:28,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 19:50:28,729 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-04-09 19:50:30,407 WARN L151 SmtUtils]: Spent 1504ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-04-09 19:50:31,933 WARN L148 SmtUtils]: Spent 1474ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-09 19:50:31,948 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:31,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:50:31,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-04-09 19:50:31,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-09 19:50:31,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-09 19:50:31,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1522, Unknown=0, NotChecked=0, Total=1640 [2018-04-09 19:50:31,969 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 41 states. [2018-04-09 19:50:33,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:33,517 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-04-09 19:50:33,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-09 19:50:33,517 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 61 [2018-04-09 19:50:33,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:33,518 INFO L225 Difference]: With dead ends: 154 [2018-04-09 19:50:33,518 INFO L226 Difference]: Without dead ends: 153 [2018-04-09 19:50:33,519 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=348, Invalid=3312, Unknown=0, NotChecked=0, Total=3660 [2018-04-09 19:50:33,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-09 19:50:33,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2018-04-09 19:50:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-09 19:50:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-04-09 19:50:33,531 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 61 [2018-04-09 19:50:33,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:33,532 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-04-09 19:50:33,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-09 19:50:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-04-09 19:50:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-09 19:50:33,533 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:33,533 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2018-04-09 19:50:33,533 INFO L408 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:33,533 INFO L82 PathProgramCache]: Analyzing trace with hash -385547963, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:33,539 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:33,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:33,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:33,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:33,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:33,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:33,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:33,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-09 19:50:33,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:33,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:33,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:50:33,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:33,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:33,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 19:50:33,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:33,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:33,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-09 19:50:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:33,968 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:34,663 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 6 treesize of output 1 [2018-04-09 19:50:34,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:34,667 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-09 19:50:34,679 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 19:50:34,679 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:34,681 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 12 treesize of output 3 [2018-04-09 19:50:34,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:34,685 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:34,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:34,689 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-09 19:50:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:34,781 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:50:34,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-04-09 19:50:34,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-09 19:50:34,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-09 19:50:34,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2102, Unknown=0, NotChecked=0, Total=2256 [2018-04-09 19:50:34,782 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 48 states. [2018-04-09 19:50:37,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:37,111 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-04-09 19:50:37,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-09 19:50:37,111 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 62 [2018-04-09 19:50:37,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:37,112 INFO L225 Difference]: With dead ends: 168 [2018-04-09 19:50:37,112 INFO L226 Difference]: Without dead ends: 167 [2018-04-09 19:50:37,114 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=836, Invalid=6646, Unknown=0, NotChecked=0, Total=7482 [2018-04-09 19:50:37,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-09 19:50:37,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2018-04-09 19:50:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-09 19:50:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-04-09 19:50:37,135 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 62 [2018-04-09 19:50:37,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:37,136 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2018-04-09 19:50:37,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-09 19:50:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-04-09 19:50:37,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-09 19:50:37,137 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:37,137 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:50:37,137 INFO L408 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:37,137 INFO L82 PathProgramCache]: Analyzing trace with hash -832531843, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:37,146 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:37,174 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:37,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:37,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:37,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:37,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-09 19:50:37,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 19:50:37,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 19:50:37,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:37,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:37,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 19:50:37,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-09 19:50:37,349 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 28 treesize of output 22 [2018-04-09 19:50:37,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:37,357 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 22 treesize of output 31 [2018-04-09 19:50:37,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:50:37,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:37,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:37,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2018-04-09 19:50:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:37,544 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:37,993 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 29 treesize of output 25 [2018-04-09 19:50:38,007 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 19:50:38,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-09 19:50:38,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:38,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:38,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:38,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:54 [2018-04-09 19:50:38,210 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:38,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:50:38,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-04-09 19:50:38,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-09 19:50:38,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-09 19:50:38,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1510, Unknown=0, NotChecked=0, Total=1640 [2018-04-09 19:50:38,237 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 41 states. [2018-04-09 19:50:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:42,069 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2018-04-09 19:50:42,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-09 19:50:42,070 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 65 [2018-04-09 19:50:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:42,070 INFO L225 Difference]: With dead ends: 205 [2018-04-09 19:50:42,071 INFO L226 Difference]: Without dead ends: 204 [2018-04-09 19:50:42,072 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=809, Invalid=6331, Unknown=0, NotChecked=0, Total=7140 [2018-04-09 19:50:42,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-09 19:50:42,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 160. [2018-04-09 19:50:42,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-09 19:50:42,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-04-09 19:50:42,085 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 65 [2018-04-09 19:50:42,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:42,085 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2018-04-09 19:50:42,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-09 19:50:42,085 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-04-09 19:50:42,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-09 19:50:42,085 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:42,086 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:50:42,086 INFO L408 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:42,086 INFO L82 PathProgramCache]: Analyzing trace with hash 434218203, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:42,091 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:42,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:42,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:42,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:42,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:42,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-09 19:50:42,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 19:50:42,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 19:50:42,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:42,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:42,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 19:50:42,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-09 19:50:42,553 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 48 treesize of output 38 [2018-04-09 19:50:42,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:42,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:42,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:42,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:42,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:42,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:42,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 93 [2018-04-09 19:50:42,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:50:42,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:42,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:42,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-04-09 19:50:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:42,827 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:43,798 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 59 treesize of output 51 [2018-04-09 19:50:43,829 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 19:50:43,829 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 19:50:43,830 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 19:50:43,830 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 19:50:43,830 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 19:50:43,831 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 19:50:43,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 49 [2018-04-09 19:50:43,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:43,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:43,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:43,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:86 [2018-04-09 19:50:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:50:44,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:50:44,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-04-09 19:50:44,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-09 19:50:44,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-09 19:50:44,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2720, Unknown=0, NotChecked=0, Total=2970 [2018-04-09 19:50:44,131 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 55 states. [2018-04-09 19:50:50,033 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 120 DAG size of output 107 [2018-04-09 19:50:50,207 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 98 DAG size of output 86 [2018-04-09 19:50:50,754 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 79 DAG size of output 71 [2018-04-09 19:50:51,527 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 80 DAG size of output 74 [2018-04-09 19:50:53,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:50:53,712 INFO L93 Difference]: Finished difference Result 214 states and 230 transitions. [2018-04-09 19:50:53,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-09 19:50:53,712 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 66 [2018-04-09 19:50:53,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:50:53,713 INFO L225 Difference]: With dead ends: 214 [2018-04-09 19:50:53,713 INFO L226 Difference]: Without dead ends: 213 [2018-04-09 19:50:53,715 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2468 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1479, Invalid=10293, Unknown=0, NotChecked=0, Total=11772 [2018-04-09 19:50:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-09 19:50:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 188. [2018-04-09 19:50:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-09 19:50:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2018-04-09 19:50:53,737 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 66 [2018-04-09 19:50:53,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:50:53,737 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2018-04-09 19:50:53,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-09 19:50:53,738 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2018-04-09 19:50:53,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-09 19:50:53,738 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:50:53,738 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] [2018-04-09 19:50:53,738 INFO L408 AbstractCegarLoop]: === Iteration 29 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:50:53,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1482206016, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:50:53,746 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:50:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:50:53,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:50:53,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:53,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:53,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:50:53,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:53,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:53,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 19:50:53,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:53,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:50:53,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:50:53,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:53,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 19:50:53,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:53,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:53,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 19:50:53,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-09 19:50:53,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 19:50:53,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:53,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:53,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:53,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-09 19:50:53,839 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 26 treesize of output 27 [2018-04-09 19:50:53,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 19:50:53,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:53,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:53,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:50:53,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-09 19:50:54,029 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 33 treesize of output 32 [2018-04-09 19:50:54,038 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 2 case distinctions, treesize of input 17 treesize of output 25 [2018-04-09 19:50:54,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:50:54,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:54,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-09 19:50:54,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:45 [2018-04-09 19:50:54,130 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 21 treesize of output 17 [2018-04-09 19:50:54,135 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 17 treesize of output 14 [2018-04-09 19:50:54,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:50:54,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:54,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:50:54,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-09 19:50:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-09 19:50:54,223 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:50:54,983 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 37 treesize of output 28 [2018-04-09 19:50:54,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 19:50:54,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:55,008 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 20 treesize of output 18 [2018-04-09 19:50:55,009 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 9 treesize of output 1 [2018-04-09 19:50:55,009 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:55,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:55,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 19:50:55,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-04-09 19:50:55,015 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 19:50:55,016 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:50:55,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 19:50:55,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 19:50:55,042 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-04-09 19:50:57,607 WARN L151 SmtUtils]: Spent 2402ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-04-09 19:50:59,072 WARN L148 SmtUtils]: Spent 1410ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-09 19:50:59,090 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-09 19:50:59,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:50:59,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2018-04-09 19:50:59,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-09 19:50:59,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-09 19:50:59,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-04-09 19:50:59,112 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand 43 states. [2018-04-09 19:51:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:51:00,682 INFO L93 Difference]: Finished difference Result 206 states and 219 transitions. [2018-04-09 19:51:00,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-09 19:51:00,682 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 68 [2018-04-09 19:51:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:51:00,683 INFO L225 Difference]: With dead ends: 206 [2018-04-09 19:51:00,683 INFO L226 Difference]: Without dead ends: 205 [2018-04-09 19:51:00,684 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=359, Invalid=3547, Unknown=0, NotChecked=0, Total=3906 [2018-04-09 19:51:00,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-09 19:51:00,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2018-04-09 19:51:00,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-09 19:51:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 214 transitions. [2018-04-09 19:51:00,703 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 214 transitions. Word has length 68 [2018-04-09 19:51:00,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:51:00,703 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 214 transitions. [2018-04-09 19:51:00,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-09 19:51:00,703 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 214 transitions. [2018-04-09 19:51:00,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-09 19:51:00,704 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:51:00,704 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2018-04-09 19:51:00,704 INFO L408 AbstractCegarLoop]: === Iteration 30 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:51:00,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1296253800, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:51:00,710 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:51:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:51:00,735 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:51:00,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:51:00,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:00,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:51:00,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:00,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:00,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-09 19:51:00,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:00,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:00,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 19:51:00,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:00,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:00,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:00,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:51:00,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:00,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:00,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-09 19:51:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:51:01,164 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:51:01,926 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 10 treesize of output 3 [2018-04-09 19:51:01,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:01,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 15 [2018-04-09 19:51:01,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, 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 3 [2018-04-09 19:51:01,938 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:01,939 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 19:51:01,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:01,941 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:01,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:01,944 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-09 19:51:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:51:02,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:51:02,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-04-09 19:51:02,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-09 19:51:02,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-09 19:51:02,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2402, Unknown=0, NotChecked=0, Total=2550 [2018-04-09 19:51:02,009 INFO L87 Difference]: Start difference. First operand 200 states and 214 transitions. Second operand 51 states. [2018-04-09 19:51:05,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:51:05,574 INFO L93 Difference]: Finished difference Result 248 states and 265 transitions. [2018-04-09 19:51:05,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-09 19:51:05,575 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 69 [2018-04-09 19:51:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:51:05,576 INFO L225 Difference]: With dead ends: 248 [2018-04-09 19:51:05,576 INFO L226 Difference]: Without dead ends: 247 [2018-04-09 19:51:05,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1104, Invalid=10238, Unknown=0, NotChecked=0, Total=11342 [2018-04-09 19:51:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-09 19:51:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 200. [2018-04-09 19:51:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-09 19:51:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 214 transitions. [2018-04-09 19:51:05,597 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 214 transitions. Word has length 69 [2018-04-09 19:51:05,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:51:05,597 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 214 transitions. [2018-04-09 19:51:05,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-09 19:51:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 214 transitions. [2018-04-09 19:51:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-09 19:51:05,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:51:05,598 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:51:05,598 INFO L408 AbstractCegarLoop]: === Iteration 31 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:51:05,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1320893077, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:51:05,604 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:51:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:51:05,628 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:51:05,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:51:05,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:05,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:51:05,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:05,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:05,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 19:51:05,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:05,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 19:51:05,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:05,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:05,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:05,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:51:05,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:05,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:05,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 19:51:05,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-09 19:51:05,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 19:51:05,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:05,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:05,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:05,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-09 19:51:05,700 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 26 treesize of output 27 [2018-04-09 19:51:05,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 19:51:05,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:05,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:05,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:51:05,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-09 19:51:05,889 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 33 treesize of output 32 [2018-04-09 19:51:05,897 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 2 case distinctions, treesize of input 17 treesize of output 25 [2018-04-09 19:51:05,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:51:05,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:51:05,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 19:51:05,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:49 [2018-04-09 19:51:06,014 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 23 treesize of output 24 [2018-04-09 19:51:06,015 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 8 treesize of output 7 [2018-04-09 19:51:06,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:06,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:06,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:06,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-09 19:51:06,087 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 21 treesize of output 17 [2018-04-09 19:51:06,092 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 17 treesize of output 14 [2018-04-09 19:51:06,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:51:06,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:51:06,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:51:06,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-09 19:51:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:51:06,189 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:51:07,389 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 40 treesize of output 31 [2018-04-09 19:51:07,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 19:51:07,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:07,411 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-09 19:51:07,420 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-04-09 19:51:07,444 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 23 treesize of output 26 [2018-04-09 19:51:07,444 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-09 19:51:07,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 22 treesize of output 16 [2018-04-09 19:51:07,446 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:07,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-04-09 19:51:07,452 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-09 19:51:07,495 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 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-09 19:51:07,495 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-04-09 19:51:07,501 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 23 treesize of output 19 [2018-04-09 19:51:07,501 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-09 19:51:07,525 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 19:51:07,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 19:51:07,549 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 32 treesize of output 34 [2018-04-09 19:51:07,565 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 52 [2018-04-09 19:51:07,623 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 30 treesize of output 25 [2018-04-09 19:51:07,623 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:07,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-04-09 19:51:07,626 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:07,682 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 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-09 19:51:07,683 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-04-09 19:51:07,698 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-09 19:51:07,699 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-04-09 19:51:07,745 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 30 treesize of output 26 [2018-04-09 19:51:07,746 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-09 19:51:07,765 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 19:51:07,803 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 19:51:07,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-09 19:51:07,806 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 15 treesize of output 10 [2018-04-09 19:51:07,806 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:07,809 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:07,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-09 19:51:07,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 19:51:07,862 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 6 variables, input treesize:58, output treesize:84 [2018-04-09 19:51:08,333 WARN L151 SmtUtils]: Spent 307ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-04-09 19:51:08,711 WARN L148 SmtUtils]: Spent 312ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-09 19:51:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:51:08,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:51:08,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2018-04-09 19:51:08,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-09 19:51:08,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-09 19:51:08,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2375, Unknown=0, NotChecked=0, Total=2550 [2018-04-09 19:51:08,760 INFO L87 Difference]: Start difference. First operand 200 states and 214 transitions. Second operand 51 states. [2018-04-09 19:51:10,839 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 88 DAG size of output 55 [2018-04-09 19:51:12,212 WARN L151 SmtUtils]: Spent 1033ms on a formula simplification. DAG size of input: 89 DAG size of output 48 [2018-04-09 19:51:13,318 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 93 DAG size of output 51 [2018-04-09 19:51:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:51:16,111 INFO L93 Difference]: Finished difference Result 254 states and 269 transitions. [2018-04-09 19:51:16,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-09 19:51:16,111 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 72 [2018-04-09 19:51:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:51:16,113 INFO L225 Difference]: With dead ends: 254 [2018-04-09 19:51:16,113 INFO L226 Difference]: Without dead ends: 253 [2018-04-09 19:51:16,114 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=821, Invalid=5821, Unknown=0, NotChecked=0, Total=6642 [2018-04-09 19:51:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-09 19:51:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2018-04-09 19:51:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-04-09 19:51:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 267 transitions. [2018-04-09 19:51:16,136 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 267 transitions. Word has length 72 [2018-04-09 19:51:16,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:51:16,137 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 267 transitions. [2018-04-09 19:51:16,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-09 19:51:16,137 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 267 transitions. [2018-04-09 19:51:16,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-09 19:51:16,138 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:51:16,138 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:51:16,138 INFO L408 AbstractCegarLoop]: === Iteration 32 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:51:16,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2002787355, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:51:16,147 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:51:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:51:16,174 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:51:16,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:51:16,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:16,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:51:16,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:16,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:16,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-09 19:51:16,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:16,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:16,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:51:16,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:16,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:16,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 19:51:16,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:16,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:16,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-09 19:51:16,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 19:51:16,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 19:51:16,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:16,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:16,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 19:51:16,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-09 19:51:16,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-09 19:51:16,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 19:51:16,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:51:16,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:51:16,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:51:16,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:46 [2018-04-09 19:51:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:51:16,776 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:51:17,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-09 19:51:17,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 19:51:17,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:17,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:17,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:17,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:45 [2018-04-09 19:51:17,968 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 27 treesize of output 21 [2018-04-09 19:51:17,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:17,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 24 [2018-04-09 19:51:17,993 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 12 treesize of output 3 [2018-04-09 19:51:17,994 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:17,997 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:18,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-04-09 19:51:18,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 12 treesize of output 3 [2018-04-09 19:51:18,031 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:18,036 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:18,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 19 treesize of output 13 [2018-04-09 19:51:18,047 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:18,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:51:18,058 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-09 19:51:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:51:18,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:51:18,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 58 [2018-04-09 19:51:18,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-09 19:51:18,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-09 19:51:18,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3240, Unknown=0, NotChecked=0, Total=3422 [2018-04-09 19:51:18,145 INFO L87 Difference]: Start difference. First operand 252 states and 267 transitions. Second operand 59 states. [2018-04-09 19:51:28,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:51:28,493 INFO L93 Difference]: Finished difference Result 303 states and 321 transitions. [2018-04-09 19:51:28,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-09 19:51:28,493 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 76 [2018-04-09 19:51:28,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:51:28,495 INFO L225 Difference]: With dead ends: 303 [2018-04-09 19:51:28,495 INFO L226 Difference]: Without dead ends: 302 [2018-04-09 19:51:28,496 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3892 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1247, Invalid=16045, Unknown=0, NotChecked=0, Total=17292 [2018-04-09 19:51:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-09 19:51:28,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2018-04-09 19:51:28,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-04-09 19:51:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 267 transitions. [2018-04-09 19:51:28,519 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 267 transitions. Word has length 76 [2018-04-09 19:51:28,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:51:28,520 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 267 transitions. [2018-04-09 19:51:28,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-09 19:51:28,520 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 267 transitions. [2018-04-09 19:51:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-09 19:51:28,521 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:51:28,521 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2018-04-09 19:51:28,521 INFO L408 AbstractCegarLoop]: === Iteration 33 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:51:28,521 INFO L82 PathProgramCache]: Analyzing trace with hash 931867613, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:51:28,532 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:51:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:51:28,563 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:51:28,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:51:28,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:28,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:51:28,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:28,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:28,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-09 19:51:28,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:28,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:28,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 19:51:28,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:28,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:28,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:28,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:51:28,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:28,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:28,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-09 19:51:28,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 19:51:28,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 19:51:28,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:28,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:28,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 19:51:28,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-09 19:51:28,986 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 38 treesize of output 30 [2018-04-09 19:51:28,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:28,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:28,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:29,003 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 30 treesize of output 58 [2018-04-09 19:51:29,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:51:29,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:51:29,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:51:29,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:84 [2018-04-09 19:51:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:51:29,492 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:51:30,848 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 44 treesize of output 38 [2018-04-09 19:51:30,870 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 19:51:30,870 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 19:51:30,870 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 19:51:30,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-09 19:51:30,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:30,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:30,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:30,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:77 [2018-04-09 19:51:31,225 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 27 treesize of output 21 [2018-04-09 19:51:31,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:31,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 24 [2018-04-09 19:51:31,250 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 12 treesize of output 3 [2018-04-09 19:51:31,250 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:31,254 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:31,265 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 27 treesize of output 21 [2018-04-09 19:51:31,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:31,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 24 [2018-04-09 19:51:31,289 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 12 treesize of output 3 [2018-04-09 19:51:31,289 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:31,293 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:31,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:51:31,303 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-09 19:51:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:51:31,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:51:31,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2018-04-09 19:51:31,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-09 19:51:31,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-09 19:51:31,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=4167, Unknown=0, NotChecked=0, Total=4422 [2018-04-09 19:51:31,405 INFO L87 Difference]: Start difference. First operand 252 states and 267 transitions. Second operand 67 states. [2018-04-09 19:51:34,265 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 111 DAG size of output 79 [2018-04-09 19:51:39,464 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 122 DAG size of output 108 [2018-04-09 19:51:39,692 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 115 DAG size of output 103 [2018-04-09 19:51:40,232 WARN L151 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 144 DAG size of output 125 [2018-04-09 19:51:40,522 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 115 DAG size of output 101 [2018-04-09 19:51:40,740 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 103 DAG size of output 100 [2018-04-09 19:51:41,172 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 102 DAG size of output 96 [2018-04-09 19:51:41,592 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 112 DAG size of output 103 [2018-04-09 19:51:41,982 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 118 DAG size of output 103 [2018-04-09 19:51:42,410 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 111 DAG size of output 101 [2018-04-09 19:51:43,179 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 115 DAG size of output 104 [2018-04-09 19:51:43,907 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 105 DAG size of output 94 [2018-04-09 19:51:45,248 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 114 DAG size of output 98 [2018-04-09 19:51:45,934 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 97 DAG size of output 89 [2018-04-09 19:51:46,515 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 110 DAG size of output 96 [2018-04-09 19:51:46,938 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 91 DAG size of output 88 [2018-04-09 19:51:47,456 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 106 DAG size of output 95 [2018-04-09 19:51:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:51:48,673 INFO L93 Difference]: Finished difference Result 311 states and 329 transitions. [2018-04-09 19:51:48,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-09 19:51:48,673 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 79 [2018-04-09 19:51:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:51:48,675 INFO L225 Difference]: With dead ends: 311 [2018-04-09 19:51:48,675 INFO L226 Difference]: Without dead ends: 310 [2018-04-09 19:51:48,676 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5768 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=2145, Invalid=21417, Unknown=0, NotChecked=0, Total=23562 [2018-04-09 19:51:48,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-04-09 19:51:48,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 252. [2018-04-09 19:51:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-04-09 19:51:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 267 transitions. [2018-04-09 19:51:48,710 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 267 transitions. Word has length 79 [2018-04-09 19:51:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:51:48,711 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 267 transitions. [2018-04-09 19:51:48,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-09 19:51:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 267 transitions. [2018-04-09 19:51:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-09 19:51:48,711 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:51:48,712 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:51:48,712 INFO L408 AbstractCegarLoop]: === Iteration 34 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:51:48,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1319307314, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:51:48,717 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:51:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:51:48,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:51:48,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:51:48,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:48,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:51:48,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:48,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:48,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 19:51:48,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:48,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 19:51:48,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:48,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:48,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:51:48,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:51:48,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:48,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:48,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 19:51:48,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-09 19:51:48,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 19:51:48,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:48,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:48,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:48,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-09 19:51:48,810 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 26 treesize of output 27 [2018-04-09 19:51:48,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 19:51:48,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:48,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:48,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:51:48,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-09 19:51:49,015 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 33 treesize of output 32 [2018-04-09 19:51:49,023 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 2 case distinctions, treesize of input 17 treesize of output 25 [2018-04-09 19:51:49,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:51:49,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:51:49,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 19:51:49,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:49 [2018-04-09 19:51:49,144 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 23 treesize of output 24 [2018-04-09 19:51:49,145 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 8 treesize of output 7 [2018-04-09 19:51:49,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:49,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:49,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:49,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-09 19:51:49,222 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 21 treesize of output 17 [2018-04-09 19:51:49,227 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 17 treesize of output 14 [2018-04-09 19:51:49,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:51:49,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:51:49,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:51:49,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-09 19:51:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-09 19:51:49,328 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:51:50,246 WARN L148 SmtUtils]: Spent 536ms on a formula simplification that was a NOOP. DAG size: 43 [2018-04-09 19:51:51,339 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 42 treesize of output 33 [2018-04-09 19:51:51,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 19:51:51,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:51,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-04-09 19:51:51,362 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 17 treesize of output 12 [2018-04-09 19:51:51,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:51,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:51:51,367 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-09 19:51:51,375 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 34 [2018-04-09 19:51:51,395 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 18 [2018-04-09 19:51:51,395 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:51,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2018-04-09 19:51:51,401 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-09 19:51:51,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2018-04-09 19:51:51,408 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-09 19:51:51,461 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2018-04-09 19:51:51,462 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2018-04-09 19:51:51,467 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 25 treesize of output 21 [2018-04-09 19:51:51,468 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-09 19:51:51,493 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 19:51:51,513 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 19:51:51,518 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 36 treesize of output 38 [2018-04-09 19:51:51,534 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 60 [2018-04-09 19:51:51,597 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 19:51:51,598 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 32 treesize of output 27 [2018-04-09 19:51:51,599 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:51,600 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 19:51:51,601 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 34 treesize of output 29 [2018-04-09 19:51:51,601 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-09 19:51:51,659 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2018-04-09 19:51:51,660 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 3 xjuncts. [2018-04-09 19:51:51,670 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-04-09 19:51:51,670 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 3 xjuncts. [2018-04-09 19:51:51,726 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 32 treesize of output 28 [2018-04-09 19:51:51,726 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-04-09 19:51:51,747 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 19:51:51,788 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 19:51:51,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-09 19:51:51,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 19:51:51,844 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 6 variables, input treesize:60, output treesize:84 [2018-04-09 19:51:52,333 WARN L151 SmtUtils]: Spent 315ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-04-09 19:51:52,719 WARN L148 SmtUtils]: Spent 311ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-09 19:51:52,750 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-09 19:51:52,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:51:52,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 52 [2018-04-09 19:51:52,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-09 19:51:52,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-09 19:51:52,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2577, Unknown=0, NotChecked=0, Total=2756 [2018-04-09 19:51:52,772 INFO L87 Difference]: Start difference. First operand 252 states and 267 transitions. Second operand 53 states. [2018-04-09 19:51:54,291 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 105 DAG size of output 64 [2018-04-09 19:51:54,817 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 91 DAG size of output 66 [2018-04-09 19:52:03,048 WARN L151 SmtUtils]: Spent 4077ms on a formula simplification. DAG size of input: 95 DAG size of output 70 [2018-04-09 19:52:15,148 WARN L151 SmtUtils]: Spent 2744ms on a formula simplification. DAG size of input: 88 DAG size of output 57 [2018-04-09 19:52:17,440 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 71 DAG size of output 37 [2018-04-09 19:52:36,459 WARN L151 SmtUtils]: Spent 4806ms on a formula simplification. DAG size of input: 92 DAG size of output 52 [2018-04-09 19:52:42,145 WARN L151 SmtUtils]: Spent 2736ms on a formula simplification. DAG size of input: 91 DAG size of output 27 [2018-04-09 19:52:46,599 WARN L151 SmtUtils]: Spent 4367ms on a formula simplification. DAG size of input: 99 DAG size of output 50 [2018-04-09 19:53:04,434 WARN L151 SmtUtils]: Spent 7780ms on a formula simplification. DAG size of input: 104 DAG size of output 68 [2018-04-09 19:53:06,396 WARN L151 SmtUtils]: Spent 1861ms on a formula simplification. DAG size of input: 92 DAG size of output 58 [2018-04-09 19:53:14,786 WARN L151 SmtUtils]: Spent 6083ms on a formula simplification. DAG size of input: 72 DAG size of output 40 [2018-04-09 19:53:30,560 WARN L151 SmtUtils]: Spent 5853ms on a formula simplification. DAG size of input: 94 DAG size of output 54 [2018-04-09 19:53:34,248 WARN L151 SmtUtils]: Spent 3080ms on a formula simplification. DAG size of input: 93 DAG size of output 29 [2018-04-09 19:53:40,826 WARN L151 SmtUtils]: Spent 6486ms on a formula simplification. DAG size of input: 101 DAG size of output 50 [2018-04-09 19:53:57,191 WARN L151 SmtUtils]: Spent 12185ms on a formula simplification. DAG size of input: 97 DAG size of output 46 [2018-04-09 19:54:00,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:54:00,527 INFO L93 Difference]: Finished difference Result 257 states and 271 transitions. [2018-04-09 19:54:00,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-09 19:54:00,528 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 79 [2018-04-09 19:54:00,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:54:00,529 INFO L225 Difference]: With dead ends: 257 [2018-04-09 19:54:00,529 INFO L226 Difference]: Without dead ends: 256 [2018-04-09 19:54:00,529 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 80.9s TimeCoverageRelationStatistics Valid=855, Invalid=6279, Unknown=6, NotChecked=0, Total=7140 [2018-04-09 19:54:00,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-04-09 19:54:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 153. [2018-04-09 19:54:00,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-09 19:54:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2018-04-09 19:54:00,552 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 79 [2018-04-09 19:54:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:54:00,553 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2018-04-09 19:54:00,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-09 19:54:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2018-04-09 19:54:00,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-09 19:54:00,553 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:54:00,553 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-09 19:54:00,554 INFO L408 AbstractCegarLoop]: === Iteration 35 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:54:00,554 INFO L82 PathProgramCache]: Analyzing trace with hash -2101203768, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:54:00,559 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:54:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:54:00,590 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:54:00,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:54:00,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:00,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:54:00,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:00,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:54:00,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-09 19:54:00,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:54:00,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:54:00,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 19:54:00,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:00,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:54:00,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:54:00,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:54:00,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:00,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:54:00,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-09 19:54:00,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 19:54:00,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 19:54:00,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:00,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:54:00,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 19:54:00,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-09 19:54:00,860 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 28 treesize of output 22 [2018-04-09 19:54:00,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:54:00,869 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 22 treesize of output 31 [2018-04-09 19:54:00,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:54:00,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:54:00,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:54:00,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:66 [2018-04-09 19:54:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:54:01,457 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:54:02,748 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 29 treesize of output 25 [2018-04-09 19:54:02,763 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 19:54:02,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-09 19:54:02,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:02,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:54:02,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:54:02,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:61 [2018-04-09 19:54:03,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-04-09 19:54:03,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:03,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 24 [2018-04-09 19:54:03,144 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 12 treesize of output 3 [2018-04-09 19:54:03,144 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:03,149 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:54:03,161 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 27 treesize of output 21 [2018-04-09 19:54:03,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:03,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 24 [2018-04-09 19:54:03,187 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 12 treesize of output 3 [2018-04-09 19:54:03,187 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:03,191 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:54:03,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:54:03,202 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-09 19:54:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:54:03,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:54:03,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2018-04-09 19:54:03,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-09 19:54:03,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-09 19:54:03,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=4196, Unknown=0, NotChecked=0, Total=4422 [2018-04-09 19:54:03,303 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand 67 states. [2018-04-09 19:54:08,386 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 107 DAG size of output 97 [2018-04-09 19:54:10,368 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 99 DAG size of output 96 [2018-04-09 19:54:11,269 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 101 DAG size of output 96 [2018-04-09 19:54:13,513 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 93 DAG size of output 88 [2018-04-09 19:54:15,216 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 94 DAG size of output 89 [2018-04-09 19:54:16,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:54:16,985 INFO L93 Difference]: Finished difference Result 252 states and 267 transitions. [2018-04-09 19:54:17,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-09 19:54:17,007 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 83 [2018-04-09 19:54:17,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:54:17,008 INFO L225 Difference]: With dead ends: 252 [2018-04-09 19:54:17,008 INFO L226 Difference]: Without dead ends: 251 [2018-04-09 19:54:17,008 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5649 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=1789, Invalid=22081, Unknown=0, NotChecked=0, Total=23870 [2018-04-09 19:54:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-04-09 19:54:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 154. [2018-04-09 19:54:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-09 19:54:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-04-09 19:54:17,032 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 83 [2018-04-09 19:54:17,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:54:17,032 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-04-09 19:54:17,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-09 19:54:17,032 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-04-09 19:54:17,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-09 19:54:17,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:54:17,033 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:54:17,033 INFO L408 AbstractCegarLoop]: === Iteration 36 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:54:17,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1531131323, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:54:17,039 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:54:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:54:17,068 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:54:17,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:54:17,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:17,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:54:17,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:17,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:54:17,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-09 19:54:17,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:54:17,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:54:17,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 19:54:17,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:17,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:54:17,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:54:17,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:54:17,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:17,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:54:17,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-09 19:54:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:54:17,652 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:54:18,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, 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 1 [2018-04-09 19:54:18,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:18,798 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-09 19:54:18,806 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 12 treesize of output 3 [2018-04-09 19:54:18,806 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:18,807 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 19:54:18,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:18,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:54:18,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:54:18,813 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-09 19:54:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:54:18,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:54:18,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-04-09 19:54:18,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-09 19:54:18,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-09 19:54:18,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=3774, Unknown=0, NotChecked=0, Total=4032 [2018-04-09 19:54:18,923 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 64 states. [2018-04-09 19:54:23,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:54:23,968 INFO L93 Difference]: Finished difference Result 266 states and 283 transitions. [2018-04-09 19:54:23,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-09 19:54:23,969 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 84 [2018-04-09 19:54:23,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:54:23,969 INFO L225 Difference]: With dead ends: 266 [2018-04-09 19:54:23,970 INFO L226 Difference]: Without dead ends: 265 [2018-04-09 19:54:23,970 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3165 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1859, Invalid=15171, Unknown=0, NotChecked=0, Total=17030 [2018-04-09 19:54:23,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-04-09 19:54:24,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 199. [2018-04-09 19:54:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-09 19:54:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 211 transitions. [2018-04-09 19:54:24,023 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 211 transitions. Word has length 84 [2018-04-09 19:54:24,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:54:24,023 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 211 transitions. [2018-04-09 19:54:24,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-09 19:54:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 211 transitions. [2018-04-09 19:54:24,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-04-09 19:54:24,024 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:54:24,024 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2018-04-09 19:54:24,024 INFO L408 AbstractCegarLoop]: === Iteration 37 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:54:24,025 INFO L82 PathProgramCache]: Analyzing trace with hash 348487720, now seen corresponding path program 7 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:54:24,033 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:54:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:54:24,067 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:54:24,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:54:24,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:24,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:54:24,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:24,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:54:24,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-09 19:54:24,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:54:24,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:54:24,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 19:54:24,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:24,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:54:24,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:54:24,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:54:24,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:24,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:54:24,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-09 19:54:24,689 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:54:24,690 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:54:26,024 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 10 treesize of output 3 [2018-04-09 19:54:26,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:26,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 15 [2018-04-09 19:54:26,035 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 19:54:26,036 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:26,037 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 12 treesize of output 3 [2018-04-09 19:54:26,037 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 19:54:26,039 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:54:26,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:54:26,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-09 19:54:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:54:26,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:54:26,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2018-04-09 19:54:26,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-09 19:54:26,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-09 19:54:26,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=4186, Unknown=0, NotChecked=0, Total=4422 [2018-04-09 19:54:26,122 INFO L87 Difference]: Start difference. First operand 199 states and 211 transitions. Second operand 67 states. Received shutdown request... [2018-04-09 19:54:29,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-09 19:54:29,554 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 19:54:29,557 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 19:54:29,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 07:54:29 BoogieIcfgContainer [2018-04-09 19:54:29,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 19:54:29,558 INFO L168 Benchmark]: Toolchain (without parser) took 263003.03 ms. Allocated memory was 306.7 MB in the beginning and 474.0 MB in the end (delta: 167.2 MB). Free memory was 243.7 MB in the beginning and 345.3 MB in the end (delta: -101.5 MB). Peak memory consumption was 65.7 MB. Max. memory is 5.3 GB. [2018-04-09 19:54:29,559 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 306.7 MB. Free memory is still 268.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 19:54:29,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.76 ms. Allocated memory is still 306.7 MB. Free memory was 243.7 MB in the beginning and 219.7 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-09 19:54:29,559 INFO L168 Benchmark]: Boogie Preprocessor took 54.13 ms. Allocated memory is still 306.7 MB. Free memory was 219.7 MB in the beginning and 216.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-09 19:54:29,559 INFO L168 Benchmark]: RCFGBuilder took 572.12 ms. Allocated memory was 306.7 MB in the beginning and 466.6 MB in the end (delta: 159.9 MB). Free memory was 216.7 MB in the beginning and 400.6 MB in the end (delta: -183.9 MB). Peak memory consumption was 21.4 MB. Max. memory is 5.3 GB. [2018-04-09 19:54:29,560 INFO L168 Benchmark]: TraceAbstraction took 262044.33 ms. Allocated memory was 466.6 MB in the beginning and 474.0 MB in the end (delta: 7.3 MB). Free memory was 400.6 MB in the beginning and 345.3 MB in the end (delta: 55.3 MB). Peak memory consumption was 62.6 MB. Max. memory is 5.3 GB. [2018-04-09 19:54:29,561 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.24 ms. Allocated memory is still 306.7 MB. Free memory is still 268.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 328.76 ms. Allocated memory is still 306.7 MB. Free memory was 243.7 MB in the beginning and 219.7 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 54.13 ms. Allocated memory is still 306.7 MB. Free memory was 219.7 MB in the beginning and 216.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 572.12 ms. Allocated memory was 306.7 MB in the beginning and 466.6 MB in the end (delta: 159.9 MB). Free memory was 216.7 MB in the beginning and 400.6 MB in the end (delta: -183.9 MB). Peak memory consumption was 21.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 262044.33 ms. Allocated memory was 466.6 MB in the beginning and 474.0 MB in the end (delta: 7.3 MB). Free memory was 400.6 MB in the beginning and 345.3 MB in the end (delta: 55.3 MB). Peak memory consumption was 62.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (199states) and interpolant automaton (currently 52 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 114 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (199states) and interpolant automaton (currently 52 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 114 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 (199states) and interpolant automaton (currently 52 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 114 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (199states) and interpolant automaton (currently 52 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 114 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (199states) and interpolant automaton (currently 52 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 114 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (199states) and interpolant automaton (currently 52 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 114 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 (199states) and interpolant automaton (currently 52 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 114 known predicates. - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (199states) and interpolant automaton (currently 52 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 114 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 (199states) and interpolant automaton (currently 52 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 114 known predicates. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (199states) and interpolant automaton (currently 52 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 114 known predicates. - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (199states) and interpolant automaton (currently 52 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 114 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 89 locations, 11 error locations. TIMEOUT Result, 261.9s OverallTime, 37 OverallIterations, 6 TraceHistogramMax, 219.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2380 SDtfs, 8074 SDslu, 30998 SDs, 0 SdLazy, 27846 SolverSat, 1443 SolverUnsat, 42 SolverUnknown, 0 SolverNotchecked, 83.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4834 GetRequests, 2958 SyntacticMatches, 36 SemanticMatches, 1839 ConstructedPredicates, 40 IntricatePredicates, 0 DeprecatedPredicates, 34149 ImplicationChecksByTransitivity, 167.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=31, 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.6s AutomataMinimizationTime, 36 MinimizatonAttempts, 1336 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 39.9s InterpolantComputationTime, 1995 NumberOfCodeBlocks, 1995 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3916 ConstructedInterpolants, 712 QuantifiedInterpolants, 3469008 SizeOfPredicates, 806 NumberOfNonLiveVariables, 6154 ConjunctsInSsa, 1430 ConjunctsInUnsatCore, 74 InterpolantComputations, 38 PerfectInterpolantSequences, 16/1420 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/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_19-54-29-567.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_19-54-29-567.csv Completed graceful shutdown