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-1cf7e2d-m [2018-03-29 20:16:04,492 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-29 20:16:04,493 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-29 20:16:04,507 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-29 20:16:04,507 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-29 20:16:04,508 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-29 20:16:04,509 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-29 20:16:04,510 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-29 20:16:04,513 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-29 20:16:04,514 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-29 20:16:04,515 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-29 20:16:04,515 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-29 20:16:04,516 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-29 20:16:04,517 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-29 20:16:04,518 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-29 20:16:04,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-29 20:16:04,522 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-29 20:16:04,524 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-29 20:16:04,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-29 20:16:04,527 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-29 20:16:04,529 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-29 20:16:04,530 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-29 20:16:04,530 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-29 20:16:04,531 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-29 20:16:04,532 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-29 20:16:04,534 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-29 20:16:04,534 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-29 20:16:04,534 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-29 20:16:04,535 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-29 20:16:04,535 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-29 20:16:04,536 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-29 20:16:04,536 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-03-29 20:16:04,559 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-29 20:16:04,559 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-29 20:16:04,559 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-29 20:16:04,559 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-29 20:16:04,560 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-29 20:16:04,560 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-29 20:16:04,560 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-29 20:16:04,561 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-29 20:16:04,561 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-29 20:16:04,561 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-29 20:16:04,561 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-29 20:16:04,561 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-29 20:16:04,561 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-29 20:16:04,562 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-29 20:16:04,562 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-29 20:16:04,562 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-29 20:16:04,562 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-29 20:16:04,562 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-29 20:16:04,562 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-29 20:16:04,563 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-29 20:16:04,563 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-29 20:16:04,563 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-29 20:16:04,563 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-29 20:16:04,563 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-29 20:16:04,564 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-29 20:16:04,564 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-29 20:16:04,564 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-29 20:16:04,564 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-29 20:16:04,564 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-29 20:16:04,564 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-29 20:16:04,565 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-29 20:16:04,565 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:16:04,565 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-29 20:16:04,566 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-29 20:16:04,566 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-29 20:16:04,566 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-29 20:16:04,566 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-29 20:16:04,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-29 20:16:04,612 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-29 20:16:04,615 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-29 20:16:04,616 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-29 20:16:04,617 INFO L276 PluginConnector]: CDTParser initialized [2018-03-29 20:16:04,617 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-03-29 20:16:04,927 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc7fd120c3 [2018-03-29 20:16:05,107 INFO L287 CDTParser]: IsIndexed: true [2018-03-29 20:16:05,107 INFO L288 CDTParser]: Found 1 translation units. [2018-03-29 20:16:05,107 INFO L168 CDTParser]: Scanning cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:16:05,119 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-29 20:16:05,119 INFO L215 ultiparseSymbolTable]: [2018-03-29 20:16:05,119 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-29 20:16:05,120 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-03-29 20:16:05,120 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:16:05,120 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-03-29 20:16:05,120 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-03-29 20:16:05,120 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-29 20:16:05,120 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-03-29 20:16:05,120 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-03-29 20:16:05,120 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-03-29 20:16:05,121 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-03-29 20:16:05,121 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-03-29 20:16:05,121 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-03-29 20:16:05,121 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-03-29 20:16:05,121 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-03-29 20:16:05,121 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-03-29 20:16:05,121 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-03-29 20:16:05,121 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-03-29 20:16:05,121 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-03-29 20:16:05,121 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-03-29 20:16:05,121 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-03-29 20:16:05,121 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-03-29 20:16:05,121 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-03-29 20:16:05,121 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-03-29 20:16:05,122 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-03-29 20:16:05,122 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-03-29 20:16:05,122 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-03-29 20:16:05,122 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-03-29 20:16:05,122 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-03-29 20:16:05,122 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-03-29 20:16:05,122 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-03-29 20:16:05,122 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-03-29 20:16:05,122 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-03-29 20:16:05,122 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-03-29 20:16:05,122 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-03-29 20:16:05,122 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-03-29 20:16:05,122 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-03-29 20:16:05,123 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-03-29 20:16:05,123 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-03-29 20:16:05,123 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-03-29 20:16:05,123 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-03-29 20:16:05,123 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-03-29 20:16:05,123 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-03-29 20:16:05,123 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-03-29 20:16:05,123 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-03-29 20:16:05,123 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-03-29 20:16:05,123 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-03-29 20:16:05,123 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-03-29 20:16:05,123 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-03-29 20:16:05,124 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-03-29 20:16:05,124 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-03-29 20:16:05,124 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-03-29 20:16:05,124 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-03-29 20:16:05,124 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-03-29 20:16:05,124 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-03-29 20:16:05,124 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-03-29 20:16:05,124 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-03-29 20:16:05,124 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-03-29 20:16:05,124 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-03-29 20:16:05,124 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-03-29 20:16:05,124 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-03-29 20:16:05,124 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-03-29 20:16:05,125 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-03-29 20:16:05,125 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-03-29 20:16:05,125 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-03-29 20:16:05,125 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-03-29 20:16:05,125 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-03-29 20:16:05,125 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-03-29 20:16:05,125 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-03-29 20:16:05,125 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-03-29 20:16:05,126 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-03-29 20:16:05,126 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-03-29 20:16:05,126 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-03-29 20:16:05,126 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-03-29 20:16:05,126 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-03-29 20:16:05,126 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-03-29 20:16:05,126 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-03-29 20:16:05,126 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-03-29 20:16:05,126 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-03-29 20:16:05,127 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-03-29 20:16:05,127 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-03-29 20:16:05,127 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-03-29 20:16:05,127 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-03-29 20:16:05,127 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-03-29 20:16:05,127 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-03-29 20:16:05,127 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-03-29 20:16:05,127 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-03-29 20:16:05,128 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-03-29 20:16:05,128 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-03-29 20:16:05,128 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-03-29 20:16:05,128 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-03-29 20:16:05,128 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-03-29 20:16:05,128 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-03-29 20:16:05,128 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-03-29 20:16:05,128 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-03-29 20:16:05,129 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-03-29 20:16:05,129 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-03-29 20:16:05,129 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-03-29 20:16:05,129 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-03-29 20:16:05,129 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-03-29 20:16:05,129 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-03-29 20:16:05,129 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-03-29 20:16:05,129 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-03-29 20:16:05,129 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-03-29 20:16:05,130 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-03-29 20:16:05,130 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-03-29 20:16:05,130 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-03-29 20:16:05,130 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-03-29 20:16:05,130 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-03-29 20:16:05,130 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-03-29 20:16:05,130 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-03-29 20:16:05,131 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-03-29 20:16:05,131 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-03-29 20:16:05,131 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-03-29 20:16:05,131 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-03-29 20:16:05,131 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-03-29 20:16:05,131 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-03-29 20:16:05,131 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-03-29 20:16:05,131 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-03-29 20:16:05,132 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-03-29 20:16:05,132 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-03-29 20:16:05,132 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-03-29 20:16:05,132 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-03-29 20:16:05,132 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-03-29 20:16:05,132 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-03-29 20:16:05,132 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-03-29 20:16:05,132 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-03-29 20:16:05,149 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc7fd120c3 [2018-03-29 20:16:05,153 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-29 20:16:05,156 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-29 20:16:05,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-29 20:16:05,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-29 20:16:05,163 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-29 20:16:05,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 08:16:05" (1/1) ... [2018-03-29 20:16:05,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d61a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:16:05, skipping insertion in model container [2018-03-29 20:16:05,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 08:16:05" (1/1) ... [2018-03-29 20:16:05,180 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 20:16:05,210 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 20:16:05,401 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 20:16:05,455 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 20:16:05,462 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-03-29 20:16:05,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:16:05 WrapperNode [2018-03-29 20:16:05,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-29 20:16:05,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-29 20:16:05,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-29 20:16:05,512 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-29 20:16:05,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:16:05" (1/1) ... [2018-03-29 20:16:05,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:16:05" (1/1) ... [2018-03-29 20:16:05,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:16:05" (1/1) ... [2018-03-29 20:16:05,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:16:05" (1/1) ... [2018-03-29 20:16:05,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:16:05" (1/1) ... [2018-03-29 20:16:05,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:16:05" (1/1) ... [2018-03-29 20:16:05,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:16:05" (1/1) ... [2018-03-29 20:16:05,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-29 20:16:05,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-29 20:16:05,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-29 20:16:05,567 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-29 20:16:05,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:16:05" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-29 20:16:05,699 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-29 20:16:05,699 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-29 20:16:05,699 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-03-29 20:16:05,699 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-03-29 20:16:05,699 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-03-29 20:16:05,699 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-29 20:16:05,700 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-03-29 20:16:05,700 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-03-29 20:16:05,700 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-03-29 20:16:05,700 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-03-29 20:16:05,700 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-03-29 20:16:05,700 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-03-29 20:16:05,701 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-03-29 20:16:05,701 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-03-29 20:16:05,701 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-03-29 20:16:05,701 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-03-29 20:16:05,701 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-03-29 20:16:05,701 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-03-29 20:16:05,702 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-03-29 20:16:05,702 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-03-29 20:16:05,702 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-03-29 20:16:05,702 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-03-29 20:16:05,702 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-03-29 20:16:05,702 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-03-29 20:16:05,703 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-03-29 20:16:05,703 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-03-29 20:16:05,703 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-03-29 20:16:05,703 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-03-29 20:16:05,703 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-03-29 20:16:05,703 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-03-29 20:16:05,704 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-03-29 20:16:05,704 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-03-29 20:16:05,704 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-03-29 20:16:05,704 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-03-29 20:16:05,704 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-03-29 20:16:05,704 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-03-29 20:16:05,704 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-03-29 20:16:05,705 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-03-29 20:16:05,705 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-03-29 20:16:05,705 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-03-29 20:16:05,705 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-03-29 20:16:05,705 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-03-29 20:16:05,705 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-03-29 20:16:05,705 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-03-29 20:16:05,705 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-03-29 20:16:05,706 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-03-29 20:16:05,706 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-03-29 20:16:05,706 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-03-29 20:16:05,706 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-03-29 20:16:05,706 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-03-29 20:16:05,706 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-03-29 20:16:05,706 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-03-29 20:16:05,707 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-03-29 20:16:05,707 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-03-29 20:16:05,707 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-03-29 20:16:05,707 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-03-29 20:16:05,707 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-03-29 20:16:05,707 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-03-29 20:16:05,707 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-29 20:16:05,707 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-03-29 20:16:05,708 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-03-29 20:16:05,708 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-29 20:16:05,708 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-03-29 20:16:05,708 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-03-29 20:16:05,708 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-03-29 20:16:05,708 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-03-29 20:16:05,708 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-03-29 20:16:05,709 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-03-29 20:16:05,709 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-03-29 20:16:05,709 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-03-29 20:16:05,709 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-03-29 20:16:05,709 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-03-29 20:16:05,709 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-03-29 20:16:05,709 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-03-29 20:16:05,709 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-03-29 20:16:05,710 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-03-29 20:16:05,710 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-03-29 20:16:05,710 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-03-29 20:16:05,710 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-03-29 20:16:05,710 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-03-29 20:16:05,710 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-03-29 20:16:05,710 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-03-29 20:16:05,711 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-03-29 20:16:05,711 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-03-29 20:16:05,711 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-03-29 20:16:05,711 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-03-29 20:16:05,711 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-03-29 20:16:05,711 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-03-29 20:16:05,711 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-03-29 20:16:05,711 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-03-29 20:16:05,712 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-03-29 20:16:05,712 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-03-29 20:16:05,712 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-03-29 20:16:05,712 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-03-29 20:16:05,712 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-03-29 20:16:05,712 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-03-29 20:16:05,712 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-03-29 20:16:05,713 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-03-29 20:16:05,713 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-03-29 20:16:05,713 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-03-29 20:16:05,713 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-03-29 20:16:05,713 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-03-29 20:16:05,713 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-03-29 20:16:05,713 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-03-29 20:16:05,713 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-03-29 20:16:05,714 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-03-29 20:16:05,714 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-03-29 20:16:05,714 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-03-29 20:16:05,714 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-03-29 20:16:05,714 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-03-29 20:16:05,714 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-29 20:16:05,714 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-29 20:16:05,714 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-29 20:16:05,715 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-29 20:16:05,715 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-29 20:16:05,715 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-29 20:16:05,715 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-29 20:16:05,715 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-29 20:16:06,090 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-29 20:16:06,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 08:16:06 BoogieIcfgContainer [2018-03-29 20:16:06,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-29 20:16:06,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-29 20:16:06,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-29 20:16:06,094 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-29 20:16:06,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 08:16:05" (1/3) ... [2018-03-29 20:16:06,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f84b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 08:16:06, skipping insertion in model container [2018-03-29 20:16:06,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:16:05" (2/3) ... [2018-03-29 20:16:06,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f84b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 08:16:06, skipping insertion in model container [2018-03-29 20:16:06,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 08:16:06" (3/3) ... [2018-03-29 20:16:06,097 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:16:06,105 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-29 20:16:06,112 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-03-29 20:16:06,150 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-29 20:16:06,151 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-29 20:16:06,151 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-29 20:16:06,151 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-29 20:16:06,151 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-29 20:16:06,151 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-29 20:16:06,151 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-29 20:16:06,151 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-29 20:16:06,151 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-29 20:16:06,152 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-29 20:16:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-03-29 20:16:06,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-29 20:16:06,174 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:06,175 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-03-29 20:16:06,175 INFO L408 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:06,181 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-03-29 20:16:06,193 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:06,227 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:06,260 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:06,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:06,298 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:06,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-03-29 20:16:06,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-29 20:16:06,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-29 20:16:06,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-29 20:16:06,311 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states. [2018-03-29 20:16:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:06,406 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-03-29 20:16:06,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-29 20:16:06,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-03-29 20:16:06,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:06,418 INFO L225 Difference]: With dead ends: 112 [2018-03-29 20:16:06,418 INFO L226 Difference]: Without dead ends: 75 [2018-03-29 20:16:06,422 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-03-29 20:16:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-03-29 20:16:06,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-03-29 20:16:06,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-03-29 20:16:06,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-03-29 20:16:06,457 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 21 [2018-03-29 20:16:06,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:06,457 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-03-29 20:16:06,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-29 20:16:06,457 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-03-29 20:16:06,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-03-29 20:16:06,458 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:06,458 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-03-29 20:16:06,458 INFO L408 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:06,459 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-03-29 20:16:06,474 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:06,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:06,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:06,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:06,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:06,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:06,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:06,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-03-29 20:16:06,622 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:06,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-29 20:16:06,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:06,638 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:06,639 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:06,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:16:06,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:06,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:06,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-03-29 20:16:06,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:06,677 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:06,851 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:06,851 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-03-29 20:16:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:06,885 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:06,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-03-29 20:16:06,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-29 20:16:06,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-29 20:16:06,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-03-29 20:16:06,888 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 9 states. [2018-03-29 20:16:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:07,088 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-03-29 20:16:07,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 20:16:07,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-03-29 20:16:07,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:07,091 INFO L225 Difference]: With dead ends: 75 [2018-03-29 20:16:07,091 INFO L226 Difference]: Without dead ends: 73 [2018-03-29 20:16:07,093 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-03-29 20:16:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-03-29 20:16:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-03-29 20:16:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-03-29 20:16:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-03-29 20:16:07,102 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 24 [2018-03-29 20:16:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:07,103 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-03-29 20:16:07,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-29 20:16:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-03-29 20:16:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-03-29 20:16:07,104 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:07,104 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-03-29 20:16:07,105 INFO L408 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:07,105 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-03-29 20:16:07,116 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:07,145 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:07,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:07,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:07,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:07,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 20:16:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:07,179 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:07,213 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:07,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-29 20:16:07,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-29 20:16:07,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-29 20:16:07,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-29 20:16:07,214 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2018-03-29 20:16:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:07,249 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-03-29 20:16:07,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-29 20:16:07,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-03-29 20:16:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:07,251 INFO L225 Difference]: With dead ends: 73 [2018-03-29 20:16:07,251 INFO L226 Difference]: Without dead ends: 72 [2018-03-29 20:16:07,251 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-03-29 20:16:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-03-29 20:16:07,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-03-29 20:16:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-03-29 20:16:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-03-29 20:16:07,259 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 25 [2018-03-29 20:16:07,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:07,260 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-03-29 20:16:07,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-29 20:16:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-03-29 20:16:07,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-03-29 20:16:07,261 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:07,261 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-03-29 20:16:07,261 INFO L408 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:07,261 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-03-29 20:16:07,272 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:07,287 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:07,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:07,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:07,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:07,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-03-29 20:16:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:07,349 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:07,404 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:07,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-03-29 20:16:07,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-29 20:16:07,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-29 20:16:07,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-03-29 20:16:07,405 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 8 states. [2018-03-29 20:16:07,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:07,544 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-03-29 20:16:07,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-29 20:16:07,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-03-29 20:16:07,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:07,545 INFO L225 Difference]: With dead ends: 72 [2018-03-29 20:16:07,545 INFO L226 Difference]: Without dead ends: 71 [2018-03-29 20:16:07,546 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-03-29 20:16:07,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-03-29 20:16:07,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-03-29 20:16:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-03-29 20:16:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-03-29 20:16:07,553 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 25 [2018-03-29 20:16:07,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:07,554 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-03-29 20:16:07,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-29 20:16:07,554 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-03-29 20:16:07,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-03-29 20:16:07,555 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:07,555 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-03-29 20:16:07,555 INFO L408 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:07,555 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-03-29 20:16:07,573 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:07,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:07,607 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:07,636 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:07,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-03-29 20:16:07,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 20:16:07,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 20:16:07,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-29 20:16:07,637 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2018-03-29 20:16:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:07,726 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-03-29 20:16:07,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 20:16:07,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-03-29 20:16:07,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:07,727 INFO L225 Difference]: With dead ends: 78 [2018-03-29 20:16:07,727 INFO L226 Difference]: Without dead ends: 77 [2018-03-29 20:16:07,727 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-03-29 20:16:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-03-29 20:16:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-03-29 20:16:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-03-29 20:16:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-03-29 20:16:07,732 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 31 [2018-03-29 20:16:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:07,732 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-03-29 20:16:07,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 20:16:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-03-29 20:16:07,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-03-29 20:16:07,733 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:07,733 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-03-29 20:16:07,733 INFO L408 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:07,733 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-03-29 20:16:07,742 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:07,760 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:07,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:07,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:07,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:07,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-03-29 20:16:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:07,812 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:07,908 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:07,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2018-03-29 20:16:07,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-03-29 20:16:07,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-03-29 20:16:07,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-03-29 20:16:07,909 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 14 states. [2018-03-29 20:16:08,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:08,089 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-03-29 20:16:08,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-29 20:16:08,089 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-03-29 20:16:08,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:08,090 INFO L225 Difference]: With dead ends: 85 [2018-03-29 20:16:08,090 INFO L226 Difference]: Without dead ends: 84 [2018-03-29 20:16:08,091 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-03-29 20:16:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-03-29 20:16:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2018-03-29 20:16:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-03-29 20:16:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-03-29 20:16:08,096 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 31 [2018-03-29 20:16:08,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:08,096 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-03-29 20:16:08,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-03-29 20:16:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-03-29 20:16:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-03-29 20:16:08,097 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:08,097 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-03-29 20:16:08,097 INFO L408 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:08,098 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-03-29 20:16:08,104 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:08,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-29 20:16:08,162 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:08,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-29 20:16:08,190 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:08,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-03-29 20:16:08,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-29 20:16:08,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-29 20:16:08,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-03-29 20:16:08,192 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 7 states. [2018-03-29 20:16:08,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:08,280 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-03-29 20:16:08,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-29 20:16:08,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-03-29 20:16:08,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:08,281 INFO L225 Difference]: With dead ends: 76 [2018-03-29 20:16:08,282 INFO L226 Difference]: Without dead ends: 75 [2018-03-29 20:16:08,282 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-03-29 20:16:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-03-29 20:16:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-03-29 20:16:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-03-29 20:16:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-03-29 20:16:08,289 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 38 [2018-03-29 20:16:08,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:08,289 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-03-29 20:16:08,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-29 20:16:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-03-29 20:16:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-03-29 20:16:08,291 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:08,291 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-03-29 20:16:08,291 INFO L408 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:08,291 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-03-29 20:16:08,298 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:08,318 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:08,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:08,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:08,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:08,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-03-29 20:16:08,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:08,401 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:08,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:08,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:16:08,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-03-29 20:16:08,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-03-29 20:16:08,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-03-29 20:16:08,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-03-29 20:16:08,540 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 19 states. [2018-03-29 20:16:08,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:08,882 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-03-29 20:16:08,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-29 20:16:08,882 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-03-29 20:16:08,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:08,884 INFO L225 Difference]: With dead ends: 95 [2018-03-29 20:16:08,885 INFO L226 Difference]: Without dead ends: 94 [2018-03-29 20:16:08,885 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-03-29 20:16:08,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-03-29 20:16:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2018-03-29 20:16:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-03-29 20:16:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-03-29 20:16:08,892 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 38 [2018-03-29 20:16:08,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:08,892 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-03-29 20:16:08,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-03-29 20:16:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-03-29 20:16:08,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-03-29 20:16:08,894 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:08,894 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:16:08,894 INFO L408 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:08,894 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-03-29 20:16:08,903 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:08,921 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:08,938 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:08,969 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:08,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-03-29 20:16:08,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 20:16:08,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 20:16:08,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-29 20:16:08,970 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2018-03-29 20:16:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:09,041 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-03-29 20:16:09,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 20:16:09,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-03-29 20:16:09,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:09,042 INFO L225 Difference]: With dead ends: 79 [2018-03-29 20:16:09,043 INFO L226 Difference]: Without dead ends: 78 [2018-03-29 20:16:09,043 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-03-29 20:16:09,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-03-29 20:16:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-03-29 20:16:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-03-29 20:16:09,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-03-29 20:16:09,051 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-03-29 20:16:09,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:09,051 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-03-29 20:16:09,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 20:16:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-03-29 20:16:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-03-29 20:16:09,052 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:09,052 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:16:09,052 INFO L408 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:09,052 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-03-29 20:16:09,061 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:09,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:09,151 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:09,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-03-29 20:16:09,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:09,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-03-29 20:16:09,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:09,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:09,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-03-29 20:16:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:09,223 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:09,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-03-29 20:16:09,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-29 20:16:09,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-29 20:16:09,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-03-29 20:16:09,224 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 9 states. [2018-03-29 20:16:09,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:09,417 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-03-29 20:16:09,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:16:09,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-03-29 20:16:09,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:09,418 INFO L225 Difference]: With dead ends: 85 [2018-03-29 20:16:09,418 INFO L226 Difference]: Without dead ends: 84 [2018-03-29 20:16:09,419 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-03-29 20:16:09,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-03-29 20:16:09,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-03-29 20:16:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-03-29 20:16:09,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-03-29 20:16:09,425 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 39 [2018-03-29 20:16:09,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:09,426 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-03-29 20:16:09,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-29 20:16:09,426 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-03-29 20:16:09,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-03-29 20:16:09,427 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:09,427 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:16:09,427 INFO L408 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:09,427 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-03-29 20:16:09,435 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:09,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:09,481 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:09,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:09,506 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:09,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-03-29 20:16:09,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-29 20:16:09,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-29 20:16:09,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-03-29 20:16:09,507 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 7 states. [2018-03-29 20:16:09,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:09,628 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-03-29 20:16:09,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-29 20:16:09,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-03-29 20:16:09,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:09,628 INFO L225 Difference]: With dead ends: 84 [2018-03-29 20:16:09,629 INFO L226 Difference]: Without dead ends: 83 [2018-03-29 20:16:09,629 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-03-29 20:16:09,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-03-29 20:16:09,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-03-29 20:16:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-03-29 20:16:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-03-29 20:16:09,636 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 40 [2018-03-29 20:16:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:09,636 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-03-29 20:16:09,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-29 20:16:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-03-29 20:16:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-03-29 20:16:09,638 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:09,638 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:16:09,638 INFO L408 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:09,638 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-03-29 20:16:09,653 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:09,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:09,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:09,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:09,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:09,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-03-29 20:16:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:09,782 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:09,897 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:09,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2018-03-29 20:16:09,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-03-29 20:16:09,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-03-29 20:16:09,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-03-29 20:16:09,898 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 18 states. [2018-03-29 20:16:10,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:10,197 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-03-29 20:16:10,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-03-29 20:16:10,198 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-03-29 20:16:10,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:10,200 INFO L225 Difference]: With dead ends: 110 [2018-03-29 20:16:10,200 INFO L226 Difference]: Without dead ends: 109 [2018-03-29 20:16:10,200 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-03-29 20:16:10,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-03-29 20:16:10,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2018-03-29 20:16:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-03-29 20:16:10,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-03-29 20:16:10,207 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 40 [2018-03-29 20:16:10,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:10,207 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-03-29 20:16:10,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-03-29 20:16:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-03-29 20:16:10,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-03-29 20:16:10,208 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:10,208 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-03-29 20:16:10,208 INFO L408 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:10,208 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-03-29 20:16:10,214 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:10,232 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:10,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:10,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:10,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:10,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-03-29 20:16:10,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-03-29 20:16:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-29 20:16:10,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:10,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:10,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 20:16:10,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-03-29 20:16:10,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-03-29 20:16:10,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-03-29 20:16:10,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:16:10,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:10,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:10,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35 [2018-03-29 20:16:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:10,559 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:10,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-03-29 20:16:10,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-03-29 20:16:10,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:10,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:10,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:10,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:38 [2018-03-29 20:16:10,969 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:11,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:16:11,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-03-29 20:16:11,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-03-29 20:16:11,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-03-29 20:16:11,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2018-03-29 20:16:11,006 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 31 states. [2018-03-29 20:16:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:12,190 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-03-29 20:16:12,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-03-29 20:16:12,191 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-03-29 20:16:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:12,191 INFO L225 Difference]: With dead ends: 124 [2018-03-29 20:16:12,192 INFO L226 Difference]: Without dead ends: 123 [2018-03-29 20:16:12,192 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-03-29 20:16:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-03-29 20:16:12,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2018-03-29 20:16:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-03-29 20:16:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-03-29 20:16:12,198 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 45 [2018-03-29 20:16:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:12,198 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-03-29 20:16:12,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-03-29 20:16:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-03-29 20:16:12,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-03-29 20:16:12,199 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:12,199 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-03-29 20:16:12,199 INFO L408 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:12,199 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-03-29 20:16:12,205 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:12,224 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:12,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:12,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:12,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:12,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 20:16:12,275 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:12,276 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:12,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:16:12,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:12,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:12,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-03-29 20:16:12,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-03-29 20:16:12,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-29 20:16:12,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:12,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:12,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 20:16:12,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-03-29 20:16:12,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-03-29 20:16:12,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-29 20:16:12,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:12,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:12,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-03-29 20:16:12,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-03-29 20:16:12,535 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-03-29 20:16:12,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-03-29 20:16:12,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:12,548 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-03-29 20:16:12,549 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-03-29 20:16:12,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:12,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:12,563 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-03-29 20:16:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:12,627 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:12,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-03-29 20:16:12,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:12,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-03-29 20:16:12,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-03-29 20:16:12,873 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:12,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:12,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:12,880 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-03-29 20:16:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:12,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:16:12,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-03-29 20:16:12,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-03-29 20:16:12,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-03-29 20:16:12,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-03-29 20:16:12,943 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 25 states. [2018-03-29 20:16:13,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:13,645 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2018-03-29 20:16:13,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-03-29 20:16:13,645 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-03-29 20:16:13,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:13,646 INFO L225 Difference]: With dead ends: 130 [2018-03-29 20:16:13,646 INFO L226 Difference]: Without dead ends: 129 [2018-03-29 20:16:13,646 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=1421, Unknown=0, NotChecked=0, Total=1640 [2018-03-29 20:16:13,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-03-29 20:16:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2018-03-29 20:16:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-03-29 20:16:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-03-29 20:16:13,654 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 50 [2018-03-29 20:16:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:13,654 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-03-29 20:16:13,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-03-29 20:16:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-03-29 20:16:13,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-03-29 20:16:13,655 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:13,655 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-03-29 20:16:13,655 INFO L408 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:13,655 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-03-29 20:16:13,661 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:13,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:13,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:13,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:13,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:13,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-03-29 20:16:13,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-03-29 20:16:13,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-29 20:16:13,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:13,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:13,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 20:16:13,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-03-29 20:16:13,881 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-03-29 20:16:13,883 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:13,889 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-03-29 20:16:13,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:16:13,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:13,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:13,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2018-03-29 20:16:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:14,053 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:14,544 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-03-29 20:16:14,559 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:16:14,560 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-03-29 20:16:14,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:14,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:14,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:14,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:54 [2018-03-29 20:16:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:14,782 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:16:14,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-03-29 20:16:14,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-03-29 20:16:14,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-03-29 20:16:14,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1356, Unknown=0, NotChecked=0, Total=1482 [2018-03-29 20:16:14,783 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 39 states. [2018-03-29 20:16:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:18,732 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2018-03-29 20:16:18,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-03-29 20:16:18,733 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-03-29 20:16:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:18,734 INFO L225 Difference]: With dead ends: 148 [2018-03-29 20:16:18,734 INFO L226 Difference]: Without dead ends: 147 [2018-03-29 20:16:18,735 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=593, Invalid=4377, Unknown=0, NotChecked=0, Total=4970 [2018-03-29 20:16:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-03-29 20:16:18,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2018-03-29 20:16:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-03-29 20:16:18,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-03-29 20:16:18,744 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 52 [2018-03-29 20:16:18,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:18,744 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-03-29 20:16:18,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-03-29 20:16:18,744 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-03-29 20:16:18,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-03-29 20:16:18,744 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:18,745 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-03-29 20:16:18,745 INFO L408 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:18,745 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-03-29 20:16:18,751 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:18,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:18,795 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:18,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-03-29 20:16:18,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-03-29 20:16:18,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:18,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:18,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-29 20:16:18,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:16:18,834 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-03-29 20:16:18,841 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-03-29 20:16:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:18,848 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:18,869 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-03-29 20:16:18,873 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-03-29 20:16:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:18,921 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:18,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:16:18,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:16:18,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:16:18,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:16:18,922 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 12 states. [2018-03-29 20:16:18,933 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-03-29 20:16:19,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:19,310 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions. [2018-03-29 20:16:19,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:16:19,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-03-29 20:16:19,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:19,312 INFO L225 Difference]: With dead ends: 249 [2018-03-29 20:16:19,312 INFO L226 Difference]: Without dead ends: 235 [2018-03-29 20:16:19,312 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-03-29 20:16:19,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-03-29 20:16:19,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-03-29 20:16:19,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-03-29 20:16:19,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 252 transitions. [2018-03-29 20:16:19,327 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 252 transitions. Word has length 54 [2018-03-29 20:16:19,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:19,328 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 252 transitions. [2018-03-29 20:16:19,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:16:19,328 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 252 transitions. [2018-03-29 20:16:19,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-03-29 20:16:19,329 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:19,329 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-03-29 20:16:19,329 INFO L408 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:19,329 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-03-29 20:16:19,346 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:19,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:19,411 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:19,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-03-29 20:16:19,416 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:19,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-03-29 20:16:19,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:19,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:19,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-29 20:16:19,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:16:19,469 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-03-29 20:16:19,473 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-03-29 20:16:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:19,484 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:19,521 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-03-29 20:16:19,525 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-03-29 20:16:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:19,572 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:19,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:16:19,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:16:19,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:16:19,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:16:19,573 INFO L87 Difference]: Start difference. First operand 232 states and 252 transitions. Second operand 12 states. [2018-03-29 20:16:19,580 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-03-29 20:16:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:19,848 INFO L93 Difference]: Finished difference Result 346 states and 374 transitions. [2018-03-29 20:16:19,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:16:19,849 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-03-29 20:16:19,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:19,851 INFO L225 Difference]: With dead ends: 346 [2018-03-29 20:16:19,851 INFO L226 Difference]: Without dead ends: 332 [2018-03-29 20:16:19,852 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-03-29 20:16:19,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-03-29 20:16:19,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 231. [2018-03-29 20:16:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-03-29 20:16:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 250 transitions. [2018-03-29 20:16:19,875 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 250 transitions. Word has length 55 [2018-03-29 20:16:19,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:19,875 INFO L459 AbstractCegarLoop]: Abstraction has 231 states and 250 transitions. [2018-03-29 20:16:19,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:16:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 250 transitions. [2018-03-29 20:16:19,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-03-29 20:16:19,877 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:19,877 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-03-29 20:16:19,877 INFO L408 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:19,877 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-03-29 20:16:19,886 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:19,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:19,933 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:19,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-03-29 20:16:19,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-03-29 20:16:19,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:19,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:19,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-29 20:16:19,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:16:19,973 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-03-29 20:16:19,977 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-03-29 20:16:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:19,984 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:20,002 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-03-29 20:16:20,006 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-03-29 20:16:20,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:20,053 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:20,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:16:20,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:16:20,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:16:20,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:16:20,054 INFO L87 Difference]: Start difference. First operand 231 states and 250 transitions. Second operand 12 states. [2018-03-29 20:16:20,066 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-03-29 20:16:20,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:20,328 INFO L93 Difference]: Finished difference Result 347 states and 375 transitions. [2018-03-29 20:16:20,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:16:20,328 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-03-29 20:16:20,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:20,330 INFO L225 Difference]: With dead ends: 347 [2018-03-29 20:16:20,330 INFO L226 Difference]: Without dead ends: 333 [2018-03-29 20:16:20,330 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-03-29 20:16:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-03-29 20:16:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 233. [2018-03-29 20:16:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-03-29 20:16:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 253 transitions. [2018-03-29 20:16:20,345 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 253 transitions. Word has length 55 [2018-03-29 20:16:20,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:20,345 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 253 transitions. [2018-03-29 20:16:20,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:16:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 253 transitions. [2018-03-29 20:16:20,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-03-29 20:16:20,346 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:20,346 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-03-29 20:16:20,346 INFO L408 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:20,346 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-03-29 20:16:20,353 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:20,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:20,396 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:20,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-03-29 20:16:20,399 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:20,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-03-29 20:16:20,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:20,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:20,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-29 20:16:20,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:16:20,453 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-03-29 20:16:20,458 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-03-29 20:16:20,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:20,469 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:20,489 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-03-29 20:16:20,492 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-03-29 20:16:20,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:20,532 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:20,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:16:20,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:16:20,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:16:20,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:16:20,533 INFO L87 Difference]: Start difference. First operand 233 states and 253 transitions. Second operand 12 states. [2018-03-29 20:16:20,544 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-03-29 20:16:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:20,918 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-03-29 20:16:20,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:16:20,918 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-03-29 20:16:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:20,920 INFO L225 Difference]: With dead ends: 348 [2018-03-29 20:16:20,920 INFO L226 Difference]: Without dead ends: 334 [2018-03-29 20:16:20,921 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-03-29 20:16:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-03-29 20:16:20,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 235. [2018-03-29 20:16:20,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-03-29 20:16:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions. [2018-03-29 20:16:20,947 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 55 [2018-03-29 20:16:20,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:20,947 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions. [2018-03-29 20:16:20,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:16:20,947 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions. [2018-03-29 20:16:20,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-03-29 20:16:20,948 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:20,949 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-03-29 20:16:20,949 INFO L408 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:20,949 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-03-29 20:16:20,957 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:20,980 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:21,014 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:21,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-03-29 20:16:21,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-03-29 20:16:21,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:21,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:21,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-29 20:16:21,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:16:21,069 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-03-29 20:16:21,072 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-03-29 20:16:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:21,078 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:21,094 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-03-29 20:16:21,097 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-03-29 20:16:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:21,133 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:21,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:16:21,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:16:21,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:16:21,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:16:21,134 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand 12 states. [2018-03-29 20:16:21,151 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-03-29 20:16:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:21,450 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-03-29 20:16:21,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:16:21,451 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-03-29 20:16:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:21,452 INFO L225 Difference]: With dead ends: 348 [2018-03-29 20:16:21,452 INFO L226 Difference]: Without dead ends: 334 [2018-03-29 20:16:21,453 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-03-29 20:16:21,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-03-29 20:16:21,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 233. [2018-03-29 20:16:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-03-29 20:16:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 253 transitions. [2018-03-29 20:16:21,469 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 253 transitions. Word has length 56 [2018-03-29 20:16:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:21,469 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 253 transitions. [2018-03-29 20:16:21,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:16:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 253 transitions. [2018-03-29 20:16:21,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-03-29 20:16:21,470 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:21,470 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-03-29 20:16:21,470 INFO L408 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:21,470 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-03-29 20:16:21,477 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:21,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:21,521 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:21,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-03-29 20:16:21,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-03-29 20:16:21,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:21,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:21,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-29 20:16:21,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:16:21,571 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-03-29 20:16:21,574 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-03-29 20:16:21,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:21,585 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:21,618 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-03-29 20:16:21,621 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-03-29 20:16:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:21,665 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:21,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:16:21,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:16:21,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:16:21,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:16:21,666 INFO L87 Difference]: Start difference. First operand 233 states and 253 transitions. Second operand 12 states. [2018-03-29 20:16:21,674 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-03-29 20:16:22,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:22,039 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-03-29 20:16:22,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:16:22,039 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-03-29 20:16:22,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:22,040 INFO L225 Difference]: With dead ends: 348 [2018-03-29 20:16:22,040 INFO L226 Difference]: Without dead ends: 334 [2018-03-29 20:16:22,041 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-03-29 20:16:22,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-03-29 20:16:22,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 232. [2018-03-29 20:16:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-03-29 20:16:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-03-29 20:16:22,058 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 56 [2018-03-29 20:16:22,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:22,058 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-03-29 20:16:22,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:16:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-03-29 20:16:22,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-03-29 20:16:22,059 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:22,059 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-03-29 20:16:22,059 INFO L408 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:22,059 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-03-29 20:16:22,070 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:22,119 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:22,290 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:22,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-03-29 20:16:22,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-03-29 20:16:22,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:22,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:22,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-29 20:16:22,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:16:22,403 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-03-29 20:16:22,411 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-03-29 20:16:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:22,417 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:22,490 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-03-29 20:16:22,493 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-03-29 20:16:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:22,538 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:22,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:16:22,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:16:22,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:16:22,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:16:22,539 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 12 states. [2018-03-29 20:16:22,557 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-03-29 20:16:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:23,432 INFO L93 Difference]: Finished difference Result 349 states and 377 transitions. [2018-03-29 20:16:23,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:16:23,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-03-29 20:16:23,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:23,434 INFO L225 Difference]: With dead ends: 349 [2018-03-29 20:16:23,434 INFO L226 Difference]: Without dead ends: 335 [2018-03-29 20:16:23,434 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-03-29 20:16:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-03-29 20:16:23,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 234. [2018-03-29 20:16:23,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-03-29 20:16:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 254 transitions. [2018-03-29 20:16:23,463 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 254 transitions. Word has length 56 [2018-03-29 20:16:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:23,464 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 254 transitions. [2018-03-29 20:16:23,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:16:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 254 transitions. [2018-03-29 20:16:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-03-29 20:16:23,465 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:23,465 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-03-29 20:16:23,465 INFO L408 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:23,465 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-03-29 20:16:23,474 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:23,500 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:23,550 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:23,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-03-29 20:16:23,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-03-29 20:16:23,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:23,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:23,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-29 20:16:23,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:16:23,583 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-03-29 20:16:23,587 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-03-29 20:16:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:23,593 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:23,609 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-03-29 20:16:23,612 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-03-29 20:16:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:23,660 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:16:23,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:16:23,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:16:23,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:16:23,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:16:23,661 INFO L87 Difference]: Start difference. First operand 234 states and 254 transitions. Second operand 12 states. [2018-03-29 20:16:23,674 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-03-29 20:16:23,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:23,962 INFO L93 Difference]: Finished difference Result 237 states and 254 transitions. [2018-03-29 20:16:23,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:16:23,963 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-03-29 20:16:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:23,964 INFO L225 Difference]: With dead ends: 237 [2018-03-29 20:16:23,964 INFO L226 Difference]: Without dead ends: 223 [2018-03-29 20:16:23,964 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-03-29 20:16:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-03-29 20:16:23,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 120. [2018-03-29 20:16:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-03-29 20:16:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-03-29 20:16:23,977 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 57 [2018-03-29 20:16:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:23,977 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-03-29 20:16:23,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:16:23,977 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-03-29 20:16:23,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-03-29 20:16:23,977 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:23,978 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-03-29 20:16:23,978 INFO L408 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:23,978 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-03-29 20:16:23,988 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:24,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:24,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:24,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:24,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:24,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:24,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:24,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-03-29 20:16:24,055 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:24,056 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:24,057 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-03-29 20:16:24,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:24,067 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:24,067 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:24,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:16:24,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:24,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:24,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-03-29 20:16:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:24,346 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:24,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-03-29 20:16:24,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:24,893 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-03-29 20:16:24,900 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-29 20:16:24,900 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:24,902 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-03-29 20:16:24,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:24,904 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:24,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:24,907 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-03-29 20:16:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:24,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:16:24,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-03-29 20:16:24,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-03-29 20:16:24,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-03-29 20:16:24,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1687, Unknown=0, NotChecked=0, Total=1806 [2018-03-29 20:16:24,965 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 43 states. [2018-03-29 20:16:27,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:27,425 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2018-03-29 20:16:27,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-03-29 20:16:27,446 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 58 [2018-03-29 20:16:27,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:27,447 INFO L225 Difference]: With dead ends: 149 [2018-03-29 20:16:27,447 INFO L226 Difference]: Without dead ends: 148 [2018-03-29 20:16:27,448 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-03-29 20:16:27,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-03-29 20:16:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 120. [2018-03-29 20:16:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-03-29 20:16:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-03-29 20:16:27,460 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 58 [2018-03-29 20:16:27,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:27,460 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-03-29 20:16:27,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-03-29 20:16:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-03-29 20:16:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-03-29 20:16:27,461 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:27,461 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-03-29 20:16:27,461 INFO L408 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:27,461 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-03-29 20:16:27,466 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:27,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:27,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:27,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:27,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:27,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:27,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:27,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:16:27,550 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:27,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-29 20:16:27,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:27,561 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:27,562 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:27,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:16:27,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:27,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:27,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:16:27,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-03-29 20:16:27,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 12 treesize of output 11 [2018-03-29 20:16:27,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:27,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:27,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:27,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-03-29 20:16:27,603 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-03-29 20:16:27,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-29 20:16:27,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:27,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:27,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-29 20:16:27,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-03-29 20:16:27,798 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-03-29 20:16:27,807 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-03-29 20:16:27,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:16:27,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:27,831 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-03-29 20:16:27,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:45 [2018-03-29 20:16:27,906 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-03-29 20:16:27,924 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-03-29 20:16:27,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:16:27,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:27,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:27,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-03-29 20:16:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:28,051 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:28,792 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-03-29 20:16:28,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 20:16:28,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:28,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-03-29 20:16:28,818 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-03-29 20:16:28,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:28,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:28,821 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-03-29 20:16:28,823 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-03-29 20:16:28,823 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:28,825 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:28,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:16:28,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:16:28,852 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-03-29 20:16:29,886 WARN L151 SmtUtils]: Spent 880ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-03-29 20:16:31,390 WARN L148 SmtUtils]: Spent 1449ms on a formula simplification that was a NOOP. DAG size: 34 [2018-03-29 20:16:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:31,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:16:31,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-03-29 20:16:31,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-03-29 20:16:31,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-03-29 20:16:31,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1522, Unknown=0, NotChecked=0, Total=1640 [2018-03-29 20:16:31,437 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 41 states. [2018-03-29 20:16:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:33,026 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2018-03-29 20:16:33,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-03-29 20:16:33,046 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 61 [2018-03-29 20:16:33,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:33,047 INFO L225 Difference]: With dead ends: 155 [2018-03-29 20:16:33,047 INFO L226 Difference]: Without dead ends: 154 [2018-03-29 20:16:33,048 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=348, Invalid=3312, Unknown=0, NotChecked=0, Total=3660 [2018-03-29 20:16:33,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-03-29 20:16:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 132. [2018-03-29 20:16:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-03-29 20:16:33,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-03-29 20:16:33,060 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 61 [2018-03-29 20:16:33,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:33,060 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-03-29 20:16:33,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-03-29 20:16:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-03-29 20:16:33,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-03-29 20:16:33,061 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:33,061 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-03-29 20:16:33,061 INFO L408 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:33,061 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-03-29 20:16:33,069 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:33,092 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:33,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:33,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:33,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:33,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:33,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:33,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-03-29 20:16:33,128 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:33,129 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:33,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:16:33,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:33,137 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:33,137 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-03-29 20:16:33,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:33,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:33,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-03-29 20:16:33,451 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:33,451 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:34,132 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-03-29 20:16:34,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:34,136 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-03-29 20:16:34,144 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-29 20:16:34,144 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:34,146 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-03-29 20:16:34,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:34,150 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:34,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:34,153 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-03-29 20:16:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:34,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:16:34,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-03-29 20:16:34,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-03-29 20:16:34,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-03-29 20:16:34,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2102, Unknown=0, NotChecked=0, Total=2256 [2018-03-29 20:16:34,240 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 48 states. [2018-03-29 20:16:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:36,596 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-03-29 20:16:36,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-03-29 20:16:36,596 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 62 [2018-03-29 20:16:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:36,597 INFO L225 Difference]: With dead ends: 168 [2018-03-29 20:16:36,597 INFO L226 Difference]: Without dead ends: 167 [2018-03-29 20:16:36,598 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-03-29 20:16:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-03-29 20:16:36,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2018-03-29 20:16:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-03-29 20:16:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-03-29 20:16:36,611 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 62 [2018-03-29 20:16:36,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:36,612 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2018-03-29 20:16:36,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-03-29 20:16:36,612 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-03-29 20:16:36,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-03-29 20:16:36,612 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:36,612 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-03-29 20:16:36,612 INFO L408 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:36,613 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-03-29 20:16:36,619 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:36,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:36,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 6 treesize of output 5 [2018-03-29 20:16:36,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:36,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:36,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-03-29 20:16:36,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-03-29 20:16:36,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-29 20:16:36,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:36,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:36,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 20:16:36,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-03-29 20:16:36,850 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-03-29 20:16:36,852 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:36,859 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-03-29 20:16:36,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:16:36,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:36,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:36,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2018-03-29 20:16:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:37,081 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:37,528 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-03-29 20:16:37,543 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:16:37,544 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-03-29 20:16:37,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:37,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:37,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:37,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:54 [2018-03-29 20:16:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:37,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:16:37,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-03-29 20:16:37,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-03-29 20:16:37,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-03-29 20:16:37,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1510, Unknown=0, NotChecked=0, Total=1640 [2018-03-29 20:16:37,759 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 41 states. [2018-03-29 20:16:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:42,270 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2018-03-29 20:16:42,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-03-29 20:16:42,270 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 65 [2018-03-29 20:16:42,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:42,271 INFO L225 Difference]: With dead ends: 205 [2018-03-29 20:16:42,271 INFO L226 Difference]: Without dead ends: 204 [2018-03-29 20:16:42,273 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=782, Invalid=6190, Unknown=0, NotChecked=0, Total=6972 [2018-03-29 20:16:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-03-29 20:16:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 160. [2018-03-29 20:16:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-03-29 20:16:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-03-29 20:16:42,286 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 65 [2018-03-29 20:16:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:42,286 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2018-03-29 20:16:42,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-03-29 20:16:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-03-29 20:16:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-03-29 20:16:42,286 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:42,286 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-03-29 20:16:42,287 INFO L408 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:42,287 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-03-29 20:16:42,292 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:42,315 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:42,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:42,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:42,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:42,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-03-29 20:16:42,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-03-29 20:16:42,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-29 20:16:42,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:42,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:42,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 20:16:42,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-03-29 20:16:42,759 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-03-29 20:16:42,762 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:42,762 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:42,763 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:42,764 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:42,764 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:42,765 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:42,777 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-03-29 20:16:42,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:16:42,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:42,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:42,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-03-29 20:16:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:43,041 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:43,999 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-03-29 20:16:44,029 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:16:44,029 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:16:44,030 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:16:44,030 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:16:44,030 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:16:44,031 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:16:44,035 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-03-29 20:16:44,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:44,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:44,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:44,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:86 [2018-03-29 20:16:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:44,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:16:44,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-03-29 20:16:44,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-03-29 20:16:44,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-03-29 20:16:44,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2720, Unknown=0, NotChecked=0, Total=2970 [2018-03-29 20:16:44,322 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 55 states. [2018-03-29 20:16:49,457 WARN L151 SmtUtils]: Spent 864ms on a formula simplification. DAG size of input: 95 DAG size of output 87 [2018-03-29 20:16:49,812 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 120 DAG size of output 107 [2018-03-29 20:16:49,990 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 98 DAG size of output 86 [2018-03-29 20:16:50,532 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 79 DAG size of output 71 [2018-03-29 20:16:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:54,031 INFO L93 Difference]: Finished difference Result 214 states and 230 transitions. [2018-03-29 20:16:54,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-03-29 20:16:54,032 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 66 [2018-03-29 20:16:54,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:54,032 INFO L225 Difference]: With dead ends: 214 [2018-03-29 20:16:54,033 INFO L226 Difference]: Without dead ends: 213 [2018-03-29 20:16:54,034 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2468 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1479, Invalid=10293, Unknown=0, NotChecked=0, Total=11772 [2018-03-29 20:16:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-03-29 20:16:54,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 188. [2018-03-29 20:16:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-03-29 20:16:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2018-03-29 20:16:54,054 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 66 [2018-03-29 20:16:54,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:54,054 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2018-03-29 20:16:54,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-03-29 20:16:54,054 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2018-03-29 20:16:54,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-03-29 20:16:54,055 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:54,055 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-03-29 20:16:54,055 INFO L408 AbstractCegarLoop]: === Iteration 29 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:54,055 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-03-29 20:16:54,060 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:54,083 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:54,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:54,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:54,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:54,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:54,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:54,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:16:54,107 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:54,107 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:54,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:16:54,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:54,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-29 20:16:54,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:54,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:54,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:16:54,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-03-29 20:16:54,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 20:16:54,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:54,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:54,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:54,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-03-29 20:16:54,167 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-03-29 20:16:54,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-29 20:16:54,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:54,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:54,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-29 20:16:54,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-03-29 20:16:54,361 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-03-29 20:16:54,370 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-03-29 20:16:54,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:16:54,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:54,395 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-03-29 20:16:54,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:45 [2018-03-29 20:16:54,463 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-03-29 20:16:54,468 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-03-29 20:16:54,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:16:54,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:54,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:16:54,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-03-29 20:16:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-29 20:16:54,591 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:55,368 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-03-29 20:16:55,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 20:16:55,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:55,393 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-03-29 20:16:55,394 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-03-29 20:16:55,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:55,397 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:55,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-03-29 20:16:55,400 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-03-29 20:16:55,400 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:55,401 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:55,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:16:55,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:16:55,427 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-03-29 20:16:56,275 WARN L151 SmtUtils]: Spent 686ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-03-29 20:16:56,589 WARN L148 SmtUtils]: Spent 260ms on a formula simplification that was a NOOP. DAG size: 34 [2018-03-29 20:16:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-29 20:16:56,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:16:56,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2018-03-29 20:16:56,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-03-29 20:16:56,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-03-29 20:16:56,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-03-29 20:16:56,628 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand 43 states. [2018-03-29 20:16:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:16:58,267 INFO L93 Difference]: Finished difference Result 207 states and 220 transitions. [2018-03-29 20:16:58,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-03-29 20:16:58,267 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 68 [2018-03-29 20:16:58,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:16:58,268 INFO L225 Difference]: With dead ends: 207 [2018-03-29 20:16:58,268 INFO L226 Difference]: Without dead ends: 206 [2018-03-29 20:16:58,269 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=359, Invalid=3547, Unknown=0, NotChecked=0, Total=3906 [2018-03-29 20:16:58,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-03-29 20:16:58,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 200. [2018-03-29 20:16:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-03-29 20:16:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 214 transitions. [2018-03-29 20:16:58,290 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 214 transitions. Word has length 68 [2018-03-29 20:16:58,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:16:58,290 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 214 transitions. [2018-03-29 20:16:58,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-03-29 20:16:58,290 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 214 transitions. [2018-03-29 20:16:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-03-29 20:16:58,291 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:16:58,291 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-03-29 20:16:58,291 INFO L408 AbstractCegarLoop]: === Iteration 30 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:16:58,291 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-03-29 20:16:58,298 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:16:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:16:58,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:16:58,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:58,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:58,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:16:58,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:58,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:58,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-03-29 20:16:58,369 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:58,369 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:58,370 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-03-29 20:16:58,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:58,378 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:58,379 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:16:58,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:16:58,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:58,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:58,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-03-29 20:16:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:58,764 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:16:59,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-03-29 20:16:59,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:59,528 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-03-29 20:16:59,536 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-03-29 20:16:59,536 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:59,537 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-29 20:16:59,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:16:59,539 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:59,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:16:59,542 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-03-29 20:16:59,584 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:16:59,605 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:16:59,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-03-29 20:16:59,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-03-29 20:16:59,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-03-29 20:16:59,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2402, Unknown=0, NotChecked=0, Total=2550 [2018-03-29 20:16:59,606 INFO L87 Difference]: Start difference. First operand 200 states and 214 transitions. Second operand 51 states. [2018-03-29 20:17:03,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:17:03,104 INFO L93 Difference]: Finished difference Result 248 states and 265 transitions. [2018-03-29 20:17:03,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-03-29 20:17:03,104 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 69 [2018-03-29 20:17:03,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:17:03,105 INFO L225 Difference]: With dead ends: 248 [2018-03-29 20:17:03,105 INFO L226 Difference]: Without dead ends: 247 [2018-03-29 20:17:03,106 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1104, Invalid=10238, Unknown=0, NotChecked=0, Total=11342 [2018-03-29 20:17:03,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-03-29 20:17:03,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 200. [2018-03-29 20:17:03,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-03-29 20:17:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 214 transitions. [2018-03-29 20:17:03,139 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 214 transitions. Word has length 69 [2018-03-29 20:17:03,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:17:03,140 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 214 transitions. [2018-03-29 20:17:03,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-03-29 20:17:03,140 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 214 transitions. [2018-03-29 20:17:03,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-03-29 20:17:03,140 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:17:03,141 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-03-29 20:17:03,141 INFO L408 AbstractCegarLoop]: === Iteration 31 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:17:03,141 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-03-29 20:17:03,149 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:17:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:17:03,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:17:03,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:17:03,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:03,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:17:03,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:03,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:03,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:17:03,196 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:17:03,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-29 20:17:03,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:03,204 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:17:03,206 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:17:03,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:17:03,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:03,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:03,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:17:03,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-03-29 20:17:03,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 12 treesize of output 11 [2018-03-29 20:17:03,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:03,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:03,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:03,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-03-29 20:17:03,240 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-03-29 20:17:03,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-29 20:17:03,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:03,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:03,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-29 20:17:03,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-03-29 20:17:03,421 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-03-29 20:17:03,430 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-03-29 20:17:03,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:17:03,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:17:03,453 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-03-29 20:17:03,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:49 [2018-03-29 20:17:03,545 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-03-29 20:17:03,547 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-03-29 20:17:03,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:03,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:03,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:03,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-03-29 20:17:03,618 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-03-29 20:17:03,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, 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-03-29 20:17:03,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:17:03,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:17:03,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:17:03,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-03-29 20:17:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:17:03,717 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:17:05,089 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-03-29 20:17:05,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 20:17:05,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:05,110 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-03-29 20:17:05,119 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-03-29 20:17:05,141 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-03-29 20:17:05,141 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-03-29 20:17:05,143 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-03-29 20:17:05,143 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:05,148 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-03-29 20:17:05,149 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-03-29 20:17:05,189 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-03-29 20:17:05,190 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-03-29 20:17:05,195 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-03-29 20:17:05,195 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-03-29 20:17:05,219 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:17:05,237 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:17:05,238 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-03-29 20:17:05,239 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-03-29 20:17:05,240 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:05,242 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:05,248 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-03-29 20:17:05,250 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 29 treesize of output 32 [2018-03-29 20:17:05,265 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 12 treesize of output 12 [2018-03-29 20:17:05,265 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-03-29 20:17:05,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:17:05,267 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:05,277 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-03-29 20:17:05,306 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 25 treesize of output 20 [2018-03-29 20:17:05,307 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:05,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-03-29 20:17:05,308 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:05,310 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 24 treesize of output 19 [2018-03-29 20:17:05,310 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:05,345 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-03-29 20:17:05,403 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-03-29 20:17:05,404 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:05,406 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-03-29 20:17:05,406 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:05,462 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-03-29 20:17:05,463 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 3 xjuncts. [2018-03-29 20:17:05,472 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-03-29 20:17:05,473 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 3 xjuncts. [2018-03-29 20:17:05,520 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-03-29 20:17:05,520 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-03-29 20:17:05,543 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:17:05,561 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-03-29 20:17:05,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-03-29 20:17:05,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:17:05,612 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 6 variables, input treesize:58, output treesize:84 [2018-03-29 20:17:06,084 WARN L151 SmtUtils]: Spent 310ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-03-29 20:17:06,453 WARN L148 SmtUtils]: Spent 307ms on a formula simplification that was a NOOP. DAG size: 34 [2018-03-29 20:17:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:17:06,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:17:06,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2018-03-29 20:17:06,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-03-29 20:17:06,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-03-29 20:17:06,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2375, Unknown=0, NotChecked=0, Total=2550 [2018-03-29 20:17:06,504 INFO L87 Difference]: Start difference. First operand 200 states and 214 transitions. Second operand 51 states. [2018-03-29 20:17:09,010 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 89 DAG size of output 48 [2018-03-29 20:17:10,072 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 93 DAG size of output 51 [2018-03-29 20:17:10,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:17:10,778 INFO L93 Difference]: Finished difference Result 254 states and 269 transitions. [2018-03-29 20:17:10,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-03-29 20:17:10,778 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 72 [2018-03-29 20:17:10,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:17:10,779 INFO L225 Difference]: With dead ends: 254 [2018-03-29 20:17:10,779 INFO L226 Difference]: Without dead ends: 253 [2018-03-29 20:17:10,780 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=821, Invalid=5821, Unknown=0, NotChecked=0, Total=6642 [2018-03-29 20:17:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-03-29 20:17:10,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2018-03-29 20:17:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-03-29 20:17:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 267 transitions. [2018-03-29 20:17:10,805 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 267 transitions. Word has length 72 [2018-03-29 20:17:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:17:10,805 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 267 transitions. [2018-03-29 20:17:10,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-03-29 20:17:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 267 transitions. [2018-03-29 20:17:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-03-29 20:17:10,806 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:17:10,806 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-03-29 20:17:10,806 INFO L408 AbstractCegarLoop]: === Iteration 32 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:17:10,806 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-03-29 20:17:10,811 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:17:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:17:10,839 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:17:10,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:17:10,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:10,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:17:10,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:10,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:10,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-03-29 20:17:10,872 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:17:10,873 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:17:10,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:17:10,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:10,880 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:17:10,880 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-03-29 20:17:10,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:10,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:10,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-03-29 20:17:10,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-03-29 20:17:10,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-29 20:17:10,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:10,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:10,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 20:17:10,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-03-29 20:17:10,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-03-29 20:17:10,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-03-29 20:17:10,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:17:10,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:17:10,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:17:10,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:46 [2018-03-29 20:17:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:17:11,424 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:17:12,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-03-29 20:17:12,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-03-29 20:17:12,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:12,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:12,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:12,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:45 [2018-03-29 20:17:12,593 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-03-29 20:17:12,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:12,606 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-03-29 20:17:12,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, 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-03-29 20:17:12,620 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:12,623 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:12,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, 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-03-29 20:17:12,651 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-03-29 20:17:12,651 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:12,656 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:12,667 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-03-29 20:17:12,667 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:12,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:17:12,677 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-03-29 20:17:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:17:12,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:17:12,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 58 [2018-03-29 20:17:12,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-03-29 20:17:12,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-03-29 20:17:12,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3240, Unknown=0, NotChecked=0, Total=3422 [2018-03-29 20:17:12,763 INFO L87 Difference]: Start difference. First operand 252 states and 267 transitions. Second operand 59 states. [2018-03-29 20:17:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:17:23,608 INFO L93 Difference]: Finished difference Result 303 states and 321 transitions. [2018-03-29 20:17:23,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-03-29 20:17:23,608 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 76 [2018-03-29 20:17:23,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:17:23,609 INFO L225 Difference]: With dead ends: 303 [2018-03-29 20:17:23,610 INFO L226 Difference]: Without dead ends: 302 [2018-03-29 20:17:23,611 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3867 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1297, Invalid=15995, Unknown=0, NotChecked=0, Total=17292 [2018-03-29 20:17:23,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-03-29 20:17:23,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2018-03-29 20:17:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-03-29 20:17:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 267 transitions. [2018-03-29 20:17:23,634 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 267 transitions. Word has length 76 [2018-03-29 20:17:23,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:17:23,634 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 267 transitions. [2018-03-29 20:17:23,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-03-29 20:17:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 267 transitions. [2018-03-29 20:17:23,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-03-29 20:17:23,635 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:17:23,635 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-03-29 20:17:23,635 INFO L408 AbstractCegarLoop]: === Iteration 33 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:17:23,635 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-03-29 20:17:23,642 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:17:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:17:23,674 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:17:23,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:17:23,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:23,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:17:23,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:23,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:23,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-03-29 20:17:23,746 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:17:23,747 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:17:23,747 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-03-29 20:17:23,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:23,759 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:17:23,760 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:17:23,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:17:23,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:23,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:23,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-03-29 20:17:23,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-03-29 20:17:23,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-29 20:17:23,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:23,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:23,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 20:17:23,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-03-29 20:17:24,146 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-03-29 20:17:24,148 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:17:24,149 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:17:24,149 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:17:24,156 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-03-29 20:17:24,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:17:24,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:17:24,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:17:24,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:84 [2018-03-29 20:17:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:17:24,637 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:17:25,975 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-03-29 20:17:26,000 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:17:26,001 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:17:26,001 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:17:26,004 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-03-29 20:17:26,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:26,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:26,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:26,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:77 [2018-03-29 20:17:26,384 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-03-29 20:17:26,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:26,404 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-03-29 20:17:26,417 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-03-29 20:17:26,418 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:26,421 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:26,433 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-03-29 20:17:26,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:26,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, 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-03-29 20:17:26,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-03-29 20:17:26,458 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:26,461 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:26,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:17:26,471 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-03-29 20:17:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:17:26,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:17:26,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2018-03-29 20:17:26,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-03-29 20:17:26,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-03-29 20:17:26,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=4167, Unknown=0, NotChecked=0, Total=4422 [2018-03-29 20:17:26,572 INFO L87 Difference]: Start difference. First operand 252 states and 267 transitions. Second operand 67 states. [2018-03-29 20:17:28,791 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 111 DAG size of output 79 [2018-03-29 20:17:33,055 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 120 DAG size of output 106 [2018-03-29 20:17:33,801 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 113 DAG size of output 101 [2018-03-29 20:17:34,324 WARN L151 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 142 DAG size of output 123 [2018-03-29 20:17:37,724 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 121 DAG size of output 107 [2018-03-29 20:17:37,933 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 101 DAG size of output 98 [2018-03-29 20:17:39,568 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 108 DAG size of output 102 [2018-03-29 20:17:40,108 WARN L151 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 118 DAG size of output 109 [2018-03-29 20:17:40,670 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 124 DAG size of output 109 [2018-03-29 20:17:40,880 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 111 DAG size of output 99 [2018-03-29 20:17:41,125 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 117 DAG size of output 107 [2018-03-29 20:17:41,754 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 102 DAG size of output 96 [2018-03-29 20:17:42,292 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 121 DAG size of output 110 [2018-03-29 20:17:42,760 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 108 DAG size of output 91 [2018-03-29 20:17:43,166 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 111 DAG size of output 100 [2018-03-29 20:17:44,264 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 120 DAG size of output 104 [2018-03-29 20:17:44,713 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 99 DAG size of output 91 [2018-03-29 20:17:45,049 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 103 DAG size of output 95 [2018-03-29 20:17:45,647 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 116 DAG size of output 102 [2018-03-29 20:17:46,098 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 97 DAG size of output 94 [2018-03-29 20:17:46,626 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 112 DAG size of output 101 [2018-03-29 20:17:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:17:47,251 INFO L93 Difference]: Finished difference Result 315 states and 333 transitions. [2018-03-29 20:17:47,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-03-29 20:17:47,251 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 79 [2018-03-29 20:17:47,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:17:47,252 INFO L225 Difference]: With dead ends: 315 [2018-03-29 20:17:47,252 INFO L226 Difference]: Without dead ends: 314 [2018-03-29 20:17:47,254 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6844 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=2254, Invalid=24478, Unknown=0, NotChecked=0, Total=26732 [2018-03-29 20:17:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-03-29 20:17:47,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 252. [2018-03-29 20:17:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-03-29 20:17:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 267 transitions. [2018-03-29 20:17:47,287 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 267 transitions. Word has length 79 [2018-03-29 20:17:47,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:17:47,287 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 267 transitions. [2018-03-29 20:17:47,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-03-29 20:17:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 267 transitions. [2018-03-29 20:17:47,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-03-29 20:17:47,288 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:17:47,289 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-03-29 20:17:47,289 INFO L408 AbstractCegarLoop]: === Iteration 34 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:17:47,289 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-03-29 20:17:47,294 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:17:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:17:47,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:17:47,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:17:47,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:47,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:17:47,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:47,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:47,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:17:47,351 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:17:47,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-29 20:17:47,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:47,360 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:17:47,361 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:17:47,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:17:47,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:47,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:47,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:17:47,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-03-29 20:17:47,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 20:17:47,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:47,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:47,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:47,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-03-29 20:17:47,394 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-03-29 20:17:47,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-29 20:17:47,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:47,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:47,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-29 20:17:47,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-03-29 20:17:47,603 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-03-29 20:17:47,611 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-03-29 20:17:47,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:17:47,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:17:47,635 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-03-29 20:17:47,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:49 [2018-03-29 20:17:47,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 23 treesize of output 24 [2018-03-29 20:17:47,733 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-03-29 20:17:47,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:47,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:47,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:47,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-03-29 20:17:47,807 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-03-29 20:17:47,813 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-03-29 20:17:47,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:17:47,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:17:47,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:17:47,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-03-29 20:17:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-29 20:17:47,917 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:17:51,313 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-03-29 20:17:51,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 20:17:51,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:51,339 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-03-29 20:17:51,345 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 33 treesize of output 36 [2018-03-29 20:17:51,364 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 14 treesize of output 14 [2018-03-29 20:17:51,364 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-03-29 20:17:51,366 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 13 treesize of output 6 [2018-03-29 20:17:51,366 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:51,377 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-03-29 20:17:51,410 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-03-29 20:17:51,411 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:51,412 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 28 treesize of output 23 [2018-03-29 20:17:51,412 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:51,414 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 29 treesize of output 24 [2018-03-29 20:17:51,414 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:51,451 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-03-29 20:17:51,513 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:17:51,514 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-03-29 20:17:51,515 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:51,516 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:17:51,517 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-03-29 20:17:51,518 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:51,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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-03-29 20:17:51,575 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-03-29 20:17:51,586 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-03-29 20:17:51,586 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-03-29 20:17:51,635 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-03-29 20:17:51,635 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-03-29 20:17:51,655 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-03-29 20:17:51,674 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-03-29 20:17:51,676 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-03-29 20:17:51,685 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-03-29 20:17:51,711 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-03-29 20:17:51,711 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-03-29 20:17:51,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-03-29 20:17:51,719 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-03-29 20:17:51,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-03-29 20:17:51,721 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:51,760 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-03-29 20:17:51,760 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-03-29 20:17:51,776 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-03-29 20:17:51,777 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 3 xjuncts. [2018-03-29 20:17:51,805 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:17:51,824 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:17:51,825 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-03-29 20:17:51,827 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-03-29 20:17:51,827 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-03-29 20:17:51,830 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:17:51,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-03-29 20:17:51,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:17:51,886 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 6 variables, input treesize:60, output treesize:84 [2018-03-29 20:17:52,369 WARN L151 SmtUtils]: Spent 311ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-03-29 20:17:52,746 WARN L148 SmtUtils]: Spent 310ms on a formula simplification that was a NOOP. DAG size: 34 [2018-03-29 20:17:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-29 20:17:52,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:17:52,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 52 [2018-03-29 20:17:52,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-03-29 20:17:52,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-03-29 20:17:52,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2577, Unknown=1, NotChecked=0, Total=2756 [2018-03-29 20:17:52,799 INFO L87 Difference]: Start difference. First operand 252 states and 267 transitions. Second operand 53 states. [2018-03-29 20:18:05,901 WARN L151 SmtUtils]: Spent 4771ms on a formula simplification. DAG size of input: 110 DAG size of output 70 [2018-03-29 20:18:29,324 WARN L151 SmtUtils]: Spent 9025ms on a formula simplification. DAG size of input: 103 DAG size of output 59 Received shutdown request... [2018-03-29 20:18:31,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-03-29 20:18:31,335 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-29 20:18:31,340 WARN L197 ceAbstractionStarter]: Timeout [2018-03-29 20:18:31,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 08:18:31 BoogieIcfgContainer [2018-03-29 20:18:31,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-29 20:18:31,341 INFO L168 Benchmark]: Toolchain (without parser) took 146187.54 ms. Allocated memory was 304.6 MB in the beginning and 568.3 MB in the end (delta: 263.7 MB). Free memory was 241.8 MB in the beginning and 526.1 MB in the end (delta: -284.3 MB). Peak memory consumption was 219.3 MB. Max. memory is 5.3 GB. [2018-03-29 20:18:31,342 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 304.6 MB. Free memory is still 267.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-29 20:18:31,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.46 ms. Allocated memory is still 304.6 MB. Free memory was 241.8 MB in the beginning and 217.7 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. [2018-03-29 20:18:31,342 INFO L168 Benchmark]: Boogie Preprocessor took 54.75 ms. Allocated memory is still 304.6 MB. Free memory was 217.7 MB in the beginning and 214.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-03-29 20:18:31,342 INFO L168 Benchmark]: RCFGBuilder took 523.81 ms. Allocated memory was 304.6 MB in the beginning and 464.5 MB in the end (delta: 159.9 MB). Free memory was 214.7 MB in the beginning and 399.2 MB in the end (delta: -184.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. [2018-03-29 20:18:31,343 INFO L168 Benchmark]: TraceAbstraction took 145249.24 ms. Allocated memory was 464.5 MB in the beginning and 568.3 MB in the end (delta: 103.8 MB). Free memory was 399.2 MB in the beginning and 526.1 MB in the end (delta: -126.9 MB). Peak memory consumption was 216.8 MB. Max. memory is 5.3 GB. [2018-03-29 20:18:31,344 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.22 ms. Allocated memory is still 304.6 MB. Free memory is still 267.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 354.46 ms. Allocated memory is still 304.6 MB. Free memory was 241.8 MB in the beginning and 217.7 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 54.75 ms. Allocated memory is still 304.6 MB. Free memory was 217.7 MB in the beginning and 214.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 523.81 ms. Allocated memory was 304.6 MB in the beginning and 464.5 MB in the end (delta: 159.9 MB). Free memory was 214.7 MB in the beginning and 399.2 MB in the end (delta: -184.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 145249.24 ms. Allocated memory was 464.5 MB in the beginning and 568.3 MB in the end (delta: 103.8 MB). Free memory was 399.2 MB in the beginning and 526.1 MB in the end (delta: -126.9 MB). Peak memory consumption was 216.8 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 (252states) and interpolant automaton (currently 24 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (94 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 24 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (94 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 24 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (94 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 24 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (94 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 24 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (94 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 24 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (94 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 24 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (94 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 24 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (94 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 24 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (94 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 24 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (94 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 24 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (94 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 89 locations, 11 error locations. TIMEOUT Result, 145.1s OverallTime, 34 OverallIterations, 6 TraceHistogramMax, 111.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2191 SDtfs, 6530 SDslu, 25087 SDs, 0 SdLazy, 21815 SolverSat, 1091 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 38.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4114 GetRequests, 2637 SyntacticMatches, 34 SemanticMatches, 1443 ConstructedPredicates, 40 IntricatePredicates, 0 DeprecatedPredicates, 24053 ImplicationChecksByTransitivity, 96.3s 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.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 1078 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 31.6s InterpolantComputationTime, 1737 NumberOfCodeBlocks, 1737 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 3406 ConstructedInterpolants, 686 QuantifiedInterpolants, 2755241 SizeOfPredicates, 639 NumberOfNonLiveVariables, 5357 ConjunctsInSsa, 1142 ConjunctsInUnsatCore, 68 InterpolantComputations, 38 PerfectInterpolantSequences, 16/928 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-03-29_20-18-31-350.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-03-29_20-18-31-350.csv Completed graceful shutdown