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-8168ed2-m [2018-04-11 20:16:55,046 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 20:16:55,047 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 20:16:55,060 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 20:16:55,061 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 20:16:55,061 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 20:16:55,062 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 20:16:55,064 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 20:16:55,066 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 20:16:55,067 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 20:16:55,068 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 20:16:55,068 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 20:16:55,069 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 20:16:55,071 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 20:16:55,071 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 20:16:55,073 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 20:16:55,075 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 20:16:55,077 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 20:16:55,078 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 20:16:55,080 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 20:16:55,082 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 20:16:55,082 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 20:16:55,082 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 20:16:55,083 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 20:16:55,084 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 20:16:55,086 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 20:16:55,086 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 20:16:55,087 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 20:16:55,087 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 20:16:55,088 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 20:16:55,088 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 20:16:55,089 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-11 20:16:55,112 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 20:16:55,112 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 20:16:55,112 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-11 20:16:55,112 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-11 20:16:55,113 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-11 20:16:55,113 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-11 20:16:55,113 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-11 20:16:55,114 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-11 20:16:55,114 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-11 20:16:55,114 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-11 20:16:55,114 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-11 20:16:55,114 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-11 20:16:55,114 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 20:16:55,115 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 20:16:55,115 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 20:16:55,115 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 20:16:55,115 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 20:16:55,115 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 20:16:55,115 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 20:16:55,115 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-11 20:16:55,115 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 20:16:55,116 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 20:16:55,116 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 20:16:55,116 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-11 20:16:55,116 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-11 20:16:55,116 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 20:16:55,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 20:16:55,117 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 20:16:55,117 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 20:16:55,117 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 20:16:55,117 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-11 20:16:55,117 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-11 20:16:55,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:16:55,117 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-11 20:16:55,118 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-11 20:16:55,118 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-11 20:16:55,119 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-11 20:16:55,119 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-11 20:16:55,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 20:16:55,161 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 20:16:55,164 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 20:16:55,165 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 20:16:55,165 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 20:16:55,166 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-11 20:16:55,442 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf2073edcd [2018-04-11 20:16:55,636 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 20:16:55,636 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 20:16:55,637 INFO L168 CDTParser]: Scanning cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:16:55,648 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 20:16:55,648 INFO L215 ultiparseSymbolTable]: [2018-04-11 20:16:55,648 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 20:16:55,649 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-11 20:16:55,649 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-11 20:16:55,649 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:16:55,649 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-11 20:16:55,649 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 20:16:55,649 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-11 20:16:55,649 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-11 20:16:55,649 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-11 20:16:55,650 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-11 20:16:55,650 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-11 20:16:55,650 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-11 20:16:55,650 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-11 20:16:55,650 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-11 20:16:55,650 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-11 20:16:55,650 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-11 20:16:55,650 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-11 20:16:55,651 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-11 20:16:55,651 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-11 20:16:55,651 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-11 20:16:55,651 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-11 20:16:55,651 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-11 20:16:55,651 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-11 20:16:55,651 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-11 20:16:55,651 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-11 20:16:55,652 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-11 20:16:55,652 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-11 20:16:55,652 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-11 20:16:55,652 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-11 20:16:55,652 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-11 20:16:55,652 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-11 20:16:55,652 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-11 20:16:55,652 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-11 20:16:55,652 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-11 20:16:55,653 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-11 20:16:55,653 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-11 20:16:55,653 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-11 20:16:55,653 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-11 20:16:55,653 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-11 20:16:55,653 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-11 20:16:55,653 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-11 20:16:55,653 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-11 20:16:55,654 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-11 20:16:55,654 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-11 20:16:55,654 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-11 20:16:55,654 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-11 20:16:55,654 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-11 20:16:55,654 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-11 20:16:55,654 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-11 20:16:55,654 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-11 20:16:55,654 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-11 20:16:55,654 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-11 20:16:55,654 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-11 20:16:55,655 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-11 20:16:55,655 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-11 20:16:55,655 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-11 20:16:55,655 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-11 20:16:55,655 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-11 20:16:55,655 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-11 20:16:55,655 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-11 20:16:55,655 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-11 20:16:55,655 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-11 20:16:55,655 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-11 20:16:55,656 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-11 20:16:55,656 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-11 20:16:55,656 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-11 20:16:55,656 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-11 20:16:55,656 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-11 20:16:55,656 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-11 20:16:55,656 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-11 20:16:55,656 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-11 20:16:55,656 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-11 20:16:55,657 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-11 20:16:55,657 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-11 20:16:55,657 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-11 20:16:55,657 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-11 20:16:55,657 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-11 20:16:55,657 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-11 20:16:55,657 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-11 20:16:55,657 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-11 20:16:55,657 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-11 20:16:55,657 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-11 20:16:55,658 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-11 20:16:55,658 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-11 20:16:55,658 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-11 20:16:55,658 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-11 20:16:55,658 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-11 20:16:55,658 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-11 20:16:55,658 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-11 20:16:55,658 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-11 20:16:55,658 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-11 20:16:55,658 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-11 20:16:55,659 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-11 20:16:55,659 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-11 20:16:55,659 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-11 20:16:55,659 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-11 20:16:55,659 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-11 20:16:55,659 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-11 20:16:55,659 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-11 20:16:55,659 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-11 20:16:55,659 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-11 20:16:55,659 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-11 20:16:55,659 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-11 20:16:55,659 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-11 20:16:55,660 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-11 20:16:55,660 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-11 20:16:55,660 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-11 20:16:55,660 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-11 20:16:55,660 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-11 20:16:55,660 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-11 20:16:55,660 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-11 20:16:55,660 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-11 20:16:55,660 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-11 20:16:55,660 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-11 20:16:55,660 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-11 20:16:55,660 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-11 20:16:55,661 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-11 20:16:55,661 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-11 20:16:55,661 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-11 20:16:55,661 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-11 20:16:55,661 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-11 20:16:55,661 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-11 20:16:55,661 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-11 20:16:55,661 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-11 20:16:55,661 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-11 20:16:55,661 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-11 20:16:55,678 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf2073edcd [2018-04-11 20:16:55,683 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 20:16:55,685 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 20:16:55,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 20:16:55,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 20:16:55,693 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 20:16:55,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 08:16:55" (1/1) ... [2018-04-11 20:16:55,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4ecdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:16:55, skipping insertion in model container [2018-04-11 20:16:55,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 08:16:55" (1/1) ... [2018-04-11 20:16:55,710 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 20:16:55,739 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 20:16:55,912 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 20:16:55,962 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 20:16:55,969 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 20:16:56,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:16:56 WrapperNode [2018-04-11 20:16:56,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 20:16:56,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 20:16:56,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 20:16:56,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 20:16:56,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:16:56" (1/1) ... [2018-04-11 20:16:56,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:16:56" (1/1) ... [2018-04-11 20:16:56,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:16:56" (1/1) ... [2018-04-11 20:16:56,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:16:56" (1/1) ... [2018-04-11 20:16:56,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:16:56" (1/1) ... [2018-04-11 20:16:56,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:16:56" (1/1) ... [2018-04-11 20:16:56,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:16:56" (1/1) ... [2018-04-11 20:16:56,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 20:16:56,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 20:16:56,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 20:16:56,057 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 20:16:56,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:16:56" (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-11 20:16:56,180 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 20:16:56,180 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 20:16:56,180 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 20:16:56,180 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 20:16:56,180 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-04-11 20:16:56,180 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 20:16:56,180 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 20:16:56,181 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 20:16:56,181 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 20:16:56,181 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 20:16:56,181 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 20:16:56,181 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 20:16:56,181 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 20:16:56,181 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 20:16:56,181 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 20:16:56,181 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 20:16:56,181 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 20:16:56,182 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 20:16:56,182 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 20:16:56,182 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 20:16:56,182 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 20:16:56,182 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 20:16:56,182 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 20:16:56,182 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 20:16:56,182 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 20:16:56,182 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 20:16:56,182 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 20:16:56,183 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 20:16:56,183 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 20:16:56,183 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 20:16:56,183 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 20:16:56,183 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 20:16:56,183 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 20:16:56,183 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 20:16:56,183 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 20:16:56,183 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 20:16:56,184 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 20:16:56,184 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 20:16:56,184 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 20:16:56,184 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 20:16:56,184 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 20:16:56,184 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 20:16:56,184 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 20:16:56,184 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 20:16:56,185 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 20:16:56,185 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 20:16:56,185 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 20:16:56,185 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 20:16:56,185 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 20:16:56,185 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 20:16:56,185 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 20:16:56,186 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 20:16:56,186 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 20:16:56,186 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 20:16:56,186 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 20:16:56,186 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 20:16:56,186 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 20:16:56,186 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 20:16:56,186 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 20:16:56,187 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 20:16:56,187 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 20:16:56,187 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 20:16:56,187 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 20:16:56,187 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 20:16:56,187 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 20:16:56,187 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 20:16:56,187 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 20:16:56,187 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 20:16:56,188 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 20:16:56,188 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 20:16:56,188 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 20:16:56,188 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 20:16:56,188 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 20:16:56,188 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 20:16:56,188 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 20:16:56,188 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 20:16:56,189 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 20:16:56,189 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 20:16:56,189 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 20:16:56,189 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 20:16:56,189 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 20:16:56,189 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 20:16:56,189 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 20:16:56,189 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 20:16:56,190 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 20:16:56,190 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 20:16:56,190 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 20:16:56,190 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 20:16:56,190 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 20:16:56,190 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 20:16:56,190 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 20:16:56,191 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 20:16:56,191 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 20:16:56,191 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 20:16:56,191 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 20:16:56,191 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 20:16:56,191 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 20:16:56,191 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 20:16:56,191 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 20:16:56,192 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 20:16:56,192 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 20:16:56,192 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 20:16:56,192 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 20:16:56,192 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 20:16:56,192 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 20:16:56,192 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 20:16:56,192 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 20:16:56,192 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 20:16:56,193 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 20:16:56,193 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-04-11 20:16:56,193 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 20:16:56,193 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 20:16:56,193 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 20:16:56,193 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 20:16:56,193 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 20:16:56,193 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 20:16:56,194 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 20:16:56,194 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 20:16:56,599 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 20:16:56,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 08:16:56 BoogieIcfgContainer [2018-04-11 20:16:56,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 20:16:56,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 20:16:56,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 20:16:56,603 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 20:16:56,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 08:16:55" (1/3) ... [2018-04-11 20:16:56,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626592c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 08:16:56, skipping insertion in model container [2018-04-11 20:16:56,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:16:56" (2/3) ... [2018-04-11 20:16:56,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626592c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 08:16:56, skipping insertion in model container [2018-04-11 20:16:56,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 08:16:56" (3/3) ... [2018-04-11 20:16:56,606 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:16:56,613 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 20:16:56,620 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-04-11 20:16:56,657 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 20:16:56,658 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 20:16:56,658 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-11 20:16:56,658 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 20:16:56,658 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 20:16:56,658 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 20:16:56,658 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 20:16:56,658 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 20:16:56,658 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 20:16:56,659 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 20:16:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-04-11 20:16:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 20:16:56,679 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:16:56,680 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-11 20:16:56,680 INFO L408 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:16:56,685 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-11 20:16:56,698 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:16:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:16:56,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:16:56,778 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-11 20:16:56,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:16:56,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:16:56,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 20:16:56,798 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-11 20:16:56,798 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:16:56,808 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-11 20:16:56,831 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:16:56,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 20:16:56,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 20:16:56,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 20:16:56,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 20:16:56,845 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 4 states. [2018-04-11 20:16:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:16:56,979 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-04-11 20:16:56,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 20:16:56,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-11 20:16:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:16:56,990 INFO L225 Difference]: With dead ends: 95 [2018-04-11 20:16:56,991 INFO L226 Difference]: Without dead ends: 77 [2018-04-11 20:16:56,994 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-11 20:16:57,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-11 20:16:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-04-11 20:16:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-11 20:16:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-04-11 20:16:57,030 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 19 [2018-04-11 20:16:57,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:16:57,030 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-04-11 20:16:57,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 20:16:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-04-11 20:16:57,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 20:16:57,031 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:16:57,031 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-11 20:16:57,031 INFO L408 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:16:57,032 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-11 20:16:57,038 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:16:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:16:57,054 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:16:57,076 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-11 20:16:57,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:16:57,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:16:57,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 20:16:57,098 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-11 20:16:57,098 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:16:57,124 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-11 20:16:57,155 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:16:57,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-11 20:16:57,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 20:16:57,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 20:16:57,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 20:16:57,158 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 7 states. [2018-04-11 20:16:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:16:57,267 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-04-11 20:16:57,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 20:16:57,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-04-11 20:16:57,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:16:57,269 INFO L225 Difference]: With dead ends: 77 [2018-04-11 20:16:57,269 INFO L226 Difference]: Without dead ends: 76 [2018-04-11 20:16:57,270 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-11 20:16:57,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-04-11 20:16:57,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-04-11 20:16:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-11 20:16:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-04-11 20:16:57,279 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 19 [2018-04-11 20:16:57,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:16:57,280 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-04-11 20:16:57,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 20:16:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-04-11 20:16:57,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 20:16:57,281 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:16:57,282 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-11 20:16:57,282 INFO L408 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:16:57,282 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-11 20:16:57,297 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:16:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:16:57,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:16:57,359 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-11 20:16:57,360 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:16:57,372 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-11 20:16:57,402 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:16:57,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-11 20:16:57,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 20:16:57,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 20:16:57,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 20:16:57,404 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 7 states. [2018-04-11 20:16:57,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:16:57,595 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-04-11 20:16:57,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 20:16:57,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-04-11 20:16:57,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:16:57,596 INFO L225 Difference]: With dead ends: 76 [2018-04-11 20:16:57,596 INFO L226 Difference]: Without dead ends: 75 [2018-04-11 20:16:57,597 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-11 20:16:57,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-11 20:16:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-11 20:16:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-11 20:16:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-04-11 20:16:57,602 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 37 [2018-04-11 20:16:57,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:16:57,602 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-04-11 20:16:57,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 20:16:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-04-11 20:16:57,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 20:16:57,603 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:16:57,603 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-11 20:16:57,603 INFO L408 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:16:57,603 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-11 20:16:57,609 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:16:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:16:57,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:16:57,722 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-11 20:16:57,722 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:16:57,738 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-11 20:16:57,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:16:57,748 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-11 20:16:57,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:16:57,758 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-11 20:16:57,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-11 20:16:57,783 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-11 20:16:57,802 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:16:57,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2018-04-11 20:16:57,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 20:16:57,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 20:16:57,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 20:16:57,804 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 10 states. [2018-04-11 20:16:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:16:58,052 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-04-11 20:16:58,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 20:16:58,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-04-11 20:16:58,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:16:58,055 INFO L225 Difference]: With dead ends: 89 [2018-04-11 20:16:58,056 INFO L226 Difference]: Without dead ends: 88 [2018-04-11 20:16:58,056 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-11 20:16:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-11 20:16:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2018-04-11 20:16:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-11 20:16:58,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-04-11 20:16:58,065 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 37 [2018-04-11 20:16:58,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:16:58,066 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-04-11 20:16:58,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 20:16:58,066 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-04-11 20:16:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 20:16:58,067 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:16:58,067 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:16:58,067 INFO L408 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:16:58,068 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-11 20:16:58,083 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:16:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:16:58,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:16:58,113 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-11 20:16:58,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:16:58,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:16:58,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 20:16:58,128 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-11 20:16:58,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:16:58,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:16:58,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 20:16:58,177 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-11 20:16:58,177 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:16:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:16:58,226 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:16:58,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2018-04-11 20:16:58,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 20:16:58,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 20:16:58,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-04-11 20:16:58,227 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 12 states. [2018-04-11 20:16:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:16:58,406 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-04-11 20:16:58,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 20:16:58,406 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-04-11 20:16:58,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:16:58,407 INFO L225 Difference]: With dead ends: 85 [2018-04-11 20:16:58,407 INFO L226 Difference]: Without dead ends: 84 [2018-04-11 20:16:58,408 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-11 20:16:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-11 20:16:58,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-04-11 20:16:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-11 20:16:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-04-11 20:16:58,413 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 38 [2018-04-11 20:16:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:16:58,413 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-04-11 20:16:58,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 20:16:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-04-11 20:16:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 20:16:58,414 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:16:58,414 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-11 20:16:58,414 INFO L408 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:16:58,414 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-11 20:16:58,421 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:16:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:16:58,442 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:16:58,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-11 20:16:58,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:16:58,454 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-11 20:16:58,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:16:58,459 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-11 20:16:58,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 20:16:58,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:16:58,479 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-11 20:16:58,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:16:58,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:16:58,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:16:58,491 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-11 20:16:58,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:16:58,497 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-11 20:16:58,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:16:58,557 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-11 20:16:58,557 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:16:58,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-04-11 20:16:58,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:16:58,725 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-11 20:16:58,733 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 20:16:58,734 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 20:16:58,735 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-11 20:16:58,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 20:16:58,738 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:16:58,740 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-11 20:16:58,740 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2018-04-11 20:16:58,746 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-11 20:16:58,766 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:16:58,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 17 [2018-04-11 20:16:58,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 20:16:58,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 20:16:58,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-04-11 20:16:58,767 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 18 states. [2018-04-11 20:16:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:16:59,087 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-04-11 20:16:59,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 20:16:59,087 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-04-11 20:16:59,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:16:59,088 INFO L225 Difference]: With dead ends: 92 [2018-04-11 20:16:59,088 INFO L226 Difference]: Without dead ends: 91 [2018-04-11 20:16:59,088 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-11 20:16:59,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-11 20:16:59,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-04-11 20:16:59,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-11 20:16:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-04-11 20:16:59,096 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 38 [2018-04-11 20:16:59,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:16:59,097 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-04-11 20:16:59,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 20:16:59,097 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-04-11 20:16:59,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 20:16:59,098 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:16:59,098 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-11 20:16:59,098 INFO L408 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:16:59,098 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-11 20:16:59,104 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:16:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:16:59,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:16:59,155 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-11 20:16:59,155 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:16:59,196 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-11 20:16:59,216 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:16:59,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2018-04-11 20:16:59,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 20:16:59,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 20:16:59,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 20:16:59,217 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 6 states. [2018-04-11 20:16:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:16:59,235 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-04-11 20:16:59,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 20:16:59,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-04-11 20:16:59,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:16:59,236 INFO L225 Difference]: With dead ends: 96 [2018-04-11 20:16:59,237 INFO L226 Difference]: Without dead ends: 85 [2018-04-11 20:16:59,237 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-11 20:16:59,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-11 20:16:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-04-11 20:16:59,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-11 20:16:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-04-11 20:16:59,243 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 39 [2018-04-11 20:16:59,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:16:59,243 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-04-11 20:16:59,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 20:16:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-04-11 20:16:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 20:16:59,244 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:16:59,244 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-11 20:16:59,245 INFO L408 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:16:59,245 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-11 20:16:59,250 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:16:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:16:59,277 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:16:59,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 20:16:59,320 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-11 20:16:59,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:16:59,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:16:59,329 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-11 20:16:59,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-04-11 20:16:59,439 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-11 20:16:59,446 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-11 20:16:59,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:16:59,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:16:59,460 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-11 20:16:59,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-04-11 20:16:59,538 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-11 20:16:59,538 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:16:59,858 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-11 20:16:59,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:16:59,872 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-11 20:16:59,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11 20:16:59,884 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 20:16:59,886 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:16:59,894 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-11 20:16:59,894 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-04-11 20:16:59,905 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-11 20:16:59,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:16:59,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-11 20:16:59,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 20:16:59,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 20:16:59,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-04-11 20:16:59,929 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 21 states. [2018-04-11 20:17:00,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:17:00,563 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2018-04-11 20:17:00,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 20:17:00,563 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-04-11 20:17:00,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:17:00,564 INFO L225 Difference]: With dead ends: 113 [2018-04-11 20:17:00,564 INFO L226 Difference]: Without dead ends: 112 [2018-04-11 20:17:00,565 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2018-04-11 20:17:00,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-11 20:17:00,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 99. [2018-04-11 20:17:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-11 20:17:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-04-11 20:17:00,572 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 52 [2018-04-11 20:17:00,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:17:00,573 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-04-11 20:17:00,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 20:17:00,573 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-04-11 20:17:00,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 20:17:00,574 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:17:00,574 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-11 20:17:00,575 INFO L408 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:17:00,575 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-11 20:17:00,593 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:17:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:17:00,621 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:17:00,641 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-11 20:17:00,641 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:17:00,647 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-11 20:17:00,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:00,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:00,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-04-11 20:17:00,654 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-11 20:17:00,674 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:17:00,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-11 20:17:00,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 20:17:00,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 20:17:00,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 20:17:00,675 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 6 states. [2018-04-11 20:17:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:17:00,740 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-04-11 20:17:00,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 20:17:00,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-04-11 20:17:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:17:00,742 INFO L225 Difference]: With dead ends: 102 [2018-04-11 20:17:00,742 INFO L226 Difference]: Without dead ends: 101 [2018-04-11 20:17:00,742 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-11 20:17:00,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-11 20:17:00,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-04-11 20:17:00,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-11 20:17:00,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-04-11 20:17:00,750 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 52 [2018-04-11 20:17:00,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:17:00,750 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-04-11 20:17:00,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 20:17:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-04-11 20:17:00,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 20:17:00,751 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:17:00,752 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-11 20:17:00,752 INFO L408 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:17:00,752 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-11 20:17:00,759 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:17:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:17:00,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:17:00,794 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-11 20:17:00,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:00,800 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-11 20:17:00,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:00,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:00,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:17:00,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:00,817 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-11 20:17:00,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:00,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:00,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:00,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-11 20:17:00,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:00,830 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-11 20:17:00,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:17:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:17:01,055 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:17:01,505 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-11 20:17:01,525 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:17:01,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 38 [2018-04-11 20:17:01,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 20:17:01,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 20:17:01,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 20:17:01,526 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 39 states. [2018-04-11 20:17:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:17:03,682 INFO L93 Difference]: Finished difference Result 183 states and 196 transitions. [2018-04-11 20:17:03,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-11 20:17:03,719 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-04-11 20:17:03,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:17:03,720 INFO L225 Difference]: With dead ends: 183 [2018-04-11 20:17:03,720 INFO L226 Difference]: Without dead ends: 182 [2018-04-11 20:17:03,721 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-11 20:17:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-11 20:17:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 113. [2018-04-11 20:17:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-11 20:17:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-04-11 20:17:03,730 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 52 [2018-04-11 20:17:03,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:17:03,730 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-04-11 20:17:03,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 20:17:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-04-11 20:17:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 20:17:03,731 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:17:03,731 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-11 20:17:03,732 INFO L408 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:17:03,732 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-11 20:17:03,737 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:17:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:17:03,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:17:03,768 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-11 20:17:03,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:03,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:17:03,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:03,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:03,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:17:03,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:03,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:03,796 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-11 20:17:03,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:03,804 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-11 20:17:03,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:03,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:03,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:17:03,938 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-11 20:17:03,939 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:17:04,226 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-11 20:17:04,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:17:04,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2018-04-11 20:17:04,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 20:17:04,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 20:17:04,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2018-04-11 20:17:04,246 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 31 states. [2018-04-11 20:17:05,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:17:05,376 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2018-04-11 20:17:05,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 20:17:05,376 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2018-04-11 20:17:05,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:17:05,377 INFO L225 Difference]: With dead ends: 178 [2018-04-11 20:17:05,377 INFO L226 Difference]: Without dead ends: 177 [2018-04-11 20:17:05,378 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-11 20:17:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-11 20:17:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 127. [2018-04-11 20:17:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-11 20:17:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2018-04-11 20:17:05,385 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 53 [2018-04-11 20:17:05,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:17:05,385 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2018-04-11 20:17:05,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 20:17:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2018-04-11 20:17:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 20:17:05,386 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:17:05,386 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-11 20:17:05,386 INFO L408 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:17:05,386 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-11 20:17:05,397 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:17:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:17:05,414 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:17:05,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:05,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-11 20:17:05,441 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-11 20:17:05,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:05,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:05,447 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-11 20:17:05,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 20:17:05,481 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-11 20:17:05,485 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-11 20:17:05,493 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-11 20:17:05,493 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:17:05,512 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-11 20:17:05,515 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-11 20:17:05,528 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-11 20:17:05,548 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:17:05,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-11 20:17:05,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 20:17:05,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 20:17:05,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-11 20:17:05,549 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 12 states. [2018-04-11 20:17:05,559 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-11 20:17:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:17:05,863 INFO L93 Difference]: Finished difference Result 239 states and 258 transitions. [2018-04-11 20:17:05,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 20:17:05,863 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-04-11 20:17:05,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:17:05,865 INFO L225 Difference]: With dead ends: 239 [2018-04-11 20:17:05,866 INFO L226 Difference]: Without dead ends: 227 [2018-04-11 20:17:05,866 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-11 20:17:05,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-11 20:17:05,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2018-04-11 20:17:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-11 20:17:05,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 242 transitions. [2018-04-11 20:17:05,881 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 242 transitions. Word has length 54 [2018-04-11 20:17:05,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:17:05,881 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 242 transitions. [2018-04-11 20:17:05,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 20:17:05,881 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 242 transitions. [2018-04-11 20:17:05,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 20:17:05,882 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:17:05,882 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-11 20:17:05,882 INFO L408 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:17:05,883 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-11 20:17:05,889 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:17:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:17:05,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:17:05,924 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-11 20:17:05,925 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-11 20:17:05,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:05,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:05,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:05,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-04-11 20:17:05,974 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-11 20:17:05,974 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:17:06,072 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-11 20:17:06,080 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-11 20:17:06,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:06,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:06,083 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-11 20:17:06,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-04-11 20:17:06,093 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-11 20:17:06,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 20:17:06,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 15 [2018-04-11 20:17:06,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 20:17:06,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 20:17:06,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-04-11 20:17:06,124 INFO L87 Difference]: Start difference. First operand 224 states and 242 transitions. Second operand 15 states. [2018-04-11 20:17:06,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:17:06,398 INFO L93 Difference]: Finished difference Result 296 states and 317 transitions. [2018-04-11 20:17:06,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 20:17:06,399 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-04-11 20:17:06,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:17:06,402 INFO L225 Difference]: With dead ends: 296 [2018-04-11 20:17:06,402 INFO L226 Difference]: Without dead ends: 288 [2018-04-11 20:17:06,403 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2018-04-11 20:17:06,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-11 20:17:06,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 257. [2018-04-11 20:17:06,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-04-11 20:17:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 279 transitions. [2018-04-11 20:17:06,430 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 279 transitions. Word has length 55 [2018-04-11 20:17:06,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:17:06,431 INFO L459 AbstractCegarLoop]: Abstraction has 257 states and 279 transitions. [2018-04-11 20:17:06,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 20:17:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 279 transitions. [2018-04-11 20:17:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 20:17:06,433 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:17:06,433 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-11 20:17:06,433 INFO L408 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:17:06,434 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-11 20:17:06,446 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:17:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:17:06,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:17:06,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:06,496 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-11 20:17:06,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17: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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 20:17:06,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:06,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:06,531 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-11 20:17:06,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 20:17:06,590 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-11 20:17:06,594 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-11 20:17:06,603 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-11 20:17:06,603 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:17:06,638 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-11 20:17:06,642 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-11 20:17:06,675 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-11 20:17:06,695 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:17:06,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-11 20:17:06,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 20:17:06,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 20:17:06,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-11 20:17:06,696 INFO L87 Difference]: Start difference. First operand 257 states and 279 transitions. Second operand 12 states. [2018-04-11 20:17:06,705 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-11 20:17:07,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:17:07,179 INFO L93 Difference]: Finished difference Result 388 states and 419 transitions. [2018-04-11 20:17:07,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 20:17:07,179 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-11 20:17:07,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:17:07,180 INFO L225 Difference]: With dead ends: 388 [2018-04-11 20:17:07,180 INFO L226 Difference]: Without dead ends: 368 [2018-04-11 20:17:07,181 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-11 20:17:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-04-11 20:17:07,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 176. [2018-04-11 20:17:07,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 20:17:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-04-11 20:17:07,192 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 55 [2018-04-11 20:17:07,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:17:07,192 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-04-11 20:17:07,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 20:17:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-04-11 20:17:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 20:17:07,193 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:17:07,193 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-11 20:17:07,193 INFO L408 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:17:07,194 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-11 20:17:07,200 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:17:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:17:07,219 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:17:07,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:07,241 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-11 20:17:07,243 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-11 20:17:07,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:07,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:07,250 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-11 20:17:07,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 20:17:07,283 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-11 20:17:07,287 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-11 20:17:07,295 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-11 20:17:07,296 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:17:07,338 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-11 20:17:07,342 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-11 20:17:07,366 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-11 20:17:07,386 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:17:07,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-11 20:17:07,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 20:17:07,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 20:17:07,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-11 20:17:07,387 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 12 states. [2018-04-11 20:17:07,396 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-11 20:17:07,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:17:07,959 INFO L93 Difference]: Finished difference Result 309 states and 325 transitions. [2018-04-11 20:17:07,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 20:17:07,959 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-04-11 20:17:07,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:17:07,960 INFO L225 Difference]: With dead ends: 309 [2018-04-11 20:17:07,960 INFO L226 Difference]: Without dead ends: 297 [2018-04-11 20:17:07,961 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-11 20:17:07,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-04-11 20:17:07,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 176. [2018-04-11 20:17:07,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 20:17:07,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-04-11 20:17:07,973 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 60 [2018-04-11 20:17:07,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:17:07,973 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-04-11 20:17:07,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 20:17:07,974 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-04-11 20:17:07,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 20:17:07,974 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:17:07,974 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-11 20:17:07,974 INFO L408 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:17:07,974 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-11 20:17:07,982 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:17:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:17:08,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:17:08,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:08,023 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-11 20:17:08,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:08,025 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-11 20:17:08,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:08,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:08,033 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-11 20:17:08,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 20:17:08,066 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-11 20:17:08,069 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-11 20:17:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:17:08,078 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:17:08,094 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_24| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_24| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_24|))))) is different from false [2018-04-11 20:17:08,098 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-11 20:17:08,124 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-11 20:17:08,151 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:17:08,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-11 20:17:08,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 20:17:08,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 20:17:08,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-11 20:17:08,153 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 12 states. [2018-04-11 20:17:08,179 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-11 20:17:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:17:08,641 INFO L93 Difference]: Finished difference Result 250 states and 263 transitions. [2018-04-11 20:17:08,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 20:17:08,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-04-11 20:17:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:17:08,643 INFO L225 Difference]: With dead ends: 250 [2018-04-11 20:17:08,643 INFO L226 Difference]: Without dead ends: 238 [2018-04-11 20:17:08,644 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-11 20:17:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-11 20:17:08,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 115. [2018-04-11 20:17:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 20:17:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-04-11 20:17:08,658 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 61 [2018-04-11 20:17:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:17:08,658 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-04-11 20:17:08,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 20:17:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-04-11 20:17:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 20:17:08,659 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:17:08,659 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-11 20:17:08,659 INFO L408 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:17:08,660 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-11 20:17:08,669 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:17:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:17:08,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:17:08,732 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-11 20:17:08,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:08,737 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-11 20:17:08,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:08,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:08,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:17:08,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:08,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:08,754 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-11 20:17:08,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:08,761 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-11 20:17:08,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:08,765 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-11 20:17:08,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:17:09,099 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-11 20:17:09,099 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:17:09,832 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-11 20:17:09,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:17:09,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 48 [2018-04-11 20:17:09,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-11 20:17:09,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-11 20:17:09,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2200, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 20:17:09,853 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 49 states. [2018-04-11 20:17:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:17:13,449 INFO L93 Difference]: Finished difference Result 178 states and 186 transitions. [2018-04-11 20:17:13,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-11 20:17:13,449 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 61 [2018-04-11 20:17:13,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:17:13,450 INFO L225 Difference]: With dead ends: 178 [2018-04-11 20:17:13,451 INFO L226 Difference]: Without dead ends: 177 [2018-04-11 20:17:13,453 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2327 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1219, Invalid=10553, Unknown=0, NotChecked=0, Total=11772 [2018-04-11 20:17:13,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-11 20:17:13,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 138. [2018-04-11 20:17:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 20:17:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 144 transitions. [2018-04-11 20:17:13,468 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 144 transitions. Word has length 61 [2018-04-11 20:17:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:17:13,469 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 144 transitions. [2018-04-11 20:17:13,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-11 20:17:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 144 transitions. [2018-04-11 20:17:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 20:17:13,470 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:17:13,470 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-11 20:17:13,470 INFO L408 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:17:13,470 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-11 20:17:13,479 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:17:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:17:13,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:17:13,504 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-11 20:17:13,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:13,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:13,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 20:17:13,510 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-11 20:17:13,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:13,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:13,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:13,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 20:17:13,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:13,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:13,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 20:17:13,534 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-11 20:17:13,535 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-11 20:17:13,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:13,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:13,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:13,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 20:17:13,653 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-11 20:17:13,655 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-11 20:17:13,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:13,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:13,663 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-11 20:17:13,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-11 20:17:13,714 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-11 20:17:13,720 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-11 20:17:13,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:17:13,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:17:13,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:17:13,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-11 20:17:13,843 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-11 20:17:13,843 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:17:14,541 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-11 20:17:14,554 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-11 20:17:14,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:14,565 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-11 20:17:14,567 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-11 20:17:14,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:14,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:14,571 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-11 20:17:14,574 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-11 20:17:14,575 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:14,576 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:14,585 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-11 20:17:14,601 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-11 20:17:14,601 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-04-11 20:17:14,768 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-11 20:17:14,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:17:14,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-04-11 20:17:14,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 20:17:14,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 20:17:14,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 20:17:14,789 INFO L87 Difference]: Start difference. First operand 138 states and 144 transitions. Second operand 42 states. [2018-04-11 20:17:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:17:16,177 INFO L93 Difference]: Finished difference Result 171 states and 177 transitions. [2018-04-11 20:17:16,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 20:17:16,178 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 67 [2018-04-11 20:17:16,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:17:16,178 INFO L225 Difference]: With dead ends: 171 [2018-04-11 20:17:16,179 INFO L226 Difference]: Without dead ends: 170 [2018-04-11 20:17:16,180 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=416, Invalid=4006, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 20:17:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-11 20:17:16,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 138. [2018-04-11 20:17:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 20:17:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2018-04-11 20:17:16,191 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 67 [2018-04-11 20:17:16,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:17:16,192 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2018-04-11 20:17:16,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 20:17:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2018-04-11 20:17:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 20:17:16,192 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:17:16,192 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-11 20:17:16,193 INFO L408 AbstractCegarLoop]: === Iteration 19 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:17:16,193 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-11 20:17:16,199 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:17:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:17:16,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:17:16,228 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-11 20:17:16,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:16,233 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-11 20:17:16,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:16,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:16,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:17:16,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:16,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:16,249 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-11 20:17:16,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:16,255 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-11 20:17:16,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:16,259 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-11 20:17:16,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:17:16,927 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-11 20:17:16,928 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:17:18,364 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-11 20:17:18,385 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:17:18,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 68 [2018-04-11 20:17:18,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-11 20:17:18,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-11 20:17:18,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=4410, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 20:17:18,387 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand 69 states. [2018-04-11 20:17:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:17:26,617 INFO L93 Difference]: Finished difference Result 233 states and 242 transitions. [2018-04-11 20:17:26,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-04-11 20:17:26,618 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 79 [2018-04-11 20:17:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:17:26,619 INFO L225 Difference]: With dead ends: 233 [2018-04-11 20:17:26,619 INFO L226 Difference]: Without dead ends: 232 [2018-04-11 20:17:26,623 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6957 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2849, Invalid=26907, Unknown=0, NotChecked=0, Total=29756 [2018-04-11 20:17:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-11 20:17:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 200. [2018-04-11 20:17:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-11 20:17:26,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 206 transitions. [2018-04-11 20:17:26,645 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 206 transitions. Word has length 79 [2018-04-11 20:17:26,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:17:26,645 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 206 transitions. [2018-04-11 20:17:26,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-11 20:17:26,646 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 206 transitions. [2018-04-11 20:17:26,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-11 20:17:26,647 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:17:26,647 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-11 20:17:26,647 INFO L408 AbstractCegarLoop]: === Iteration 20 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:17:26,647 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-11 20:17:26,668 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:17:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:17:26,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:17:26,700 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-11 20:17:26,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:26,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:26,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 20:17:26,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:26,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:26,710 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-11 20:17:26,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:26,725 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-11 20:17:26,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:26,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:26,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 20:17:26,742 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-11 20:17:26,744 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-11 20:17:26,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:26,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:26,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:26,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 20:17:26,878 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-11 20:17:26,880 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-11 20:17:26,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:26,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:26,888 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-11 20:17:26,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-11 20:17:26,959 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-11 20:17:26,961 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-11 20:17:26,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:26,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:26,971 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-11 20:17:26,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-11 20:17:27,027 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-11 20:17:27,033 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-11 20:17:27,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:17:27,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:17:27,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:17:27,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-11 20:17:27,123 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-11 20:17:27,124 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:17:28,272 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-11 20:17:28,282 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-11 20:17:28,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:28,293 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-11 20:17:28,302 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-11 20:17:28,324 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-11 20:17:28,325 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 20:17:28,326 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-11 20:17:28,327 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:28,332 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-11 20:17:28,332 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 20:17:28,372 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-11 20:17:28,373 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-04-11 20:17:28,378 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-11 20:17:28,379 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 20:17:28,403 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:17:28,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:17:28,427 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-11 20:17:28,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-04-11 20:17:28,430 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:28,454 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-11 20:17:28,529 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-11 20:17:28,530 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-04-11 20:17:28,541 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-11 20:17:28,542 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-04-11 20:17:28,605 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-11 20:17:28,606 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-11 20:17:28,648 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-11 20:17:28,649 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-11 20:17:28,654 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-11 20:17:28,655 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-04-11 20:17:28,677 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 20:17:28,702 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 20:17:28,704 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-11 20:17:28,706 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-11 20:17:28,706 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:28,709 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:28,733 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-11 20:17:28,760 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-11 20:17:28,761 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 6 variables, input treesize:60, output treesize:84 [2018-04-11 20:17:28,945 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-11 20:17:28,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:17:28,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-04-11 20:17:28,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-11 20:17:28,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-11 20:17:28,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2474, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 20:17:28,965 INFO L87 Difference]: Start difference. First operand 200 states and 206 transitions. Second operand 52 states. [2018-04-11 20:17:31,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:17:31,903 INFO L93 Difference]: Finished difference Result 224 states and 231 transitions. [2018-04-11 20:17:31,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-11 20:17:31,904 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 82 [2018-04-11 20:17:31,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:17:31,905 INFO L225 Difference]: With dead ends: 224 [2018-04-11 20:17:31,905 INFO L226 Difference]: Without dead ends: 223 [2018-04-11 20:17:31,905 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1717 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1417, Invalid=7703, Unknown=0, NotChecked=0, Total=9120 [2018-04-11 20:17:31,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-11 20:17:31,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 199. [2018-04-11 20:17:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-11 20:17:31,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 205 transitions. [2018-04-11 20:17:31,928 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 205 transitions. Word has length 82 [2018-04-11 20:17:31,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:17:31,929 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 205 transitions. [2018-04-11 20:17:31,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-11 20:17:31,929 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 205 transitions. [2018-04-11 20:17:31,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-11 20:17:31,929 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:17:31,929 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-11 20:17:31,930 INFO L408 AbstractCegarLoop]: === Iteration 21 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:17:31,930 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-11 20:17:31,936 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:17:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:17:31,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:17:31,969 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-11 20:17:31,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:31,974 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-11 20:17:31,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:31,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:31,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:17:31,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:31,991 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-11 20:17:31,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:31,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:32,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:32,000 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-11 20:17:32,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:32,006 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-11 20:17:32,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:17:32,437 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-11 20:17:32,438 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:17:33,286 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-11 20:17:33,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:17:33,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 54 [2018-04-11 20:17:33,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-11 20:17:33,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-11 20:17:33,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2781, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 20:17:33,306 INFO L87 Difference]: Start difference. First operand 199 states and 205 transitions. Second operand 55 states. [2018-04-11 20:17:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:17:39,392 INFO L93 Difference]: Finished difference Result 379 states and 393 transitions. [2018-04-11 20:17:39,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-11 20:17:39,393 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 82 [2018-04-11 20:17:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:17:39,394 INFO L225 Difference]: With dead ends: 379 [2018-04-11 20:17:39,394 INFO L226 Difference]: Without dead ends: 378 [2018-04-11 20:17:39,395 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4860 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2029, Invalid=18851, Unknown=0, NotChecked=0, Total=20880 [2018-04-11 20:17:39,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-04-11 20:17:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 250. [2018-04-11 20:17:39,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-11 20:17:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 263 transitions. [2018-04-11 20:17:39,417 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 263 transitions. Word has length 82 [2018-04-11 20:17:39,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:17:39,417 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 263 transitions. [2018-04-11 20:17:39,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-11 20:17:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 263 transitions. [2018-04-11 20:17:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-11 20:17:39,418 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:17:39,418 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-11 20:17:39,418 INFO L408 AbstractCegarLoop]: === Iteration 22 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:17:39,418 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-11 20:17:39,435 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:17:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:17:39,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:17:39,482 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-11 20:17:39,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:39,510 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-11 20:17:39,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:39,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:39,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:17:39,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:39,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:39,529 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-11 20:17:39,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:39,536 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-11 20:17:39,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:39,541 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-11 20:17:39,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:17:39,812 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-11 20:17:39,812 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:17:40,406 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-11 20:17:40,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:17:40,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 46 [2018-04-11 20:17:40,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-11 20:17:40,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-11 20:17:40,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1999, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 20:17:40,427 INFO L87 Difference]: Start difference. First operand 250 states and 263 transitions. Second operand 47 states. [2018-04-11 20:17:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:17:43,444 INFO L93 Difference]: Finished difference Result 383 states and 396 transitions. [2018-04-11 20:17:43,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-11 20:17:43,444 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 83 [2018-04-11 20:17:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:17:43,446 INFO L225 Difference]: With dead ends: 383 [2018-04-11 20:17:43,446 INFO L226 Difference]: Without dead ends: 382 [2018-04-11 20:17:43,447 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1182, Invalid=8520, Unknown=0, NotChecked=0, Total=9702 [2018-04-11 20:17:43,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-04-11 20:17:43,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 264. [2018-04-11 20:17:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-04-11 20:17:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 274 transitions. [2018-04-11 20:17:43,470 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 274 transitions. Word has length 83 [2018-04-11 20:17:43,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:17:43,470 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 274 transitions. [2018-04-11 20:17:43,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-11 20:17:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 274 transitions. [2018-04-11 20:17:43,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-11 20:17:43,471 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:17:43,471 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-11 20:17:43,471 INFO L408 AbstractCegarLoop]: === Iteration 23 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:17:43,471 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-11 20:17:43,477 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:17:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:17:43,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:17:43,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-11 20:17:43,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:43,539 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-11 20:17:43,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:43,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:43,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:17:43,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:43,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:43,557 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-11 20:17:43,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:43,567 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-11 20:17:43,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:43,573 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-11 20:17:43,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:17:44,249 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-11 20:17:44,249 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:17:45,539 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-11 20:17:45,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:17:45,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 66 [2018-04-11 20:17:45,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-11 20:17:45,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-11 20:17:45,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4176, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 20:17:45,560 INFO L87 Difference]: Start difference. First operand 264 states and 274 transitions. Second operand 67 states. [2018-04-11 20:17:55,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:17:55,030 INFO L93 Difference]: Finished difference Result 397 states and 409 transitions. [2018-04-11 20:17:55,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-04-11 20:17:55,030 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 85 [2018-04-11 20:17:55,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:17:55,032 INFO L225 Difference]: With dead ends: 397 [2018-04-11 20:17:55,032 INFO L226 Difference]: Without dead ends: 396 [2018-04-11 20:17:55,033 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8659 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=2937, Invalid=31473, Unknown=0, NotChecked=0, Total=34410 [2018-04-11 20:17:55,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-04-11 20:17:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 260. [2018-04-11 20:17:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-11 20:17:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 270 transitions. [2018-04-11 20:17:55,059 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 270 transitions. Word has length 85 [2018-04-11 20:17:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:17:55,059 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 270 transitions. [2018-04-11 20:17:55,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-11 20:17:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 270 transitions. [2018-04-11 20:17:55,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-04-11 20:17:55,060 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:17:55,060 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-11 20:17:55,060 INFO L408 AbstractCegarLoop]: === Iteration 24 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:17:55,060 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-11 20:17:55,068 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:17:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:17:55,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:17:55,105 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-11 20:17:55,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:55,110 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-11 20:17:55,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:55,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:17:55,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:17:55,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:55,128 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-11 20:17:55,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:55,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:55,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:17:55,137 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-11 20:17:55,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:17:55,142 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-11 20:17:55,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:17:55,951 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-11 20:17:55,951 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:17:57,248 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-11 20:17:57,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:17:57,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 32] total 69 [2018-04-11 20:17:57,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-11 20:17:57,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-11 20:17:57,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4581, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 20:17:57,270 INFO L87 Difference]: Start difference. First operand 260 states and 270 transitions. Second operand 70 states. [2018-04-11 20:18:11,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:18:11,016 INFO L93 Difference]: Finished difference Result 446 states and 458 transitions. [2018-04-11 20:18:11,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-04-11 20:18:11,016 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 91 [2018-04-11 20:18:11,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:18:11,018 INFO L225 Difference]: With dead ends: 446 [2018-04-11 20:18:11,018 INFO L226 Difference]: Without dead ends: 445 [2018-04-11 20:18:11,020 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11508 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=3701, Invalid=41031, Unknown=0, NotChecked=0, Total=44732 [2018-04-11 20:18:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-04-11 20:18:11,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 243. [2018-04-11 20:18:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-11 20:18:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 252 transitions. [2018-04-11 20:18:11,043 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 252 transitions. Word has length 91 [2018-04-11 20:18:11,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:18:11,044 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 252 transitions. [2018-04-11 20:18:11,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-11 20:18:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 252 transitions. [2018-04-11 20:18:11,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-11 20:18:11,044 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:18:11,045 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-11 20:18:11,045 INFO L408 AbstractCegarLoop]: === Iteration 25 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:18:11,045 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-11 20:18:11,050 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:18:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:18:11,082 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:18:11,085 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-11 20:18:11,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:18:11,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-11 20:18:11,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:18:11,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:18:11,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:18:11,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:18:11,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:18:11,104 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-11 20:18:11,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:18:11,110 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-11 20:18:11,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:18:11,114 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-11 20:18:11,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:18:12,043 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-11 20:18:12,043 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:18:14,102 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-11 20:18:14,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:18:14,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42] total 84 [2018-04-11 20:18:14,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-11 20:18:14,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-11 20:18:14,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=6783, Unknown=0, NotChecked=0, Total=7140 [2018-04-11 20:18:14,132 INFO L87 Difference]: Start difference. First operand 243 states and 252 transitions. Second operand 85 states. [2018-04-11 20:18:19,486 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 61 DAG size of output 59 [2018-04-11 20:18:20,173 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 69 DAG size of output 60 [2018-04-11 20:18:20,451 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 66 DAG size of output 60 [2018-04-11 20:18:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:18:38,922 INFO L93 Difference]: Finished difference Result 529 states and 544 transitions. [2018-04-11 20:18:38,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2018-04-11 20:18:38,922 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 109 [2018-04-11 20:18:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:18:38,924 INFO L225 Difference]: With dead ends: 529 [2018-04-11 20:18:38,924 INFO L226 Difference]: Without dead ends: 528 [2018-04-11 20:18:38,927 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29250 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=6686, Invalid=89104, Unknown=0, NotChecked=0, Total=95790 [2018-04-11 20:18:38,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-04-11 20:18:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 269. [2018-04-11 20:18:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-04-11 20:18:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 279 transitions. [2018-04-11 20:18:38,963 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 279 transitions. Word has length 109 [2018-04-11 20:18:38,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:18:38,963 INFO L459 AbstractCegarLoop]: Abstraction has 269 states and 279 transitions. [2018-04-11 20:18:38,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-11 20:18:38,963 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 279 transitions. [2018-04-11 20:18:38,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-04-11 20:18:38,963 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:18:38,964 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-11 20:18:38,964 INFO L408 AbstractCegarLoop]: === Iteration 26 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:18:38,964 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-11 20:18:38,971 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:18:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:18:39,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:18:39,005 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-11 20:18:39,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:18:39,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 20:18:39,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:18:39,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:18:39,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:18:39,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:18:39,025 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-11 20:18:39,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:18:39,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:18:39,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:18:39,034 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-11 20:18:39,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:18:39,038 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-11 20:18:39,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:18:40,359 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-11 20:18:40,360 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:18:43,200 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-11 20:18:43,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:18:43,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48] total 96 [2018-04-11 20:18:43,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-11 20:18:43,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-11 20:18:43,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=8799, Unknown=0, NotChecked=0, Total=9312 [2018-04-11 20:18:43,222 INFO L87 Difference]: Start difference. First operand 269 states and 279 transitions. Second operand 97 states. [2018-04-11 20:18:45,987 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 58 DAG size of output 56 [2018-04-11 20:18:46,494 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 61 DAG size of output 56 [2018-04-11 20:18:46,773 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 58 DAG size of output 56 [2018-04-11 20:18:48,741 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 69 DAG size of output 67 [2018-04-11 20:18:49,042 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 68 DAG size of output 66 [2018-04-11 20:18:49,391 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 68 DAG size of output 66 [2018-04-11 20:18:49,949 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 69 DAG size of output 67 [2018-04-11 20:18:50,235 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 68 DAG size of output 66 [2018-04-11 20:18:50,536 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 71 DAG size of output 66 [2018-04-11 20:18:58,431 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 89 DAG size of output 78 [2018-04-11 20:18:58,822 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 90 DAG size of output 79 [2018-04-11 20:18:59,767 WARN L151 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 102 DAG size of output 80 [2018-04-11 20:19:00,129 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 98 DAG size of output 79 [2018-04-11 20:19:02,397 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 70 DAG size of output 68 [2018-04-11 20:19:03,242 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 86 DAG size of output 70 [2018-04-11 20:19:03,543 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 83 DAG size of output 69 [2018-04-11 20:19:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:19:09,318 INFO L93 Difference]: Finished difference Result 540 states and 556 transitions. [2018-04-11 20:19:09,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-04-11 20:19:09,319 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 112 [2018-04-11 20:19:09,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:19:09,321 INFO L225 Difference]: With dead ends: 540 [2018-04-11 20:19:09,321 INFO L226 Difference]: Without dead ends: 539 [2018-04-11 20:19:09,324 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26510 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=7398, Invalid=85932, Unknown=0, NotChecked=0, Total=93330 [2018-04-11 20:19:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-04-11 20:19:09,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 323. [2018-04-11 20:19:09,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-11 20:19:09,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 333 transitions. [2018-04-11 20:19:09,386 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 333 transitions. Word has length 112 [2018-04-11 20:19:09,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:19:09,386 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 333 transitions. [2018-04-11 20:19:09,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-11 20:19:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 333 transitions. [2018-04-11 20:19:09,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-04-11 20:19:09,387 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:19:09,387 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-11 20:19:09,387 INFO L408 AbstractCegarLoop]: === Iteration 27 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:19:09,387 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-11 20:19:09,395 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:19:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:19:09,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:19:09,437 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-11 20:19:09,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:19:09,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:19:09,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:19:09,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:19:09,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:19:09,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:19:09,478 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-11 20:19:09,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:19:09,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:19:09,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:19:09,488 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-11 20:19:09,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:19:09,493 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-11 20:19:09,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:19:11,374 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-11 20:19:11,375 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:19:15,269 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-11 20:19:15,288 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:19:15,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54] total 108 [2018-04-11 20:19:15,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-04-11 20:19:15,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-04-11 20:19:15,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=734, Invalid=11038, Unknown=0, NotChecked=0, Total=11772 [2018-04-11 20:19:15,289 INFO L87 Difference]: Start difference. First operand 323 states and 333 transitions. Second operand 109 states. [2018-04-11 20:19:30,102 WARN L151 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 106 DAG size of output 91 [2018-04-11 20:19:30,527 WARN L151 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 107 DAG size of output 92 [2018-04-11 20:19:30,910 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 82 DAG size of output 67 [2018-04-11 20:19:31,426 WARN L151 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 124 DAG size of output 94 [2018-04-11 20:19:31,829 WARN L151 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 120 DAG size of output 93 [2018-04-11 20:19:32,344 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 76 DAG size of output 64 [2018-04-11 20:19:32,834 WARN L148 SmtUtils]: Spent 132ms on a formula simplification that was a NOOP. DAG size: 91 [2018-04-11 20:19:33,198 WARN L148 SmtUtils]: Spent 123ms on a formula simplification that was a NOOP. DAG size: 89 [2018-04-11 20:19:33,669 WARN L151 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 87 DAG size of output 83 [2018-04-11 20:19:34,457 WARN L151 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 109 DAG size of output 85 [2018-04-11 20:19:34,782 WARN L151 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 106 DAG size of output 84 [2018-04-11 20:19:35,553 WARN L148 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-11 20:19:36,249 WARN L151 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 78 DAG size of output 76 [2018-04-11 20:19:36,746 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 97 DAG size of output 77 [2018-04-11 20:19:37,030 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 94 DAG size of output 76 [2018-04-11 20:19:37,816 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 69 DAG size of output 67 [2018-04-11 20:19:38,207 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 85 DAG size of output 69 [2018-04-11 20:19:38,447 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 82 DAG size of output 68 [2018-04-11 20:19:42,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:19:42,124 INFO L93 Difference]: Finished difference Result 547 states and 564 transitions. [2018-04-11 20:19:42,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-04-11 20:19:42,145 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 115 [2018-04-11 20:19:42,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:19:42,147 INFO L225 Difference]: With dead ends: 547 [2018-04-11 20:19:42,147 INFO L226 Difference]: Without dead ends: 546 [2018-04-11 20:19:42,150 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23673 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=8245, Invalid=82055, Unknown=0, NotChecked=0, Total=90300 [2018-04-11 20:19:42,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-04-11 20:19:42,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 364. [2018-04-11 20:19:42,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-04-11 20:19:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 374 transitions. [2018-04-11 20:19:42,224 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 374 transitions. Word has length 115 [2018-04-11 20:19:42,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:19:42,224 INFO L459 AbstractCegarLoop]: Abstraction has 364 states and 374 transitions. [2018-04-11 20:19:42,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-04-11 20:19:42,224 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 374 transitions. [2018-04-11 20:19:42,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-04-11 20:19:42,225 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:19:42,225 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-11 20:19:42,225 INFO L408 AbstractCegarLoop]: === Iteration 28 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:19:42,225 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-11 20:19:42,231 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:19:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:19:42,267 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:19:42,270 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-11 20:19:42,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:19:42,284 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-11 20:19:42,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:19:42,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:19:42,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:19:42,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:19:42,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:19:42,302 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-11 20:19:42,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:19:42,309 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-11 20:19:42,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:19:42,314 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-11 20:19:42,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:19:43,329 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-11 20:19:43,329 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:19:45,580 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-11 20:19:45,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:19:45,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45] total 90 [2018-04-11 20:19:45,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-11 20:19:45,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-11 20:19:45,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=7798, Unknown=0, NotChecked=0, Total=8190 [2018-04-11 20:19:45,601 INFO L87 Difference]: Start difference. First operand 364 states and 374 transitions. Second operand 91 states. [2018-04-11 20:19:57,994 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 76 DAG size of output 74 [2018-04-11 20:19:58,765 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 91 DAG size of output 74 [2018-04-11 20:19:59,092 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 88 DAG size of output 74 [2018-04-11 20:19:59,936 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 88 DAG size of output 74 [2018-04-11 20:20:01,789 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 78 DAG size of output 70 [2018-04-11 20:20:02,130 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 77 DAG size of output 69 [2018-04-11 20:20:02,402 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 77 DAG size of output 65 [2018-04-11 20:20:02,778 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 77 DAG size of output 65 [2018-04-11 20:20:03,215 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 81 DAG size of output 73 [2018-04-11 20:20:03,870 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 83 DAG size of output 72 [2018-04-11 20:20:06,976 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 71 DAG size of output 65 [2018-04-11 20:20:09,867 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 78 DAG size of output 67 [2018-04-11 20:20:22,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:20:22,631 INFO L93 Difference]: Finished difference Result 908 states and 928 transitions. [2018-04-11 20:20:22,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 306 states. [2018-04-11 20:20:22,632 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 130 [2018-04-11 20:20:22,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:20:22,634 INFO L225 Difference]: With dead ends: 908 [2018-04-11 20:20:22,634 INFO L226 Difference]: Without dead ends: 907 [2018-04-11 20:20:22,640 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51292 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=9953, Invalid=144103, Unknown=0, NotChecked=0, Total=154056 [2018-04-11 20:20:22,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-04-11 20:20:22,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 428. [2018-04-11 20:20:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-04-11 20:20:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 446 transitions. [2018-04-11 20:20:22,731 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 446 transitions. Word has length 130 [2018-04-11 20:20:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:20:22,731 INFO L459 AbstractCegarLoop]: Abstraction has 428 states and 446 transitions. [2018-04-11 20:20:22,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-11 20:20:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 446 transitions. [2018-04-11 20:20:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-04-11 20:20:22,732 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:20:22,732 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-11 20:20:22,732 INFO L408 AbstractCegarLoop]: === Iteration 29 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 20:20:22,732 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-11 20:20:22,738 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:20:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:20:22,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:20:22,780 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-11 20:20:22,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:20:22,794 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-11 20:20:22,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:20:22,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:20:22,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:20:22,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:20:22,810 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-11 20:20:22,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:20:22,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:20:22,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:20:22,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 20:20:22,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:20:22,821 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-11 20:20:22,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 20:20:24,237 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-11 20:20:24,237 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:20:27,349 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-11 20:20:27,368 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:20:27,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51] total 102 [2018-04-11 20:20:27,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-04-11 20:20:27,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-04-11 20:20:27,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=10011, Unknown=0, NotChecked=0, Total=10506 [2018-04-11 20:20:27,370 INFO L87 Difference]: Start difference. First operand 428 states and 446 transitions. Second operand 103 states. [2018-04-11 20:20:38,900 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 73 DAG size of output 71 [2018-04-11 20:20:39,981 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 83 DAG size of output 70 [2018-04-11 20:20:40,467 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 80 DAG size of output 70 [2018-04-11 20:20:41,922 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 80 DAG size of output 70 [2018-04-11 20:20:45,199 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 79 DAG size of output 73 [2018-04-11 20:20:45,654 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 78 DAG size of output 72 [2018-04-11 20:20:46,058 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 69 DAG size of output 61 [2018-04-11 20:20:46,267 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 78 DAG size of output 72 [2018-04-11 20:20:46,614 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 69 DAG size of output 61 [2018-04-11 20:20:47,257 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 80 DAG size of output 74 [2018-04-11 20:20:47,653 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 79 DAG size of output 73 [2018-04-11 20:20:47,987 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 82 DAG size of output 73 [2018-04-11 20:20:51,719 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 72 DAG size of output 68 [2018-04-11 20:20:52,307 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 71 DAG size of output 67 [2018-04-11 20:20:52,948 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 71 DAG size of output 67 [2018-04-11 20:20:53,837 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 73 DAG size of output 69 [2018-04-11 20:20:54,680 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 75 DAG size of output 68 [2018-04-11 20:20:55,535 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 79 DAG size of output 70 [2018-04-11 20:20:57,129 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 90 DAG size of output 72 [2018-04-11 20:20:57,529 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 86 DAG size of output 71 [2018-04-11 20:20:59,537 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 65 DAG size of output 63 [2018-04-11 20:20:59,739 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 74 DAG size of output 67 [2018-04-11 20:21:00,324 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 64 DAG size of output 62 Received shutdown request... [2018-04-11 20:21:02,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2018-04-11 20:21:02,258 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 20:21:02,262 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 20:21:02,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 08:21:02 BoogieIcfgContainer [2018-04-11 20:21:02,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 20:21:02,263 INFO L168 Benchmark]: Toolchain (without parser) took 246579.62 ms. Allocated memory was 302.5 MB in the beginning and 508.6 MB in the end (delta: 206.0 MB). Free memory was 237.9 MB in the beginning and 328.6 MB in the end (delta: -90.6 MB). Peak memory consumption was 115.4 MB. Max. memory is 5.3 GB. [2018-04-11 20:21:02,264 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 302.5 MB. Free memory is still 264.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 20:21:02,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.52 ms. Allocated memory is still 302.5 MB. Free memory was 237.9 MB in the beginning and 214.0 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-11 20:21:02,265 INFO L168 Benchmark]: Boogie Preprocessor took 49.56 ms. Allocated memory is still 302.5 MB. Free memory was 214.0 MB in the beginning and 211.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-11 20:21:02,265 INFO L168 Benchmark]: RCFGBuilder took 542.73 ms. Allocated memory was 302.5 MB in the beginning and 462.9 MB in the end (delta: 160.4 MB). Free memory was 211.0 MB in the beginning and 397.1 MB in the end (delta: -186.1 MB). Peak memory consumption was 21.4 MB. Max. memory is 5.3 GB. [2018-04-11 20:21:02,266 INFO L168 Benchmark]: TraceAbstraction took 245661.68 ms. Allocated memory was 462.9 MB in the beginning and 508.6 MB in the end (delta: 45.6 MB). Free memory was 397.1 MB in the beginning and 328.6 MB in the end (delta: 68.5 MB). Peak memory consumption was 114.2 MB. Max. memory is 5.3 GB. [2018-04-11 20:21:02,267 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.18 ms. Allocated memory is still 302.5 MB. Free memory is still 264.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 320.52 ms. Allocated memory is still 302.5 MB. Free memory was 237.9 MB in the beginning and 214.0 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 49.56 ms. Allocated memory is still 302.5 MB. Free memory was 214.0 MB in the beginning and 211.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 542.73 ms. Allocated memory was 302.5 MB in the beginning and 462.9 MB in the end (delta: 160.4 MB). Free memory was 211.0 MB in the beginning and 397.1 MB in the end (delta: -186.1 MB). Peak memory consumption was 21.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 245661.68 ms. Allocated memory was 462.9 MB in the beginning and 508.6 MB in the end (delta: 45.6 MB). Free memory was 397.1 MB in the beginning and 328.6 MB in the end (delta: 68.5 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 245 states, 103 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 344 known predicates. - 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 245 states, 103 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 344 known predicates. - 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 245 states, 103 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 344 known predicates. - 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 245 states, 103 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 344 known predicates. - 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 245 states, 103 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 344 known predicates. - 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 245 states, 103 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 344 known predicates. - 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 245 states, 103 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 344 known predicates. - 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 245 states, 103 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 344 known predicates. - 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 245 states, 103 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 344 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 91 locations, 9 error locations. TIMEOUT Result, 245.6s OverallTime, 29 OverallIterations, 8 TraceHistogramMax, 205.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2258 SDtfs, 19198 SDslu, 46143 SDs, 0 SdLazy, 49523 SolverSat, 3889 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5836 GetRequests, 2761 SyntacticMatches, 17 SemanticMatches, 3057 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 205834 ImplicationChecksByTransitivity, 211.2s 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.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 2461 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 37.6s 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-11_20-21-02-274.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-11_20-21-02-274.csv Completed graceful shutdown