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/cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 19:59:33,402 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 19:59:33,404 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 19:59:33,416 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 19:59:33,416 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 19:59:33,417 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 19:59:33,417 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 19:59:33,419 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 19:59:33,420 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 19:59:33,420 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 19:59:33,421 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 19:59:33,421 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 19:59:33,422 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 19:59:33,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 19:59:33,424 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 19:59:33,426 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 19:59:33,428 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 19:59:33,430 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 19:59:33,431 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 19:59:33,432 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 19:59:33,434 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 19:59:33,435 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 19:59:33,435 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 19:59:33,436 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 19:59:33,437 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 19:59:33,438 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 19:59:33,438 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 19:59:33,439 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 19:59:33,440 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 19:59:33,440 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 19:59:33,442 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 19:59:33,442 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-09 19:59:33,466 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 19:59:33,466 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 19:59:33,467 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 19:59:33,467 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 19:59:33,467 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 19:59:33,468 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 19:59:33,468 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 19:59:33,468 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 19:59:33,468 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 19:59:33,468 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 19:59:33,469 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 19:59:33,469 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 19:59:33,469 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 19:59:33,469 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 19:59:33,470 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 19:59:33,470 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 19:59:33,470 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 19:59:33,470 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 19:59:33,470 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 19:59:33,470 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 19:59:33,471 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 19:59:33,471 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 19:59:33,471 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 19:59:33,471 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 19:59:33,471 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 19:59:33,472 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 19:59:33,472 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 19:59:33,472 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 19:59:33,472 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 19:59:33,472 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 19:59:33,473 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 19:59:33,473 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 19:59:33,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:33,473 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 19:59:33,474 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 19:59:33,474 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 19:59:33,474 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 19:59:33,475 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 19:59:33,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 19:59:33,522 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 19:59:33,526 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 19:59:33,528 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 19:59:33,528 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 19:59:33,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:33,864 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGb20588ff9 [2018-04-09 19:59:34,042 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 19:59:34,042 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 19:59:34,043 INFO L168 CDTParser]: Scanning cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,053 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 19:59:34,053 INFO L215 ultiparseSymbolTable]: [2018-04-09 19:59:34,053 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 19:59:34,053 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,053 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,054 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,054 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,054 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 19:59:34,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_short in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__size_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,054 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____time_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,055 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____id_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,056 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__key_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,057 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,058 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,058 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,058 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,058 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,058 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,058 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,058 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,058 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_int in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,059 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,059 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__id_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,059 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,059 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,059 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,059 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,059 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,059 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__time_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,060 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__register_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,060 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,060 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,060 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,060 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,060 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,060 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,060 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,060 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,061 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,061 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,061 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,061 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,061 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ushort in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,061 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,061 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,061 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,061 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,061 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,061 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,061 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____key_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,062 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,062 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,062 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,062 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,062 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,062 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,062 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,062 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,062 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,062 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,062 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,062 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__uint in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,062 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,062 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,062 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,063 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,063 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____off_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,063 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,063 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_long in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,063 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,063 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,063 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,063 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,063 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,063 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ulong in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,063 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,063 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_long in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,064 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,064 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_char in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,064 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,064 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_short in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,064 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,064 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,064 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,064 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__div_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,065 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,065 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,065 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,065 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,065 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_char in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,065 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__off_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,065 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,065 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,065 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,066 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,066 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,066 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,083 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGb20588ff9 [2018-04-09 19:59:34,087 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 19:59:34,089 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 19:59:34,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 19:59:34,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 19:59:34,095 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 19:59:34,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 07:59:34" (1/1) ... [2018-04-09 19:59:34,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a35dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:59:34, skipping insertion in model container [2018-04-09 19:59:34,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 07:59:34" (1/1) ... [2018-04-09 19:59:34,112 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 19:59:34,142 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 19:59:34,305 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 19:59:34,350 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 19:59:34,358 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-09 19:59:34,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:59:34 WrapperNode [2018-04-09 19:59:34,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 19:59:34,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 19:59:34,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 19:59:34,407 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 19:59:34,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:59:34" (1/1) ... [2018-04-09 19:59:34,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:59:34" (1/1) ... [2018-04-09 19:59:34,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:59:34" (1/1) ... [2018-04-09 19:59:34,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:59:34" (1/1) ... [2018-04-09 19:59:34,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:59:34" (1/1) ... [2018-04-09 19:59:34,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:59:34" (1/1) ... [2018-04-09 19:59:34,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:59:34" (1/1) ... [2018-04-09 19:59:34,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 19:59:34,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 19:59:34,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 19:59:34,465 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 19:59:34,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:59:34" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 19:59:34,583 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 19:59:34,583 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 19:59:34,583 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-09 19:59:34,583 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-09 19:59:34,583 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-04-09 19:59:34,583 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 19:59:34,583 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-09 19:59:34,583 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-09 19:59:34,583 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 19:59:34,584 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 19:59:34,584 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 19:59:34,584 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 19:59:34,584 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 19:59:34,584 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 19:59:34,584 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 19:59:34,584 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 19:59:34,584 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 19:59:34,584 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 19:59:34,584 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 19:59:34,585 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 19:59:34,585 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 19:59:34,585 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 19:59:34,585 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 19:59:34,585 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 19:59:34,585 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 19:59:34,585 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 19:59:34,585 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 19:59:34,586 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 19:59:34,586 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 19:59:34,586 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 19:59:34,586 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 19:59:34,586 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 19:59:34,586 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 19:59:34,586 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 19:59:34,586 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 19:59:34,587 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 19:59:34,587 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 19:59:34,587 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 19:59:34,587 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 19:59:34,587 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 19:59:34,587 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 19:59:34,587 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 19:59:34,588 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 19:59:34,588 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 19:59:34,588 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 19:59:34,588 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 19:59:34,588 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 19:59:34,588 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 19:59:34,588 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 19:59:34,588 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 19:59:34,589 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 19:59:34,589 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 19:59:34,589 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 19:59:34,589 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 19:59:34,589 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 19:59:34,589 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 19:59:34,589 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 19:59:34,589 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 19:59:34,590 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 19:59:34,590 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 19:59:34,590 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 19:59:34,590 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 19:59:34,590 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 19:59:34,590 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 19:59:34,590 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 19:59:34,590 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 19:59:34,591 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 19:59:34,591 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 19:59:34,591 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 19:59:34,591 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 19:59:34,591 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 19:59:34,591 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 19:59:34,591 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 19:59:34,591 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 19:59:34,592 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 19:59:34,592 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 19:59:34,592 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 19:59:34,592 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 19:59:34,592 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 19:59:34,592 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 19:59:34,592 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 19:59:34,592 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 19:59:34,593 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 19:59:34,593 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 19:59:34,593 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 19:59:34,593 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 19:59:34,593 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 19:59:34,593 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 19:59:34,593 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 19:59:34,593 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 19:59:34,594 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 19:59:34,594 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 19:59:34,594 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 19:59:34,594 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 19:59:34,594 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 19:59:34,594 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 19:59:34,594 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 19:59:34,595 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 19:59:34,595 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 19:59:34,595 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 19:59:34,595 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 19:59:34,595 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 19:59:34,595 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 19:59:34,595 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 19:59:34,595 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 19:59:34,596 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 19:59:34,596 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 19:59:34,596 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 19:59:34,596 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 19:59:34,596 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-04-09 19:59:34,596 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 19:59:34,596 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 19:59:34,596 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 19:59:34,596 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 19:59:34,597 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 19:59:34,597 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 19:59:34,597 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 19:59:34,597 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 19:59:34,965 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 19:59:34,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 07:59:34 BoogieIcfgContainer [2018-04-09 19:59:34,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 19:59:34,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 19:59:34,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 19:59:34,969 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 19:59:34,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 07:59:34" (1/3) ... [2018-04-09 19:59:34,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b9d771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 07:59:34, skipping insertion in model container [2018-04-09 19:59:34,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:59:34" (2/3) ... [2018-04-09 19:59:34,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b9d771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 07:59:34, skipping insertion in model container [2018-04-09 19:59:34,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 07:59:34" (3/3) ... [2018-04-09 19:59:34,972 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:59:34,979 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 19:59:34,985 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-04-09 19:59:35,021 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 19:59:35,022 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 19:59:35,022 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 19:59:35,022 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 19:59:35,022 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 19:59:35,022 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 19:59:35,022 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 19:59:35,022 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 19:59:35,022 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 19:59:35,023 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 19:59:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-04-09 19:59:35,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-09 19:59:35,044 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:35,045 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:59:35,045 INFO L408 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:35,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1897600849, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:35,063 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:35,098 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:35,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:59:35,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:35,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:35,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 19:59:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:35,160 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:35,195 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:59:35,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 19:59:35,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 19:59:35,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 19:59:35,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 19:59:35,215 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 4 states. [2018-04-09 19:59:35,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:35,333 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-04-09 19:59:35,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 19:59:35,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-09 19:59:35,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:35,344 INFO L225 Difference]: With dead ends: 95 [2018-04-09 19:59:35,345 INFO L226 Difference]: Without dead ends: 77 [2018-04-09 19:59:35,348 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 19:59:35,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-09 19:59:35,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-04-09 19:59:35,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-09 19:59:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-04-09 19:59:35,383 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 19 [2018-04-09 19:59:35,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:35,383 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-04-09 19:59:35,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 19:59:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-04-09 19:59:35,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-09 19:59:35,384 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:35,384 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:59:35,384 INFO L408 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:35,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1897600848, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:35,400 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:35,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:35,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:59:35,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:35,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:35,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-09 19:59:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:35,459 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:35,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-04-09 19:59:35,505 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:59:35,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-09 19:59:35,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 19:59:35,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 19:59:35,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-09 19:59:35,508 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 7 states. [2018-04-09 19:59:35,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:35,639 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-04-09 19:59:35,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 19:59:35,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-04-09 19:59:35,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:35,641 INFO L225 Difference]: With dead ends: 77 [2018-04-09 19:59:35,641 INFO L226 Difference]: Without dead ends: 76 [2018-04-09 19:59:35,642 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 19:59:35,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-04-09 19:59:35,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-04-09 19:59:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-09 19:59:35,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-04-09 19:59:35,650 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 19 [2018-04-09 19:59:35,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:35,651 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-04-09 19:59:35,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 19:59:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-04-09 19:59:35,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-09 19:59:35,652 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:35,653 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:59:35,653 INFO L408 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:35,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1105859402, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:35,662 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:35,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:35,764 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:35,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:35,811 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:59:35,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-09 19:59:35,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 19:59:35,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 19:59:35,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-09 19:59:35,812 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 7 states. [2018-04-09 19:59:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:35,952 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-04-09 19:59:35,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 19:59:35,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-04-09 19:59:35,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:35,954 INFO L225 Difference]: With dead ends: 76 [2018-04-09 19:59:35,954 INFO L226 Difference]: Without dead ends: 75 [2018-04-09 19:59:35,954 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-09 19:59:35,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-09 19:59:35,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-09 19:59:35,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-09 19:59:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-04-09 19:59:35,962 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 37 [2018-04-09 19:59:35,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:35,963 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-04-09 19:59:35,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 19:59:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-04-09 19:59:35,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-09 19:59:35,964 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:35,964 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] [2018-04-09 19:59:35,964 INFO L408 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:35,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1105859403, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:35,972 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:35,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:36,095 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:36,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-09 19:59:36,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:36,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-09 19:59:36,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:36,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:59:36,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-09 19:59:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:36,155 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:59:36,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2018-04-09 19:59:36,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 19:59:36,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 19:59:36,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-09 19:59:36,156 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 10 states. [2018-04-09 19:59:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:36,336 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-04-09 19:59:36,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 19:59:36,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-04-09 19:59:36,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:36,342 INFO L225 Difference]: With dead ends: 89 [2018-04-09 19:59:36,342 INFO L226 Difference]: Without dead ends: 88 [2018-04-09 19:59:36,342 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-04-09 19:59:36,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-09 19:59:36,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2018-04-09 19:59:36,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-09 19:59:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-04-09 19:59:36,351 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 37 [2018-04-09 19:59:36,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:36,352 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-04-09 19:59:36,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 19:59:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-04-09 19:59:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-09 19:59:36,353 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:36,353 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] [2018-04-09 19:59:36,353 INFO L408 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:36,354 INFO L82 PathProgramCache]: Analyzing trace with hash -78096902, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:36,364 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:36,391 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:36,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:59:36,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:36,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:36,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 19:59:36,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 19:59:36,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:36,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:36,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-09 19:59:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:36,471 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:36,520 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:59:36,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2018-04-09 19:59:36,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 19:59:36,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 19:59:36,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-04-09 19:59:36,521 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 12 states. [2018-04-09 19:59:36,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:36,732 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-04-09 19:59:36,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:59:36,733 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-04-09 19:59:36,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:36,734 INFO L225 Difference]: With dead ends: 85 [2018-04-09 19:59:36,734 INFO L226 Difference]: Without dead ends: 84 [2018-04-09 19:59:36,735 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-04-09 19:59:36,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-09 19:59:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-04-09 19:59:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-09 19:59:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-04-09 19:59:36,743 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 38 [2018-04-09 19:59:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:36,743 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-04-09 19:59:36,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 19:59:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-04-09 19:59:36,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-09 19:59:36,744 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:36,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] [2018-04-09 19:59:36,745 INFO L408 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:36,745 INFO L82 PathProgramCache]: Analyzing trace with hash -78096901, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:36,751 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:36,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:36,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:59:36,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:36,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:59:36,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:36,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:36,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-09 19:59:36,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:36,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 19:59:36,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:36,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:36,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:36,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:59:36,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:36,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:36,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 19:59:36,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:36,892 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:37,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-04-09 19:59:37,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:37,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-09 19:59:37,052 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 19:59:37,052 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:37,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 19:59:37,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:37,056 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:37,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:37,059 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2018-04-09 19:59:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:37,085 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:59:37,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 17 [2018-04-09 19:59:37,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-09 19:59:37,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-09 19:59:37,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-04-09 19:59:37,087 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 18 states. [2018-04-09 19:59:37,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:37,405 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-04-09 19:59:37,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 19:59:37,405 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-04-09 19:59:37,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:37,406 INFO L225 Difference]: With dead ends: 96 [2018-04-09 19:59:37,406 INFO L226 Difference]: Without dead ends: 95 [2018-04-09 19:59:37,407 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2018-04-09 19:59:37,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-09 19:59:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2018-04-09 19:59:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-09 19:59:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-04-09 19:59:37,414 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 38 [2018-04-09 19:59:37,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:37,414 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-04-09 19:59:37,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-09 19:59:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-04-09 19:59:37,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-09 19:59:37,415 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:37,416 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:59:37,416 INFO L408 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:37,416 INFO L82 PathProgramCache]: Analyzing trace with hash -712713128, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:37,425 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:37,448 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:37,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:37,464 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:37,519 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:59:37,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2018-04-09 19:59:37,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 19:59:37,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 19:59:37,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 19:59:37,520 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 6 states. [2018-04-09 19:59:37,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:37,540 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-04-09 19:59:37,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 19:59:37,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-04-09 19:59:37,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:37,541 INFO L225 Difference]: With dead ends: 96 [2018-04-09 19:59:37,541 INFO L226 Difference]: Without dead ends: 85 [2018-04-09 19:59:37,542 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-04-09 19:59:37,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-09 19:59:37,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-04-09 19:59:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-09 19:59:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-04-09 19:59:37,548 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 39 [2018-04-09 19:59:37,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:37,548 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-04-09 19:59:37,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 19:59:37,548 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-04-09 19:59:37,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-09 19:59:37,549 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:37,549 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-09 19:59:37,549 INFO L408 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:37,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1036144935, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:37,554 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:37,577 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:37,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 19:59:37,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 19:59:37,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:37,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:37,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 19:59:37,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-04-09 19:59:37,737 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 16 [2018-04-09 19:59:37,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-09 19:59:37,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:59:37,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:59:37,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:59:37,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-04-09 19:59:37,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:37,851 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:38,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-09 19:59:38,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:38,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-09 19:59:38,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 19:59:38,140 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:38,151 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:38,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:38,163 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-04-09 19:59:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:38,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:59:38,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-09 19:59:38,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-09 19:59:38,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-09 19:59:38,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-04-09 19:59:38,198 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 21 states. [2018-04-09 19:59:38,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:38,883 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-04-09 19:59:38,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-09 19:59:38,883 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-04-09 19:59:38,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:38,884 INFO L225 Difference]: With dead ends: 112 [2018-04-09 19:59:38,885 INFO L226 Difference]: Without dead ends: 111 [2018-04-09 19:59:38,885 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2018-04-09 19:59:38,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-04-09 19:59:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2018-04-09 19:59:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-09 19:59:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-04-09 19:59:38,894 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 52 [2018-04-09 19:59:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:38,895 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-04-09 19:59:38,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-09 19:59:38,895 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-04-09 19:59:38,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-09 19:59:38,896 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:38,896 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] [2018-04-09 19:59:38,897 INFO L408 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:38,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2049691577, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:38,907 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:38,930 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:38,943 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:38,947 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 12 treesize of output 7 [2018-04-09 19:59:38,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:38,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:38,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-04-09 19:59:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:38,973 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:59:38,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 19:59:38,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 19:59:38,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 19:59:38,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-09 19:59:38,974 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 6 states. [2018-04-09 19:59:39,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:39,033 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-04-09 19:59:39,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 19:59:39,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-04-09 19:59:39,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:39,035 INFO L225 Difference]: With dead ends: 102 [2018-04-09 19:59:39,035 INFO L226 Difference]: Without dead ends: 101 [2018-04-09 19:59:39,035 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-09 19:59:39,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-09 19:59:39,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-04-09 19:59:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-09 19:59:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-04-09 19:59:39,042 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 52 [2018-04-09 19:59:39,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:39,043 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-04-09 19:59:39,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 19:59:39,043 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-04-09 19:59:39,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-09 19:59:39,045 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:39,045 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] [2018-04-09 19:59:39,045 INFO L408 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:39,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2049691576, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:39,054 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:39,080 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:39,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:59:39,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:39,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:59:39,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:39,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:39,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 19:59:39,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:39,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 19:59:39,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:39,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:39,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:39,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:59:39,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:39,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:39,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 19:59:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:39,349 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:39,830 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:59:39,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 38 [2018-04-09 19:59:39,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-09 19:59:39,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-09 19:59:39,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2018-04-09 19:59:39,831 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 39 states. [2018-04-09 19:59:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:41,960 INFO L93 Difference]: Finished difference Result 183 states and 196 transitions. [2018-04-09 19:59:41,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-09 19:59:41,961 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-04-09 19:59:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:41,962 INFO L225 Difference]: With dead ends: 183 [2018-04-09 19:59:41,962 INFO L226 Difference]: Without dead ends: 182 [2018-04-09 19:59:41,963 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=817, Invalid=6323, Unknown=0, NotChecked=0, Total=7140 [2018-04-09 19:59:41,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-09 19:59:41,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 113. [2018-04-09 19:59:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-09 19:59:41,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-04-09 19:59:41,973 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 52 [2018-04-09 19:59:41,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:41,973 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-04-09 19:59:41,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-09 19:59:41,974 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-04-09 19:59:41,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-09 19:59:41,975 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:41,975 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-09 19:59:41,975 INFO L408 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:41,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2055721887, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:41,985 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:42,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:42,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:59:42,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:42,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:59:42,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:42,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:42,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 19:59:42,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:42,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:42,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:59:42,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:42,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 19:59:42,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:42,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:42,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 19:59:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:42,190 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:42,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:59:42,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2018-04-09 19:59:42,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-09 19:59:42,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-09 19:59:42,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2018-04-09 19:59:42,505 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 31 states. [2018-04-09 19:59:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:43,656 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2018-04-09 19:59:43,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-09 19:59:43,656 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2018-04-09 19:59:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:43,657 INFO L225 Difference]: With dead ends: 178 [2018-04-09 19:59:43,657 INFO L226 Difference]: Without dead ends: 177 [2018-04-09 19:59:43,658 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=422, Invalid=2770, Unknown=0, NotChecked=0, Total=3192 [2018-04-09 19:59:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-09 19:59:43,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 127. [2018-04-09 19:59:43,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-09 19:59:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2018-04-09 19:59:43,664 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 53 [2018-04-09 19:59:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:43,664 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2018-04-09 19:59:43,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-09 19:59:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2018-04-09 19:59:43,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 19:59:43,665 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:43,665 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:59:43,665 INFO L408 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:43,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1011159860, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:43,672 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:43,689 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:43,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:43,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-09 19:59:43,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 19:59:43,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:43,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:43,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:59:43,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 19:59:43,750 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-09 19:59:43,755 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-09 19:59:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 19:59:43,767 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:43,788 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_16| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_16|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_16| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_16| 0) |c_old(#valid)|))) is different from false [2018-04-09 19:59:43,792 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_15| Int) (|v_main_#t~malloc11.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_15| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_16|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_16| 1) |v_main_#t~malloc10.base_15| 0) |v_main_#t~malloc11.base_16| 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_15|) 0))))) is different from false [2018-04-09 19:59:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 19:59:43,828 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:59:43,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 19:59:43,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 19:59:43,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 19:59:43,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 19:59:43,829 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 12 states. [2018-04-09 19:59:43,845 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_15| Int) (|v_main_#t~malloc11.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_15| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_16|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_16| 1) |v_main_#t~malloc10.base_15| 0) |v_main_#t~malloc11.base_16| 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_15|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-09 19:59:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:44,161 INFO L93 Difference]: Finished difference Result 239 states and 258 transitions. [2018-04-09 19:59:44,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:59:44,161 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-04-09 19:59:44,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:44,163 INFO L225 Difference]: With dead ends: 239 [2018-04-09 19:59:44,163 INFO L226 Difference]: Without dead ends: 227 [2018-04-09 19:59:44,163 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 19:59:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-09 19:59:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2018-04-09 19:59:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-09 19:59:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 242 transitions. [2018-04-09 19:59:44,177 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 242 transitions. Word has length 54 [2018-04-09 19:59:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:44,177 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 242 transitions. [2018-04-09 19:59:44,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 19:59:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 242 transitions. [2018-04-09 19:59:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-09 19:59:44,178 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:44,178 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:59:44,178 INFO L408 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:44,178 INFO L82 PathProgramCache]: Analyzing trace with hash 415297934, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:44,192 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:44,211 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:44,231 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 11 treesize of output 8 [2018-04-09 19:59:44,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 19:59:44,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:44,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:44,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:44,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-04-09 19:59:44,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:44,281 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:44,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-09 19:59:44,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 19:59:44,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:44,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:44,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:44,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-04-09 19:59:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:44,409 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-09 19:59:44,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 15 [2018-04-09 19:59:44,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-09 19:59:44,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-09 19:59:44,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-04-09 19:59:44,410 INFO L87 Difference]: Start difference. First operand 224 states and 242 transitions. Second operand 15 states. [2018-04-09 19:59:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:44,708 INFO L93 Difference]: Finished difference Result 296 states and 317 transitions. [2018-04-09 19:59:44,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-09 19:59:44,709 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-04-09 19:59:44,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:44,710 INFO L225 Difference]: With dead ends: 296 [2018-04-09 19:59:44,711 INFO L226 Difference]: Without dead ends: 288 [2018-04-09 19:59:44,711 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2018-04-09 19:59:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-09 19:59:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 257. [2018-04-09 19:59:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-04-09 19:59:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 279 transitions. [2018-04-09 19:59:44,730 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 279 transitions. Word has length 55 [2018-04-09 19:59:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:44,730 INFO L459 AbstractCegarLoop]: Abstraction has 257 states and 279 transitions. [2018-04-09 19:59:44,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-09 19:59:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 279 transitions. [2018-04-09 19:59:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-09 19:59:44,732 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:44,732 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:59:44,732 INFO L408 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:44,732 INFO L82 PathProgramCache]: Analyzing trace with hash -609999223, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:44,748 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:44,768 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:44,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:44,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-09 19:59:44,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:44,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 19:59:44,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:44,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:44,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:59:44,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 19:59:44,876 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-09 19:59:44,879 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-09 19:59:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 19:59:44,887 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:44,911 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_20| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_20| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_20|))))) is different from false [2018-04-09 19:59:44,915 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_20| Int) (|v_main_#t~malloc10.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_19| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_20|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_20| 1) |v_main_#t~malloc10.base_19| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_19|)))))) is different from false [2018-04-09 19:59:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 19:59:44,969 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:59:44,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 19:59:44,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 19:59:44,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 19:59:44,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 19:59:44,970 INFO L87 Difference]: Start difference. First operand 257 states and 279 transitions. Second operand 12 states. [2018-04-09 19:59:44,981 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc11.base_20| Int) (|v_main_#t~malloc10.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_19| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_20|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_20| 1) |v_main_#t~malloc10.base_19| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_19|))))))) is different from false [2018-04-09 19:59:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:45,413 INFO L93 Difference]: Finished difference Result 388 states and 419 transitions. [2018-04-09 19:59:45,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:59:45,413 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-09 19:59:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:45,415 INFO L225 Difference]: With dead ends: 388 [2018-04-09 19:59:45,416 INFO L226 Difference]: Without dead ends: 368 [2018-04-09 19:59:45,416 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 19:59:45,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-04-09 19:59:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 176. [2018-04-09 19:59:45,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-09 19:59:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-04-09 19:59:45,432 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 55 [2018-04-09 19:59:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:45,433 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-04-09 19:59:45,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 19:59:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-04-09 19:59:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-09 19:59:45,434 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:45,434 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, 1, 1, 1] [2018-04-09 19:59:45,434 INFO L408 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:45,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1776017105, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:45,443 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:45,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:45,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:45,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-09 19:59:45,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 19:59:45,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:45,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:45,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:59:45,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 19:59:45,530 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-09 19:59:45,534 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-09 19:59:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:45,542 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:45,626 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_22| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_22|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_22| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|))) is different from false [2018-04-09 19:59:45,629 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_21| Int) (|v_main_#t~malloc11.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_22| 1) |v_main_#t~malloc10.base_21| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_22|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_21|) 0))))) is different from false [2018-04-09 19:59:45,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:45,664 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:59:45,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 19:59:45,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 19:59:45,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 19:59:45,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 19:59:45,665 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 12 states. [2018-04-09 19:59:45,674 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_21| Int) (|v_main_#t~malloc11.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_22| 1) |v_main_#t~malloc10.base_21| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_22|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_21|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-09 19:59:45,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:45,974 INFO L93 Difference]: Finished difference Result 309 states and 325 transitions. [2018-04-09 19:59:45,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:59:45,974 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-04-09 19:59:45,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:45,976 INFO L225 Difference]: With dead ends: 309 [2018-04-09 19:59:45,976 INFO L226 Difference]: Without dead ends: 297 [2018-04-09 19:59:45,976 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 19:59:45,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-04-09 19:59:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 176. [2018-04-09 19:59:45,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-09 19:59:45,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-04-09 19:59:45,990 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 60 [2018-04-09 19:59:45,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:45,990 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-04-09 19:59:45,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 19:59:45,990 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-04-09 19:59:45,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-09 19:59:45,991 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:45,991 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, 1, 1, 1, 1] [2018-04-09 19:59:45,991 INFO L408 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:45,991 INFO L82 PathProgramCache]: Analyzing trace with hash -105397872, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:45,997 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:46,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:46,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:46,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-09 19:59:46,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:46,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 19:59:46,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:46,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:46,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:59:46,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 19:59:46,074 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-09 19:59:46,077 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-09 19:59:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:46,086 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:46,102 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_24| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_24| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_24|))))) is different from false [2018-04-09 19:59:46,105 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_24| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc11.base_24|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_24| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|)))) is different from false [2018-04-09 19:59:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:46,155 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:59:46,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 19:59:46,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 19:59:46,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 19:59:46,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 19:59:46,156 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 12 states. [2018-04-09 19:59:46,169 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_24| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc11.base_24|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_24| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|)))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-09 19:59:46,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:46,543 INFO L93 Difference]: Finished difference Result 250 states and 263 transitions. [2018-04-09 19:59:46,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:59:46,543 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-04-09 19:59:46,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:46,545 INFO L225 Difference]: With dead ends: 250 [2018-04-09 19:59:46,545 INFO L226 Difference]: Without dead ends: 238 [2018-04-09 19:59:46,545 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 19:59:46,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-09 19:59:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 115. [2018-04-09 19:59:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-09 19:59:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-04-09 19:59:46,564 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 61 [2018-04-09 19:59:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:46,565 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-04-09 19:59:46,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 19:59:46,566 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-04-09 19:59:46,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-09 19:59:46,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:46,566 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:59:46,566 INFO L408 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:46,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1803017946, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:46,584 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:46,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:46,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:59:46,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:46,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:59:46,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:46,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:46,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 19:59:46,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:46,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:46,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-04-09 19:59:46,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:46,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 19:59:46,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:46,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:46,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 19:59:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:46,982 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:47,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:59:47,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 48 [2018-04-09 19:59:47,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-09 19:59:47,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-09 19:59:47,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2200, Unknown=0, NotChecked=0, Total=2352 [2018-04-09 19:59:47,771 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 49 states. [2018-04-09 19:59:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:51,373 INFO L93 Difference]: Finished difference Result 178 states and 186 transitions. [2018-04-09 19:59:51,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-09 19:59:51,374 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 61 [2018-04-09 19:59:51,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:51,375 INFO L225 Difference]: With dead ends: 178 [2018-04-09 19:59:51,375 INFO L226 Difference]: Without dead ends: 177 [2018-04-09 19:59:51,377 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2329 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1219, Invalid=10553, Unknown=0, NotChecked=0, Total=11772 [2018-04-09 19:59:51,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-09 19:59:51,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 138. [2018-04-09 19:59:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-09 19:59:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 144 transitions. [2018-04-09 19:59:51,392 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 144 transitions. Word has length 61 [2018-04-09 19:59:51,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:51,393 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 144 transitions. [2018-04-09 19:59:51,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-09 19:59:51,393 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 144 transitions. [2018-04-09 19:59:51,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-09 19:59:51,393 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:51,393 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-04-09 19:59:51,394 INFO L408 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:51,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1306320949, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:51,399 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:51,422 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:51,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:59:51,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:51,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:51,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 19:59:51,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:59:51,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:51,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:51,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:51,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:59:51,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:51,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:51,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-09 19:59:51,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-09 19:59:51,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 19:59:51,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:51,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:51,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:51,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-09 19:59:51,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-09 19:59:51,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 19:59:51,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:51,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:51,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:51,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-09 19:59:51,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-09 19:59:51,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-09 19:59:51,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:59:51,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:59:51,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:59:51,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-09 19:59:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:51,733 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:52,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-04-09 19:59:52,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 19:59:52,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:52,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-04-09 19:59:52,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-09 19:59:52,423 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:52,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:52,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-09 19:59:52,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-04-09 19:59:52,428 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:52,430 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:52,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 19:59:52,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 19:59:52,455 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-04-09 19:59:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:52,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:59:52,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-04-09 19:59:52,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-09 19:59:52,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-09 19:59:52,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-04-09 19:59:52,642 INFO L87 Difference]: Start difference. First operand 138 states and 144 transitions. Second operand 42 states. [2018-04-09 19:59:53,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:59:53,970 INFO L93 Difference]: Finished difference Result 171 states and 177 transitions. [2018-04-09 19:59:53,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-09 19:59:53,971 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 67 [2018-04-09 19:59:53,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:59:53,972 INFO L225 Difference]: With dead ends: 171 [2018-04-09 19:59:53,972 INFO L226 Difference]: Without dead ends: 170 [2018-04-09 19:59:53,973 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=395, Invalid=3765, Unknown=0, NotChecked=0, Total=4160 [2018-04-09 19:59:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-09 19:59:53,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 138. [2018-04-09 19:59:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-09 19:59:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2018-04-09 19:59:53,984 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 67 [2018-04-09 19:59:53,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:59:53,985 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2018-04-09 19:59:53,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-09 19:59:53,985 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2018-04-09 19:59:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-09 19:59:53,986 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:59:53,986 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:59:53,986 INFO L408 AbstractCegarLoop]: === Iteration 19 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 19:59:53,986 INFO L82 PathProgramCache]: Analyzing trace with hash 239796070, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:59:53,994 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:59:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:59:54,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:59:54,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:59:54,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:54,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:59:54,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:54,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:54,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 19:59:54,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:54,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:59:54,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:59:54,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:54,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 19:59:54,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:59:54,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:59:54,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 19:59:54,707 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:54,707 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:59:56,139 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:59:56,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:59:56,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 68 [2018-04-09 19:59:56,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-09 19:59:56,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-09 19:59:56,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=4410, Unknown=0, NotChecked=0, Total=4692 [2018-04-09 19:59:56,162 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand 69 states. [2018-04-09 20:00:04,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:00:04,310 INFO L93 Difference]: Finished difference Result 233 states and 242 transitions. [2018-04-09 20:00:04,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-04-09 20:00:04,310 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 79 [2018-04-09 20:00:04,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:00:04,311 INFO L225 Difference]: With dead ends: 233 [2018-04-09 20:00:04,311 INFO L226 Difference]: Without dead ends: 232 [2018-04-09 20:00:04,315 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6959 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=2849, Invalid=26907, Unknown=0, NotChecked=0, Total=29756 [2018-04-09 20:00:04,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-09 20:00:04,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 200. [2018-04-09 20:00:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-09 20:00:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 206 transitions. [2018-04-09 20:00:04,345 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 206 transitions. Word has length 79 [2018-04-09 20:00:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:00:04,346 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 206 transitions. [2018-04-09 20:00:04,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-09 20:00:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 206 transitions. [2018-04-09 20:00:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-09 20:00:04,347 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:00:04,347 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2018-04-09 20:00:04,347 INFO L408 AbstractCegarLoop]: === Iteration 20 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:00:04,348 INFO L82 PathProgramCache]: Analyzing trace with hash -742476633, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:00:04,356 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:00:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:00:04,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:00:04,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:00:04,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:04,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:04,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 20:00:04,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:00:04,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:00:04,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:00:04,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:04,426 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:00:04,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:04,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:04,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-09 20:00:04,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-09 20:00:04,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 20:00:04,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:04,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:04,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:04,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-09 20:00:04,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-09 20:00:04,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 20:00:04,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:04,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:04,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:04,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-09 20:00:04,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-09 20:00:04,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 20:00:04,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:04,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:04,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:04,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-09 20:00:04,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-09 20:00:04,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-09 20:00:04,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:00:04,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:00:04,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:00:04,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-09 20:00:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 7 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:00:04,915 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:00:06,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-04-09 20:00:06,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 20:00:06,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:06,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-09 20:00:06,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 34 [2018-04-09 20:00:06,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2018-04-09 20:00:06,295 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-09 20:00:06,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-09 20:00:06,297 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:06,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2018-04-09 20:00:06,306 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-09 20:00:06,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2018-04-09 20:00:06,357 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-04-09 20:00:06,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2018-04-09 20:00:06,364 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-09 20:00:06,393 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 20:00:06,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 20:00:06,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2018-04-09 20:00:06,484 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 33 treesize of output 28 [2018-04-09 20:00:06,484 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:06,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 60 [2018-04-09 20:00:06,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2018-04-09 20:00:06,602 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-04-09 20:00:06,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-04-09 20:00:06,615 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-04-09 20:00:06,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2018-04-09 20:00:06,685 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-09 20:00:06,733 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 24 treesize of output 24 [2018-04-09 20:00:06,733 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-09 20:00:06,739 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 26 treesize of output 26 [2018-04-09 20:00:06,739 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-04-09 20:00:06,762 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 20:00:06,787 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 20:00:06,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-04-09 20:00:06,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-04-09 20:00:06,791 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:06,794 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:06,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-09 20:00:06,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 20:00:06,848 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 6 variables, input treesize:60, output treesize:84 [2018-04-09 20:00:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:00:07,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:00:07,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-04-09 20:00:07,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-09 20:00:07,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-09 20:00:07,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2474, Unknown=0, NotChecked=0, Total=2652 [2018-04-09 20:00:07,060 INFO L87 Difference]: Start difference. First operand 200 states and 206 transitions. Second operand 52 states. [2018-04-09 20:00:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:00:09,375 INFO L93 Difference]: Finished difference Result 224 states and 231 transitions. [2018-04-09 20:00:09,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-09 20:00:09,376 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 82 [2018-04-09 20:00:09,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:00:09,376 INFO L225 Difference]: With dead ends: 224 [2018-04-09 20:00:09,377 INFO L226 Difference]: Without dead ends: 223 [2018-04-09 20:00:09,377 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1327 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1176, Invalid=6306, Unknown=0, NotChecked=0, Total=7482 [2018-04-09 20:00:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-09 20:00:09,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 199. [2018-04-09 20:00:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-09 20:00:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 205 transitions. [2018-04-09 20:00:09,395 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 205 transitions. Word has length 82 [2018-04-09 20:00:09,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:00:09,396 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 205 transitions. [2018-04-09 20:00:09,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-09 20:00:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 205 transitions. [2018-04-09 20:00:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-09 20:00:09,396 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:00:09,396 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:00:09,396 INFO L408 AbstractCegarLoop]: === Iteration 21 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:00:09,397 INFO L82 PathProgramCache]: Analyzing trace with hash 466654152, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:00:09,410 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:00:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:00:09,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:00:09,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:00:09,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:09,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:00:09,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:09,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:09,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 20:00:09,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:00:09,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 20:00:09,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:09,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:00:09,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:00:09,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:00:09,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:09,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:09,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 20:00:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:00:09,912 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:00:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:00:10,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:00:10,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 54 [2018-04-09 20:00:10,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-09 20:00:10,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-09 20:00:10,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2781, Unknown=0, NotChecked=0, Total=2970 [2018-04-09 20:00:10,766 INFO L87 Difference]: Start difference. First operand 199 states and 205 transitions. Second operand 55 states. [2018-04-09 20:00:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:00:16,558 INFO L93 Difference]: Finished difference Result 379 states and 393 transitions. [2018-04-09 20:00:16,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-09 20:00:16,558 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 82 [2018-04-09 20:00:16,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:00:16,560 INFO L225 Difference]: With dead ends: 379 [2018-04-09 20:00:16,560 INFO L226 Difference]: Without dead ends: 378 [2018-04-09 20:00:16,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4860 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2029, Invalid=18851, Unknown=0, NotChecked=0, Total=20880 [2018-04-09 20:00:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-04-09 20:00:16,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 250. [2018-04-09 20:00:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-09 20:00:16,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 263 transitions. [2018-04-09 20:00:16,582 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 263 transitions. Word has length 82 [2018-04-09 20:00:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:00:16,582 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 263 transitions. [2018-04-09 20:00:16,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-09 20:00:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 263 transitions. [2018-04-09 20:00:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-09 20:00:16,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:00:16,583 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-04-09 20:00:16,583 INFO L408 AbstractCegarLoop]: === Iteration 22 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:00:16,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1541939169, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:00:16,590 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:00:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:00:16,619 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:00:16,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:00:16,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:16,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:00:16,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:16,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:16,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 20:00:16,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:00:16,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:00:16,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:00:16,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:16,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 20:00:16,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:16,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:16,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 20:00:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:00:16,940 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:00:17,562 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:00:17,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:00:17,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 46 [2018-04-09 20:00:17,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-09 20:00:17,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-09 20:00:17,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1999, Unknown=0, NotChecked=0, Total=2162 [2018-04-09 20:00:17,584 INFO L87 Difference]: Start difference. First operand 250 states and 263 transitions. Second operand 47 states. [2018-04-09 20:00:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:00:20,731 INFO L93 Difference]: Finished difference Result 383 states and 396 transitions. [2018-04-09 20:00:20,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-09 20:00:20,731 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 83 [2018-04-09 20:00:20,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:00:20,733 INFO L225 Difference]: With dead ends: 383 [2018-04-09 20:00:20,733 INFO L226 Difference]: Without dead ends: 382 [2018-04-09 20:00:20,734 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1182, Invalid=8520, Unknown=0, NotChecked=0, Total=9702 [2018-04-09 20:00:20,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-04-09 20:00:20,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 264. [2018-04-09 20:00:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-04-09 20:00:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 274 transitions. [2018-04-09 20:00:20,760 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 274 transitions. Word has length 83 [2018-04-09 20:00:20,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:00:20,761 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 274 transitions. [2018-04-09 20:00:20,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-09 20:00:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 274 transitions. [2018-04-09 20:00:20,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-09 20:00:20,761 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:00:20,761 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:00:20,761 INFO L408 AbstractCegarLoop]: === Iteration 23 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:00:20,762 INFO L82 PathProgramCache]: Analyzing trace with hash 153237420, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:00:20,772 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:00:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:00:20,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:00:20,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:00:20,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:20,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:00:20,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:20,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:20,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 20:00:20,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:00:20,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:00:20,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:00:20,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:20,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 20:00:20,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:20,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:20,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 20:00:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:00:21,469 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:00:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:00:22,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:00:22,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 66 [2018-04-09 20:00:22,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-09 20:00:22,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-09 20:00:22,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4176, Unknown=0, NotChecked=0, Total=4422 [2018-04-09 20:00:22,781 INFO L87 Difference]: Start difference. First operand 264 states and 274 transitions. Second operand 67 states. [2018-04-09 20:00:32,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:00:32,303 INFO L93 Difference]: Finished difference Result 397 states and 409 transitions. [2018-04-09 20:00:32,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-04-09 20:00:32,304 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 85 [2018-04-09 20:00:32,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:00:32,305 INFO L225 Difference]: With dead ends: 397 [2018-04-09 20:00:32,305 INFO L226 Difference]: Without dead ends: 396 [2018-04-09 20:00:32,306 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8664 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=2937, Invalid=31473, Unknown=0, NotChecked=0, Total=34410 [2018-04-09 20:00:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-04-09 20:00:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 260. [2018-04-09 20:00:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-09 20:00:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 270 transitions. [2018-04-09 20:00:32,345 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 270 transitions. Word has length 85 [2018-04-09 20:00:32,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:00:32,346 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 270 transitions. [2018-04-09 20:00:32,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-09 20:00:32,346 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 270 transitions. [2018-04-09 20:00:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-04-09 20:00:32,347 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:00:32,347 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-09 20:00:32,347 INFO L408 AbstractCegarLoop]: === Iteration 24 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:00:32,347 INFO L82 PathProgramCache]: Analyzing trace with hash -2054967898, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:00:32,356 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:00:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:00:32,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:00:32,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:00:32,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:32,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:00:32,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:32,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:32,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 20:00:32,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:00:32,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 20:00:32,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:32,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:00:32,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:00:32,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:00:32,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:32,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:32,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 20:00:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:00:33,223 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:00:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:00:34,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:00:34,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 32] total 69 [2018-04-09 20:00:34,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-09 20:00:34,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-09 20:00:34,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4581, Unknown=0, NotChecked=0, Total=4830 [2018-04-09 20:00:34,611 INFO L87 Difference]: Start difference. First operand 260 states and 270 transitions. Second operand 70 states. [2018-04-09 20:00:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:00:48,305 INFO L93 Difference]: Finished difference Result 446 states and 458 transitions. [2018-04-09 20:00:48,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-04-09 20:00:48,305 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 91 [2018-04-09 20:00:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:00:48,307 INFO L225 Difference]: With dead ends: 446 [2018-04-09 20:00:48,307 INFO L226 Difference]: Without dead ends: 445 [2018-04-09 20:00:48,309 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11664 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=3727, Invalid=41429, Unknown=0, NotChecked=0, Total=45156 [2018-04-09 20:00:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-04-09 20:00:48,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 243. [2018-04-09 20:00:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-09 20:00:48,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 252 transitions. [2018-04-09 20:00:48,349 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 252 transitions. Word has length 91 [2018-04-09 20:00:48,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:00:48,349 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 252 transitions. [2018-04-09 20:00:48,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-09 20:00:48,349 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 252 transitions. [2018-04-09 20:00:48,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-09 20:00:48,349 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:00:48,350 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:00:48,350 INFO L408 AbstractCegarLoop]: === Iteration 25 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:00:48,350 INFO L82 PathProgramCache]: Analyzing trace with hash -651400218, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:00:48,355 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:00:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:00:48,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:00:48,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:00:48,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:48,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:00:48,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:48,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:48,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 20:00:48,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:00:48,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:00:48,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:00:48,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:48,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 20:00:48,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:00:48,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:00:48,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 20:00:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:00:49,363 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:00:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:00:51,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:00:51,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42] total 84 [2018-04-09 20:00:51,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-09 20:00:51,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-09 20:00:51,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=6783, Unknown=0, NotChecked=0, Total=7140 [2018-04-09 20:00:51,495 INFO L87 Difference]: Start difference. First operand 243 states and 252 transitions. Second operand 85 states. [2018-04-09 20:00:57,446 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 69 DAG size of output 60 [2018-04-09 20:01:16,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:01:16,258 INFO L93 Difference]: Finished difference Result 529 states and 544 transitions. [2018-04-09 20:01:16,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2018-04-09 20:01:16,259 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 109 [2018-04-09 20:01:16,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:01:16,261 INFO L225 Difference]: With dead ends: 529 [2018-04-09 20:01:16,261 INFO L226 Difference]: Without dead ends: 528 [2018-04-09 20:01:16,266 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29263 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=6686, Invalid=89104, Unknown=0, NotChecked=0, Total=95790 [2018-04-09 20:01:16,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-04-09 20:01:16,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 269. [2018-04-09 20:01:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-04-09 20:01:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 279 transitions. [2018-04-09 20:01:16,306 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 279 transitions. Word has length 109 [2018-04-09 20:01:16,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:01:16,306 INFO L459 AbstractCegarLoop]: Abstraction has 269 states and 279 transitions. [2018-04-09 20:01:16,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-09 20:01:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 279 transitions. [2018-04-09 20:01:16,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-04-09 20:01:16,307 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:01:16,307 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1] [2018-04-09 20:01:16,307 INFO L408 AbstractCegarLoop]: === Iteration 26 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:01:16,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1290307198, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:01:16,315 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:01:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:01:16,348 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:01:16,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:01:16,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:01:16,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:01:16,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:01:16,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:01:16,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 20:01:16,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:01:16,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 20:01:16,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:01:16,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:01:16,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:01:16,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:01:16,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:01:16,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:01:16,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 20:01:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:01:17,739 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:01:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:01:20,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:01:20,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48] total 96 [2018-04-09 20:01:20,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-09 20:01:20,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-09 20:01:20,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=8799, Unknown=0, NotChecked=0, Total=9312 [2018-04-09 20:01:20,667 INFO L87 Difference]: Start difference. First operand 269 states and 279 transitions. Second operand 97 states. [2018-04-09 20:01:23,330 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 58 DAG size of output 56 [2018-04-09 20:01:23,833 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 61 DAG size of output 56 [2018-04-09 20:01:24,113 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 58 DAG size of output 56 [2018-04-09 20:01:24,560 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 58 DAG size of output 56 [2018-04-09 20:01:26,069 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 69 DAG size of output 67 [2018-04-09 20:01:26,354 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 68 DAG size of output 66 [2018-04-09 20:01:26,713 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 68 DAG size of output 66 [2018-04-09 20:01:27,257 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 69 DAG size of output 67 [2018-04-09 20:01:27,536 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 68 DAG size of output 66 [2018-04-09 20:01:27,846 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 71 DAG size of output 66 [2018-04-09 20:01:35,557 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 89 DAG size of output 78 [2018-04-09 20:01:35,932 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 90 DAG size of output 79 [2018-04-09 20:01:36,851 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 102 DAG size of output 80 [2018-04-09 20:01:37,208 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 98 DAG size of output 79 [2018-04-09 20:01:39,469 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 70 DAG size of output 68 [2018-04-09 20:01:40,307 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 86 DAG size of output 70 [2018-04-09 20:01:40,614 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 83 DAG size of output 69 [2018-04-09 20:01:46,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:01:46,367 INFO L93 Difference]: Finished difference Result 540 states and 556 transitions. [2018-04-09 20:01:46,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-04-09 20:01:46,367 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 112 [2018-04-09 20:01:46,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:01:46,369 INFO L225 Difference]: With dead ends: 540 [2018-04-09 20:01:46,369 INFO L226 Difference]: Without dead ends: 539 [2018-04-09 20:01:46,372 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26515 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=7398, Invalid=85932, Unknown=0, NotChecked=0, Total=93330 [2018-04-09 20:01:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-04-09 20:01:46,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 323. [2018-04-09 20:01:46,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-09 20:01:46,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 333 transitions. [2018-04-09 20:01:46,460 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 333 transitions. Word has length 112 [2018-04-09 20:01:46,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:01:46,460 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 333 transitions. [2018-04-09 20:01:46,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-09 20:01:46,461 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 333 transitions. [2018-04-09 20:01:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-04-09 20:01:46,461 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:01:46,461 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:01:46,461 INFO L408 AbstractCegarLoop]: === Iteration 27 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:01:46,462 INFO L82 PathProgramCache]: Analyzing trace with hash 990612454, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:01:46,469 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:01:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:01:46,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:01:46,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:01:46,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:01:46,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:01:46,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:01:46,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:01:46,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 20:01:46,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:01:46,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 20:01:46,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:01:46,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:01:46,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:01:46,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:01:46,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:01:46,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:01:46,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 20:01:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:01:48,477 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:01:52,358 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:01:52,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:01:52,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54] total 108 [2018-04-09 20:01:52,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-04-09 20:01:52,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-04-09 20:01:52,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=734, Invalid=11038, Unknown=0, NotChecked=0, Total=11772 [2018-04-09 20:01:52,380 INFO L87 Difference]: Start difference. First operand 323 states and 333 transitions. Second operand 109 states. [2018-04-09 20:02:07,557 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 106 DAG size of output 91 [2018-04-09 20:02:07,979 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 107 DAG size of output 92 [2018-04-09 20:02:08,358 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 82 DAG size of output 67 [2018-04-09 20:02:08,865 WARN L151 SmtUtils]: Spent 254ms on a formula simplification. DAG size of input: 124 DAG size of output 94 [2018-04-09 20:02:09,271 WARN L151 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 120 DAG size of output 93 [2018-04-09 20:02:09,781 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 76 DAG size of output 64 [2018-04-09 20:02:10,274 WARN L148 SmtUtils]: Spent 135ms on a formula simplification that was a NOOP. DAG size: 91 [2018-04-09 20:02:10,641 WARN L148 SmtUtils]: Spent 124ms on a formula simplification that was a NOOP. DAG size: 89 [2018-04-09 20:02:11,121 WARN L151 SmtUtils]: Spent 232ms on a formula simplification. DAG size of input: 87 DAG size of output 83 [2018-04-09 20:02:11,488 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 73 DAG size of output 61 [2018-04-09 20:02:11,936 WARN L151 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 109 DAG size of output 85 [2018-04-09 20:02:12,275 WARN L151 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 106 DAG size of output 84 [2018-04-09 20:02:12,724 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 69 DAG size of output 59 [2018-04-09 20:02:13,095 WARN L148 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-09 20:02:13,416 WARN L148 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 80 [2018-04-09 20:02:13,835 WARN L151 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 78 DAG size of output 76 [2018-04-09 20:02:14,357 WARN L151 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 97 DAG size of output 77 [2018-04-09 20:02:14,641 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 94 DAG size of output 76 [2018-04-09 20:02:15,445 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 69 DAG size of output 67 [2018-04-09 20:02:15,868 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 85 DAG size of output 69 [2018-04-09 20:02:16,117 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 82 DAG size of output 68 [2018-04-09 20:02:16,855 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 60 DAG size of output 58 [2018-04-09 20:02:19,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:02:19,954 INFO L93 Difference]: Finished difference Result 547 states and 564 transitions. [2018-04-09 20:02:19,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-04-09 20:02:19,954 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 115 [2018-04-09 20:02:19,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:02:19,956 INFO L225 Difference]: With dead ends: 547 [2018-04-09 20:02:19,956 INFO L226 Difference]: Without dead ends: 546 [2018-04-09 20:02:19,959 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23675 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=8245, Invalid=82055, Unknown=0, NotChecked=0, Total=90300 [2018-04-09 20:02:19,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-04-09 20:02:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 364. [2018-04-09 20:02:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-04-09 20:02:20,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 374 transitions. [2018-04-09 20:02:20,026 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 374 transitions. Word has length 115 [2018-04-09 20:02:20,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:02:20,026 INFO L459 AbstractCegarLoop]: Abstraction has 364 states and 374 transitions. [2018-04-09 20:02:20,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-04-09 20:02:20,026 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 374 transitions. [2018-04-09 20:02:20,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-04-09 20:02:20,027 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:02:20,027 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 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] [2018-04-09 20:02:20,027 INFO L408 AbstractCegarLoop]: === Iteration 28 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:02:20,028 INFO L82 PathProgramCache]: Analyzing trace with hash -2109460216, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:02:20,037 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:02:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:02:20,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:02:20,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:02:20,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:02:20,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:02:20,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:02:20,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:02:20,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 20:02:20,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:02:20,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:02:20,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:02:20,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:02:20,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 20:02:20,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:02:20,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:02:20,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 20:02:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:02:21,120 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:02:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:02:23,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:02:23,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45] total 90 [2018-04-09 20:02:23,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-09 20:02:23,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-09 20:02:23,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=7798, Unknown=0, NotChecked=0, Total=8190 [2018-04-09 20:02:23,512 INFO L87 Difference]: Start difference. First operand 364 states and 374 transitions. Second operand 91 states. [2018-04-09 20:02:36,171 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 76 DAG size of output 74 [2018-04-09 20:02:36,916 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 91 DAG size of output 74 [2018-04-09 20:02:37,244 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 88 DAG size of output 74 [2018-04-09 20:02:38,066 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 88 DAG size of output 74 [2018-04-09 20:02:40,220 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 77 DAG size of output 69 [2018-04-09 20:02:40,467 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 77 DAG size of output 65 [2018-04-09 20:02:40,832 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 77 DAG size of output 65 [2018-04-09 20:02:41,266 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 81 DAG size of output 73 [2018-04-09 20:02:47,510 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 78 DAG size of output 67 [2018-04-09 20:03:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:03:00,245 INFO L93 Difference]: Finished difference Result 908 states and 928 transitions. [2018-04-09 20:03:00,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 306 states. [2018-04-09 20:03:00,246 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 130 [2018-04-09 20:03:00,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:03:00,248 INFO L225 Difference]: With dead ends: 908 [2018-04-09 20:03:00,248 INFO L226 Difference]: Without dead ends: 907 [2018-04-09 20:03:00,254 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51304 ImplicationChecksByTransitivity, 35.9s TimeCoverageRelationStatistics Valid=9953, Invalid=144103, Unknown=0, NotChecked=0, Total=154056 [2018-04-09 20:03:00,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-04-09 20:03:00,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 428. [2018-04-09 20:03:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-04-09 20:03:00,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 446 transitions. [2018-04-09 20:03:00,329 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 446 transitions. Word has length 130 [2018-04-09 20:03:00,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:03:00,329 INFO L459 AbstractCegarLoop]: Abstraction has 428 states and 446 transitions. [2018-04-09 20:03:00,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-09 20:03:00,329 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 446 transitions. [2018-04-09 20:03:00,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-04-09 20:03:00,330 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:03:00,330 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:03:00,330 INFO L408 AbstractCegarLoop]: === Iteration 29 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:03:00,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1937855252, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:03:00,336 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:03:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:03:00,375 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:03:00,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:03:00,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:03:00,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:03:00,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:03:00,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:03:00,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 20:03:00,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:03:00,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 20:03:00,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:03:00,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:03:00,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:03:00,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:03:00,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:03:00,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:03:00,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 20:03:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:03:01,848 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:03:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:03:04,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:03:04,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51] total 102 [2018-04-09 20:03:04,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-04-09 20:03:04,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-04-09 20:03:04,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=10011, Unknown=0, NotChecked=0, Total=10506 [2018-04-09 20:03:04,921 INFO L87 Difference]: Start difference. First operand 428 states and 446 transitions. Second operand 103 states. [2018-04-09 20:03:16,618 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 73 DAG size of output 71 [2018-04-09 20:03:17,692 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 83 DAG size of output 70 [2018-04-09 20:03:18,188 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 80 DAG size of output 70 [2018-04-09 20:03:19,635 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 80 DAG size of output 70 [2018-04-09 20:03:21,954 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 72 DAG size of output 66 [2018-04-09 20:03:22,906 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 79 DAG size of output 73 [2018-04-09 20:03:23,371 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 78 DAG size of output 72 [2018-04-09 20:03:23,775 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 69 DAG size of output 61 [2018-04-09 20:03:23,978 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 78 DAG size of output 72 [2018-04-09 20:03:24,329 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 69 DAG size of output 61 [2018-04-09 20:03:24,998 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 80 DAG size of output 74 [2018-04-09 20:03:25,419 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 79 DAG size of output 73 [2018-04-09 20:03:25,743 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 82 DAG size of output 73 [2018-04-09 20:03:26,986 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 75 DAG size of output 69 [2018-04-09 20:03:29,519 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 72 DAG size of output 68 [2018-04-09 20:03:29,728 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 81 DAG size of output 72 [2018-04-09 20:03:30,126 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 71 DAG size of output 67 [2018-04-09 20:03:30,769 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 71 DAG size of output 67 [2018-04-09 20:03:31,649 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 73 DAG size of output 69 [2018-04-09 20:03:32,487 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 75 DAG size of output 68 [2018-04-09 20:03:34,786 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 90 DAG size of output 72 [2018-04-09 20:03:35,310 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 86 DAG size of output 71 [2018-04-09 20:03:38,049 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 64 DAG size of output 62 [2018-04-09 20:03:40,096 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 66 DAG size of output 64 Received shutdown request... [2018-04-09 20:03:40,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 250 states. [2018-04-09 20:03:40,922 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 20:03:40,925 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 20:03:40,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 08:03:40 BoogieIcfgContainer [2018-04-09 20:03:40,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 20:03:40,926 INFO L168 Benchmark]: Toolchain (without parser) took 246838.97 ms. Allocated memory was 305.7 MB in the beginning and 510.7 MB in the end (delta: 205.0 MB). Free memory was 241.9 MB in the beginning and 330.4 MB in the end (delta: -88.5 MB). Peak memory consumption was 116.5 MB. Max. memory is 5.3 GB. [2018-04-09 20:03:40,928 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 305.7 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 20:03:40,928 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.66 ms. Allocated memory is still 305.7 MB. Free memory was 240.9 MB in the beginning and 217.0 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-09 20:03:40,928 INFO L168 Benchmark]: Boogie Preprocessor took 58.45 ms. Allocated memory is still 305.7 MB. Free memory was 217.0 MB in the beginning and 215.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-09 20:03:40,928 INFO L168 Benchmark]: RCFGBuilder took 500.80 ms. Allocated memory was 305.7 MB in the beginning and 463.5 MB in the end (delta: 157.8 MB). Free memory was 215.0 MB in the beginning and 398.7 MB in the end (delta: -183.7 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB. [2018-04-09 20:03:40,929 INFO L168 Benchmark]: TraceAbstraction took 245959.16 ms. Allocated memory was 463.5 MB in the beginning and 510.7 MB in the end (delta: 47.2 MB). Free memory was 397.4 MB in the beginning and 330.4 MB in the end (delta: 67.0 MB). Peak memory consumption was 114.2 MB. Max. memory is 5.3 GB. [2018-04-09 20:03:40,930 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.25 ms. Allocated memory is still 305.7 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 315.66 ms. Allocated memory is still 305.7 MB. Free memory was 240.9 MB in the beginning and 217.0 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 58.45 ms. Allocated memory is still 305.7 MB. Free memory was 217.0 MB in the beginning and 215.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 500.80 ms. Allocated memory was 305.7 MB in the beginning and 463.5 MB in the end (delta: 157.8 MB). Free memory was 215.0 MB in the beginning and 398.7 MB in the end (delta: -183.7 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 245959.16 ms. Allocated memory was 463.5 MB in the beginning and 510.7 MB in the end (delta: 47.2 MB). Free memory was 397.4 MB in the beginning and 330.4 MB in the end (delta: 67.0 MB). Peak memory consumption was 114.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 250 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 250 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 250 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 250 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 250 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 250 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 250 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 558]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 558). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 250 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 250 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 91 locations, 9 error locations. TIMEOUT Result, 245.9s OverallTime, 29 OverallIterations, 8 TraceHistogramMax, 205.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2264 SDtfs, 19983 SDslu, 46176 SDs, 0 SdLazy, 49392 SolverSat, 3980 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5832 GetRequests, 2761 SyntacticMatches, 17 SemanticMatches, 3053 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 206984 ImplicationChecksByTransitivity, 211.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=428occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 2464 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 38.1s InterpolantComputationTime, 1950 NumberOfCodeBlocks, 1950 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3842 ConstructedInterpolants, 309 QuantifiedInterpolants, 4964817 SizeOfPredicates, 783 NumberOfNonLiveVariables, 5620 ConjunctsInSsa, 1492 ConjunctsInUnsatCore, 58 InterpolantComputations, 27 PerfectInterpolantSequences, 17/2408 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/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_20-03-40-936.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_20-03-40-936.csv Completed graceful shutdown