java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4cf2d92 [2018-03-28 12:03:59,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-28 12:03:59,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-28 12:03:59,328 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-28 12:03:59,328 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-28 12:03:59,329 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-28 12:03:59,330 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-28 12:03:59,332 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-28 12:03:59,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-28 12:03:59,335 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-28 12:03:59,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-28 12:03:59,336 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-28 12:03:59,337 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-28 12:03:59,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-28 12:03:59,339 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-28 12:03:59,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-28 12:03:59,343 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-28 12:03:59,345 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-28 12:03:59,346 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-28 12:03:59,348 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-28 12:03:59,350 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-28 12:03:59,350 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-28 12:03:59,351 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-28 12:03:59,352 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-28 12:03:59,352 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-28 12:03:59,354 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-28 12:03:59,354 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-28 12:03:59,355 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-28 12:03:59,355 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-28 12:03:59,356 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-28 12:03:59,356 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-28 12:03:59,357 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-03-28 12:03:59,381 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-28 12:03:59,382 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-28 12:03:59,382 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-28 12:03:59,382 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-28 12:03:59,383 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-28 12:03:59,383 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-28 12:03:59,383 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-28 12:03:59,384 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-28 12:03:59,384 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-28 12:03:59,384 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-28 12:03:59,384 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-28 12:03:59,385 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-28 12:03:59,385 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-28 12:03:59,385 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-28 12:03:59,385 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-28 12:03:59,385 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-28 12:03:59,386 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-28 12:03:59,386 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-28 12:03:59,386 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-28 12:03:59,386 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-28 12:03:59,386 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-28 12:03:59,387 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-28 12:03:59,387 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-28 12:03:59,387 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-28 12:03:59,387 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-28 12:03:59,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-28 12:03:59,388 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-28 12:03:59,388 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-28 12:03:59,388 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-28 12:03:59,388 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-28 12:03:59,388 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-28 12:03:59,389 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:03:59,389 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-28 12:03:59,390 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-28 12:03:59,390 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-28 12:03:59,390 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-28 12:03:59,390 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-28 12:03:59,425 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-28 12:03:59,438 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-28 12:03:59,443 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-28 12:03:59,444 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-28 12:03:59,445 INFO L276 PluginConnector]: CDTParser initialized [2018-03-28 12:03:59,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,788 INFO L228 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG15876956e [2018-03-28 12:03:59,949 INFO L291 CDTParser]: IsIndexed: true [2018-03-28 12:03:59,949 INFO L292 CDTParser]: Found 1 translation units. [2018-03-28 12:03:59,950 INFO L171 CDTParser]: Scanning cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,961 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-28 12:03:59,961 INFO L215 ultiparseSymbolTable]: [2018-03-28 12:03:59,962 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-28 12:03:59,962 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,962 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,962 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,962 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,962 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-28 12:03:59,962 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,963 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__time_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,963 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,963 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,963 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,963 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,963 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,963 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,964 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,964 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,964 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,964 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,964 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,964 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,964 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____id_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,964 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__div_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,965 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,965 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_short in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,965 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,965 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__key_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,965 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,965 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,965 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,966 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,966 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,966 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,966 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ulong in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,966 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,966 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,966 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_short in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,966 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__off_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_char in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_long in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__size_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_char in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__id_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_int in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____off_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__uint in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_long in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ushort in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____time_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__register_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____key_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:03:59,995 INFO L334 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG15876956e [2018-03-28 12:03:59,999 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-28 12:04:00,000 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-28 12:04:00,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-28 12:04:00,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-28 12:04:00,007 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-28 12:04:00,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:03:59" (1/1) ... [2018-03-28 12:04:00,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b2eb59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:00, skipping insertion in model container [2018-03-28 12:04:00,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:03:59" (1/1) ... [2018-03-28 12:04:00,030 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-28 12:04:00,060 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-28 12:04:00,223 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-28 12:04:00,269 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-28 12:04:00,276 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-03-28 12:04:00,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:00 WrapperNode [2018-03-28 12:04:00,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-28 12:04:00,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-28 12:04:00,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-28 12:04:00,327 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-28 12:04:00,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:00" (1/1) ... [2018-03-28 12:04:00,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:00" (1/1) ... [2018-03-28 12:04:00,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:00" (1/1) ... [2018-03-28 12:04:00,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:00" (1/1) ... [2018-03-28 12:04:00,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:00" (1/1) ... [2018-03-28 12:04:00,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:00" (1/1) ... [2018-03-28 12:04:00,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:00" (1/1) ... [2018-03-28 12:04:00,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-28 12:04:00,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-28 12:04:00,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-28 12:04:00,387 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-28 12:04:00,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:00" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-28 12:04:00,502 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-28 12:04:00,502 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-28 12:04:00,502 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-03-28 12:04:00,502 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-03-28 12:04:00,502 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-03-28 12:04:00,503 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-28 12:04:00,503 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-03-28 12:04:00,503 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-03-28 12:04:00,503 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-03-28 12:04:00,503 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-03-28 12:04:00,503 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-03-28 12:04:00,503 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-03-28 12:04:00,504 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-03-28 12:04:00,504 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-03-28 12:04:00,504 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-03-28 12:04:00,504 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-03-28 12:04:00,504 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-03-28 12:04:00,504 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-03-28 12:04:00,505 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-03-28 12:04:00,505 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-03-28 12:04:00,505 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-03-28 12:04:00,505 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-03-28 12:04:00,505 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-03-28 12:04:00,505 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-03-28 12:04:00,506 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-03-28 12:04:00,506 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-03-28 12:04:00,506 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-03-28 12:04:00,506 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-03-28 12:04:00,506 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-03-28 12:04:00,506 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-03-28 12:04:00,507 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-03-28 12:04:00,507 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-03-28 12:04:00,507 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-03-28 12:04:00,507 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-03-28 12:04:00,507 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-03-28 12:04:00,507 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-03-28 12:04:00,507 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-03-28 12:04:00,508 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-03-28 12:04:00,508 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-03-28 12:04:00,508 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-03-28 12:04:00,508 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-03-28 12:04:00,508 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-03-28 12:04:00,508 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-03-28 12:04:00,508 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-03-28 12:04:00,508 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-03-28 12:04:00,509 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-03-28 12:04:00,509 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-03-28 12:04:00,509 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-03-28 12:04:00,509 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-03-28 12:04:00,509 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-03-28 12:04:00,509 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-03-28 12:04:00,509 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-03-28 12:04:00,509 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-03-28 12:04:00,509 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-03-28 12:04:00,509 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-03-28 12:04:00,510 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-03-28 12:04:00,510 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-03-28 12:04:00,510 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-03-28 12:04:00,510 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-28 12:04:00,510 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-03-28 12:04:00,510 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-03-28 12:04:00,510 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-28 12:04:00,510 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-03-28 12:04:00,510 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-03-28 12:04:00,510 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-03-28 12:04:00,511 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-03-28 12:04:00,511 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-03-28 12:04:00,511 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-03-28 12:04:00,511 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-03-28 12:04:00,511 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-03-28 12:04:00,511 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-03-28 12:04:00,511 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-03-28 12:04:00,511 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-03-28 12:04:00,511 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-03-28 12:04:00,512 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-03-28 12:04:00,512 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-03-28 12:04:00,512 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-03-28 12:04:00,512 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-03-28 12:04:00,512 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-03-28 12:04:00,512 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-03-28 12:04:00,512 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-03-28 12:04:00,512 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-03-28 12:04:00,512 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-03-28 12:04:00,512 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-03-28 12:04:00,512 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-03-28 12:04:00,512 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-03-28 12:04:00,513 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-03-28 12:04:00,513 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-03-28 12:04:00,513 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-03-28 12:04:00,513 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-03-28 12:04:00,513 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-03-28 12:04:00,513 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-03-28 12:04:00,513 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-03-28 12:04:00,514 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-03-28 12:04:00,514 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-03-28 12:04:00,514 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-03-28 12:04:00,514 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-03-28 12:04:00,514 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-03-28 12:04:00,514 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-03-28 12:04:00,514 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-03-28 12:04:00,514 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-03-28 12:04:00,515 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-03-28 12:04:00,515 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-03-28 12:04:00,515 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-03-28 12:04:00,515 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-03-28 12:04:00,515 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-03-28 12:04:00,515 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-03-28 12:04:00,515 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-03-28 12:04:00,516 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-03-28 12:04:00,516 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-03-28 12:04:00,516 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-28 12:04:00,516 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-28 12:04:00,516 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-28 12:04:00,516 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-28 12:04:00,516 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-28 12:04:00,516 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-28 12:04:00,517 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-28 12:04:00,517 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-28 12:04:00,890 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-28 12:04:00,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:04:00 BoogieIcfgContainer [2018-03-28 12:04:00,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-28 12:04:00,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-28 12:04:00,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-28 12:04:00,894 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-28 12:04:00,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:03:59" (1/3) ... [2018-03-28 12:04:00,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b872397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:04:00, skipping insertion in model container [2018-03-28 12:04:00,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:00" (2/3) ... [2018-03-28 12:04:00,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b872397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:04:00, skipping insertion in model container [2018-03-28 12:04:00,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:04:00" (3/3) ... [2018-03-28 12:04:00,896 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-28 12:04:00,903 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-28 12:04:00,910 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-03-28 12:04:00,955 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-28 12:04:00,955 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-28 12:04:00,955 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-28 12:04:00,955 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-28 12:04:00,955 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-28 12:04:00,955 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-28 12:04:00,955 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-28 12:04:00,956 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-28 12:04:00,956 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-28 12:04:00,956 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-28 12:04:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-03-28 12:04:00,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-28 12:04:00,974 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:00,975 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:00,975 INFO L408 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:00,979 INFO L82 PathProgramCache]: Analyzing trace with hash -921233729, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:00,990 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:01,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:01,065 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:01,100 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:01,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-03-28 12:04:01,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-28 12:04:01,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-28 12:04:01,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-28 12:04:01,114 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states. [2018-03-28 12:04:01,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:01,206 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-03-28 12:04:01,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-28 12:04:01,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-03-28 12:04:01,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:01,220 INFO L225 Difference]: With dead ends: 112 [2018-03-28 12:04:01,220 INFO L226 Difference]: Without dead ends: 75 [2018-03-28 12:04:01,224 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-28 12:04:01,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-03-28 12:04:01,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-03-28 12:04:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-03-28 12:04:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-03-28 12:04:01,268 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 21 [2018-03-28 12:04:01,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:01,268 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-03-28 12:04:01,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-28 12:04:01,269 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-03-28 12:04:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-03-28 12:04:01,270 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:01,270 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:01,270 INFO L408 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:01,270 INFO L82 PathProgramCache]: Analyzing trace with hash 425643425, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:01,276 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:01,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:01,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:01,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:01,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:01,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:01,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:01,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-03-28 12:04:01,430 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:01,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-28 12:04:01,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:01,452 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:01,453 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:01,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:04:01,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:01,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:01,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-03-28 12:04:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:01,487 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:03,603 WARN L148 SmtUtils]: Spent 2061ms on a formula simplification that was a NOOP. DAG size: 26 [2018-03-28 12:04:03,657 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:03,658 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-03-28 12:04:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:03,692 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:03,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-03-28 12:04:03,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-28 12:04:03,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-28 12:04:03,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-03-28 12:04:03,694 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 9 states. [2018-03-28 12:04:03,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:03,807 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-03-28 12:04:03,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-28 12:04:03,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-03-28 12:04:03,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:03,810 INFO L225 Difference]: With dead ends: 75 [2018-03-28 12:04:03,810 INFO L226 Difference]: Without dead ends: 73 [2018-03-28 12:04:03,811 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-03-28 12:04:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-03-28 12:04:03,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-03-28 12:04:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-03-28 12:04:03,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-03-28 12:04:03,820 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 24 [2018-03-28 12:04:03,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:03,820 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-03-28 12:04:03,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-28 12:04:03,821 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-03-28 12:04:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-03-28 12:04:03,822 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:03,822 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:03,822 INFO L408 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:03,822 INFO L82 PathProgramCache]: Analyzing trace with hash 310044275, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:03,828 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:03,860 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:03,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:03,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:03,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:03,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-28 12:04:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:03,900 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:03,938 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:03,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-28 12:04:03,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-28 12:04:03,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-28 12:04:03,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-28 12:04:03,939 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2018-03-28 12:04:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:03,985 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-03-28 12:04:03,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-28 12:04:03,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-03-28 12:04:03,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:03,986 INFO L225 Difference]: With dead ends: 73 [2018-03-28 12:04:03,987 INFO L226 Difference]: Without dead ends: 72 [2018-03-28 12:04:03,987 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-03-28 12:04:03,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-03-28 12:04:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-03-28 12:04:03,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-03-28 12:04:03,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-03-28 12:04:03,992 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 25 [2018-03-28 12:04:03,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:03,992 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-03-28 12:04:03,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-28 12:04:03,993 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-03-28 12:04:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-03-28 12:04:03,993 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:03,993 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:03,993 INFO L408 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:03,994 INFO L82 PathProgramCache]: Analyzing trace with hash 310044276, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:04,003 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:04,017 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:04,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:04,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:04,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:04,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-03-28 12:04:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:04,076 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:04,126 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:04,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-03-28 12:04:04,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-28 12:04:04,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-28 12:04:04,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-03-28 12:04:04,127 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 8 states. [2018-03-28 12:04:04,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:04,243 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-03-28 12:04:04,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-28 12:04:04,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-03-28 12:04:04,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:04,244 INFO L225 Difference]: With dead ends: 72 [2018-03-28 12:04:04,244 INFO L226 Difference]: Without dead ends: 71 [2018-03-28 12:04:04,245 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-03-28 12:04:04,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-03-28 12:04:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-03-28 12:04:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-03-28 12:04:04,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-03-28 12:04:04,252 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 25 [2018-03-28 12:04:04,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:04,253 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-03-28 12:04:04,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-28 12:04:04,253 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-03-28 12:04:04,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-03-28 12:04:04,254 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:04,254 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:04,254 INFO L408 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:04,254 INFO L82 PathProgramCache]: Analyzing trace with hash 178192733, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:04,263 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:04,280 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:04,306 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:04,344 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:04,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-03-28 12:04:04,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-28 12:04:04,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-28 12:04:04,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-28 12:04:04,345 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2018-03-28 12:04:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:04,441 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-03-28 12:04:04,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-28 12:04:04,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-03-28 12:04:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:04,443 INFO L225 Difference]: With dead ends: 78 [2018-03-28 12:04:04,443 INFO L226 Difference]: Without dead ends: 77 [2018-03-28 12:04:04,444 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-03-28 12:04:04,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-03-28 12:04:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-03-28 12:04:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-03-28 12:04:04,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-03-28 12:04:04,450 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 31 [2018-03-28 12:04:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:04,451 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-03-28 12:04:04,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-28 12:04:04,451 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-03-28 12:04:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-03-28 12:04:04,452 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:04,452 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:04,452 INFO L408 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:04,452 INFO L82 PathProgramCache]: Analyzing trace with hash 178192734, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:04,470 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:04,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:04,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:04,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:04,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:04,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-03-28 12:04:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:04,552 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:04,652 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:04,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2018-03-28 12:04:04,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-03-28 12:04:04,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-03-28 12:04:04,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-03-28 12:04:04,653 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 14 states. [2018-03-28 12:04:04,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:04,842 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-03-28 12:04:04,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-28 12:04:04,842 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-03-28 12:04:04,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:04,843 INFO L225 Difference]: With dead ends: 85 [2018-03-28 12:04:04,843 INFO L226 Difference]: Without dead ends: 84 [2018-03-28 12:04:04,844 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-03-28 12:04:04,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-03-28 12:04:04,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2018-03-28 12:04:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-03-28 12:04:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-03-28 12:04:04,852 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 31 [2018-03-28 12:04:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:04,852 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-03-28 12:04:04,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-03-28 12:04:04,853 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-03-28 12:04:04,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-03-28 12:04:04,854 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:04,854 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:04,854 INFO L408 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:04,855 INFO L82 PathProgramCache]: Analyzing trace with hash 404305818, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:04,861 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:04,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-28 12:04:04,921 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-28 12:04:04,946 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:04,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-03-28 12:04:04,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-28 12:04:04,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-28 12:04:04,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-03-28 12:04:04,947 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 7 states. [2018-03-28 12:04:05,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:05,033 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-03-28 12:04:05,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-28 12:04:05,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-03-28 12:04:05,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:05,035 INFO L225 Difference]: With dead ends: 76 [2018-03-28 12:04:05,035 INFO L226 Difference]: Without dead ends: 75 [2018-03-28 12:04:05,035 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-03-28 12:04:05,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-03-28 12:04:05,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-03-28 12:04:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-03-28 12:04:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-03-28 12:04:05,040 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 38 [2018-03-28 12:04:05,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:05,040 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-03-28 12:04:05,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-28 12:04:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-03-28 12:04:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-03-28 12:04:05,041 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:05,041 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:05,041 INFO L408 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:05,041 INFO L82 PathProgramCache]: Analyzing trace with hash 404305819, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:05,047 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:05,069 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:05,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:05,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:05,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:05,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-03-28 12:04:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:05,174 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:05,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:04:05,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-03-28 12:04:05,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-03-28 12:04:05,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-03-28 12:04:05,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-03-28 12:04:05,336 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 19 states. [2018-03-28 12:04:05,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:05,692 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-03-28 12:04:05,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-28 12:04:05,693 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-03-28 12:04:05,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:05,696 INFO L225 Difference]: With dead ends: 95 [2018-03-28 12:04:05,696 INFO L226 Difference]: Without dead ends: 94 [2018-03-28 12:04:05,697 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-03-28 12:04:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-03-28 12:04:05,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2018-03-28 12:04:05,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-03-28 12:04:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-03-28 12:04:05,706 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 38 [2018-03-28 12:04:05,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:05,706 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-03-28 12:04:05,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-03-28 12:04:05,707 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-03-28 12:04:05,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-03-28 12:04:05,708 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:05,708 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:05,708 INFO L408 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:05,708 INFO L82 PathProgramCache]: Analyzing trace with hash 585207874, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:05,718 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:05,739 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:05,769 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:05,803 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:05,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-03-28 12:04:05,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-28 12:04:05,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-28 12:04:05,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-28 12:04:05,804 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2018-03-28 12:04:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:05,882 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-03-28 12:04:05,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-28 12:04:05,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-03-28 12:04:05,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:05,883 INFO L225 Difference]: With dead ends: 79 [2018-03-28 12:04:05,883 INFO L226 Difference]: Without dead ends: 78 [2018-03-28 12:04:05,883 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-03-28 12:04:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-03-28 12:04:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-03-28 12:04:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-03-28 12:04:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-03-28 12:04:05,890 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-03-28 12:04:05,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:05,891 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-03-28 12:04:05,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-28 12:04:05,891 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-03-28 12:04:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-03-28 12:04:05,892 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:05,892 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:05,892 INFO L408 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:05,892 INFO L82 PathProgramCache]: Analyzing trace with hash 585207875, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:05,899 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:05,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:06,005 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:06,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-03-28 12:04:06,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:06,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-03-28 12:04:06,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:06,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:06,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-03-28 12:04:06,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:06,076 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:06,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-03-28 12:04:06,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-28 12:04:06,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-28 12:04:06,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-03-28 12:04:06,078 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 9 states. [2018-03-28 12:04:06,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:06,399 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-03-28 12:04:06,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-28 12:04:06,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-03-28 12:04:06,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:06,400 INFO L225 Difference]: With dead ends: 85 [2018-03-28 12:04:06,400 INFO L226 Difference]: Without dead ends: 84 [2018-03-28 12:04:06,401 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-03-28 12:04:06,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-03-28 12:04:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-03-28 12:04:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-03-28 12:04:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-03-28 12:04:06,406 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 39 [2018-03-28 12:04:06,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:06,406 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-03-28 12:04:06,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-28 12:04:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-03-28 12:04:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-03-28 12:04:06,406 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:06,407 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:06,407 INFO L408 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:06,407 INFO L82 PathProgramCache]: Analyzing trace with hash 961574980, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:06,413 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:06,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:06,463 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:06,489 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:06,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-03-28 12:04:06,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-28 12:04:06,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-28 12:04:06,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-03-28 12:04:06,489 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 7 states. [2018-03-28 12:04:06,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:06,566 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-03-28 12:04:06,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-28 12:04:06,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-03-28 12:04:06,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:06,568 INFO L225 Difference]: With dead ends: 84 [2018-03-28 12:04:06,568 INFO L226 Difference]: Without dead ends: 83 [2018-03-28 12:04:06,568 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-03-28 12:04:06,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-03-28 12:04:06,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-03-28 12:04:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-03-28 12:04:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-03-28 12:04:06,575 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 40 [2018-03-28 12:04:06,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:06,575 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-03-28 12:04:06,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-28 12:04:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-03-28 12:04:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-03-28 12:04:06,576 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:06,577 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:06,577 INFO L408 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:06,577 INFO L82 PathProgramCache]: Analyzing trace with hash 961574981, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:06,592 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:06,615 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:06,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:06,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:06,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:06,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-03-28 12:04:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:06,712 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:06,833 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:06,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2018-03-28 12:04:06,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-03-28 12:04:06,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-03-28 12:04:06,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-03-28 12:04:06,834 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 18 states. [2018-03-28 12:04:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:07,172 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-03-28 12:04:07,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-03-28 12:04:07,172 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-03-28 12:04:07,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:07,174 INFO L225 Difference]: With dead ends: 110 [2018-03-28 12:04:07,174 INFO L226 Difference]: Without dead ends: 109 [2018-03-28 12:04:07,175 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2018-03-28 12:04:07,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-03-28 12:04:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2018-03-28 12:04:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-03-28 12:04:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-03-28 12:04:07,182 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 40 [2018-03-28 12:04:07,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:07,182 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-03-28 12:04:07,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-03-28 12:04:07,183 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-03-28 12:04:07,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-03-28 12:04:07,183 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:07,184 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:07,184 INFO L408 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:07,184 INFO L82 PathProgramCache]: Analyzing trace with hash 226357950, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:07,192 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:07,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:07,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:07,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:07,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:07,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-03-28 12:04:07,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-03-28 12:04:07,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:04:07,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:07,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:07,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:04:07,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-03-28 12:04:07,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-03-28 12:04:07,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-03-28 12:04:07,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 12:04:07,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:07,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:07,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35 [2018-03-28 12:04:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:07,568 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:07,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-03-28 12:04:07,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-03-28 12:04:07,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:07,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:07,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:07,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:38 [2018-03-28 12:04:08,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:08,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:04:08,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-03-28 12:04:08,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-03-28 12:04:08,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-03-28 12:04:08,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2018-03-28 12:04:08,040 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 31 states. [2018-03-28 12:04:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:10,970 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-03-28 12:04:10,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-03-28 12:04:10,970 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-03-28 12:04:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:10,971 INFO L225 Difference]: With dead ends: 124 [2018-03-28 12:04:10,971 INFO L226 Difference]: Without dead ends: 123 [2018-03-28 12:04:10,972 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=351, Invalid=2301, Unknown=0, NotChecked=0, Total=2652 [2018-03-28 12:04:10,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-03-28 12:04:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2018-03-28 12:04:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-03-28 12:04:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-03-28 12:04:10,978 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 45 [2018-03-28 12:04:10,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:10,978 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-03-28 12:04:10,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-03-28 12:04:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-03-28 12:04:10,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-03-28 12:04:10,979 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:10,979 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:10,979 INFO L408 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:10,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1360561045, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:10,985 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:11,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:11,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:11,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:11,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:11,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 12:04:11,047 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:11,057 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:11,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:04:11,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:11,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:11,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-03-28 12:04:11,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-03-28 12:04:11,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:04:11,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:11,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:11,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:04:11,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-03-28 12:04:11,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-03-28 12:04:11,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:04:11,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:11,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:11,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-03-28 12:04:11,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-03-28 12:04:11,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-03-28 12:04:11,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-03-28 12:04:11,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:11,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-03-28 12:04:11,387 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-03-28 12:04:11,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:11,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:11,400 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-03-28 12:04:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:11,463 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:11,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-03-28 12:04:11,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:11,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-03-28 12:04:11,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-03-28 12:04:11,692 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:11,693 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:11,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:11,698 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-03-28 12:04:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:11,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:04:11,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-03-28 12:04:11,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-03-28 12:04:11,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-03-28 12:04:11,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-03-28 12:04:11,753 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 25 states. [2018-03-28 12:04:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:12,420 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2018-03-28 12:04:12,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-03-28 12:04:12,420 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-03-28 12:04:12,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:12,421 INFO L225 Difference]: With dead ends: 128 [2018-03-28 12:04:12,421 INFO L226 Difference]: Without dead ends: 127 [2018-03-28 12:04:12,422 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=1349, Unknown=0, NotChecked=0, Total=1560 [2018-03-28 12:04:12,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-03-28 12:04:12,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2018-03-28 12:04:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-03-28 12:04:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-03-28 12:04:12,428 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 50 [2018-03-28 12:04:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:12,428 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-03-28 12:04:12,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-03-28 12:04:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-03-28 12:04:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-03-28 12:04:12,429 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:12,429 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:12,429 INFO L408 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:12,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1356203461, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:12,434 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:12,454 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:12,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:12,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:12,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:12,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-03-28 12:04:12,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-03-28 12:04:12,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:04:12,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:12,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:12,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:04:12,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-03-28 12:04:12,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-03-28 12:04:12,668 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:12,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-03-28 12:04:12,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 12:04:12,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:12,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:12,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2018-03-28 12:04:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:12,840 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:13,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-03-28 12:04:13,351 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:04:13,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-03-28 12:04:13,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:13,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:13,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:13,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:54 [2018-03-28 12:04:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:13,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:04:13,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-03-28 12:04:13,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-03-28 12:04:13,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-03-28 12:04:13,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1356, Unknown=0, NotChecked=0, Total=1482 [2018-03-28 12:04:13,564 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 39 states. [2018-03-28 12:04:14,590 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 69 DAG size of output 61 [2018-03-28 12:04:15,433 WARN L151 SmtUtils]: Spent 779ms on a formula simplification. DAG size of input: 61 DAG size of output 58 [2018-03-28 12:04:16,141 WARN L151 SmtUtils]: Spent 610ms on a formula simplification. DAG size of input: 77 DAG size of output 72 [2018-03-28 12:04:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:17,154 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2018-03-28 12:04:17,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-03-28 12:04:17,154 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-03-28 12:04:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:17,155 INFO L225 Difference]: With dead ends: 148 [2018-03-28 12:04:17,155 INFO L226 Difference]: Without dead ends: 147 [2018-03-28 12:04:17,157 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=599, Invalid=4231, Unknown=0, NotChecked=0, Total=4830 [2018-03-28 12:04:17,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-03-28 12:04:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2018-03-28 12:04:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-03-28 12:04:17,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-03-28 12:04:17,174 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 52 [2018-03-28 12:04:17,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:17,174 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-03-28 12:04:17,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-03-28 12:04:17,174 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-03-28 12:04:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-03-28 12:04:17,175 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:17,175 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:17,175 INFO L408 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:17,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1296239548, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:17,182 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:17,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:17,245 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:17,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-03-28 12:04:17,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-03-28 12:04:17,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:17,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:17,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-28 12:04:17,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-28 12:04:17,287 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-03-28 12:04:17,291 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-03-28 12:04:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:17,298 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:17,341 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_16| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_16|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_16| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_16| 0) |c_old(#valid)|))) is different from false [2018-03-28 12:04:17,346 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_15| Int) (|v_main_#t~malloc11.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_15| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_16|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_16| 1) |v_main_#t~malloc10.base_15| 0) |v_main_#t~malloc11.base_16| 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_15|) 0))))) is different from false [2018-03-28 12:04:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:17,423 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:17,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-28 12:04:17,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-28 12:04:17,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-28 12:04:17,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-28 12:04:17,424 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 12 states. [2018-03-28 12:04:17,440 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_15| Int) (|v_main_#t~malloc11.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_15| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_16|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_16| 1) |v_main_#t~malloc10.base_15| 0) |v_main_#t~malloc11.base_16| 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_15|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-03-28 12:04:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:17,725 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions. [2018-03-28 12:04:17,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-28 12:04:17,725 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-03-28 12:04:17,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:17,727 INFO L225 Difference]: With dead ends: 249 [2018-03-28 12:04:17,727 INFO L226 Difference]: Without dead ends: 235 [2018-03-28 12:04:17,728 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-03-28 12:04:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-03-28 12:04:17,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-03-28 12:04:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-03-28 12:04:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 252 transitions. [2018-03-28 12:04:17,750 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 252 transitions. Word has length 54 [2018-03-28 12:04:17,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:17,751 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 252 transitions. [2018-03-28 12:04:17,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-28 12:04:17,751 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 252 transitions. [2018-03-28 12:04:17,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-03-28 12:04:17,752 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:17,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, 1, 1, 1] [2018-03-28 12:04:17,752 INFO L408 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:17,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1324238768, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:17,760 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:17,782 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:17,852 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:17,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-03-28 12:04:17,865 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:17,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-03-28 12:04:17,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:17,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:17,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-28 12:04:17,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-28 12:04:17,950 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-03-28 12:04:17,953 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-03-28 12:04:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:17,961 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:18,027 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_18| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_18| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_18| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_18|))))) is different from false [2018-03-28 12:04:18,031 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_17| Int) (|v_main_#t~malloc11.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_17| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_18| 1) |v_main_#t~malloc10.base_17| 0) |v_main_#t~malloc11.base_18| 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_18|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_17|) 0))))) is different from false [2018-03-28 12:04:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:18,090 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:18,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-28 12:04:18,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-28 12:04:18,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-28 12:04:18,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-28 12:04:18,091 INFO L87 Difference]: Start difference. First operand 232 states and 252 transitions. Second operand 12 states. [2018-03-28 12:04:18,109 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_17| Int) (|v_main_#t~malloc11.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_17| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_18| 1) |v_main_#t~malloc10.base_17| 0) |v_main_#t~malloc11.base_18| 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_18|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_17|) 0)))))) is different from false [2018-03-28 12:04:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:18,468 INFO L93 Difference]: Finished difference Result 346 states and 374 transitions. [2018-03-28 12:04:18,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-28 12:04:18,469 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-03-28 12:04:18,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:18,471 INFO L225 Difference]: With dead ends: 346 [2018-03-28 12:04:18,471 INFO L226 Difference]: Without dead ends: 332 [2018-03-28 12:04:18,472 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-03-28 12:04:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-03-28 12:04:18,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 231. [2018-03-28 12:04:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-03-28 12:04:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 250 transitions. [2018-03-28 12:04:18,497 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 250 transitions. Word has length 55 [2018-03-28 12:04:18,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:18,497 INFO L459 AbstractCegarLoop]: Abstraction has 231 states and 250 transitions. [2018-03-28 12:04:18,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-28 12:04:18,497 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 250 transitions. [2018-03-28 12:04:18,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-03-28 12:04:18,498 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:18,499 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:18,499 INFO L408 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:18,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1202236565, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:18,510 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:18,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:18,577 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:18,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-03-28 12:04:18,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-03-28 12:04:18,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:18,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:18,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-28 12:04:18,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-28 12:04:18,629 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-03-28 12:04:18,632 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-03-28 12:04:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:18,640 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:18,656 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_20| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_20| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_20|))))) is different from false [2018-03-28 12:04:18,660 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_20| Int) (|v_main_#t~malloc10.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_19| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_20|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_20| 1) |v_main_#t~malloc10.base_19| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_19|)))))) is different from false [2018-03-28 12:04:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:18,703 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:18,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-28 12:04:18,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-28 12:04:18,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-28 12:04:18,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-28 12:04:18,704 INFO L87 Difference]: Start difference. First operand 231 states and 250 transitions. Second operand 12 states. [2018-03-28 12:04:18,713 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc11.base_20| Int) (|v_main_#t~malloc10.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_19| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_20|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_20| 1) |v_main_#t~malloc10.base_19| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_19|))))))) is different from false [2018-03-28 12:04:18,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:18,972 INFO L93 Difference]: Finished difference Result 347 states and 375 transitions. [2018-03-28 12:04:18,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-28 12:04:18,973 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-03-28 12:04:18,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:18,974 INFO L225 Difference]: With dead ends: 347 [2018-03-28 12:04:18,974 INFO L226 Difference]: Without dead ends: 333 [2018-03-28 12:04:18,975 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-03-28 12:04:18,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-03-28 12:04:18,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 233. [2018-03-28 12:04:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-03-28 12:04:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 253 transitions. [2018-03-28 12:04:18,992 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 253 transitions. Word has length 55 [2018-03-28 12:04:18,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:18,993 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 253 transitions. [2018-03-28 12:04:18,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-28 12:04:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 253 transitions. [2018-03-28 12:04:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-03-28 12:04:18,993 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:18,993 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:18,994 INFO L408 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:18,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1018456304, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:19,001 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:19,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:19,043 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:19,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-03-28 12:04:19,045 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:19,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-03-28 12:04:19,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:19,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:19,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-28 12:04:19,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-28 12:04:19,096 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-03-28 12:04:19,100 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-03-28 12:04:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:19,107 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:19,134 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_22| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_22|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_22| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|))) is different from false [2018-03-28 12:04:19,138 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_21| Int) (|v_main_#t~malloc11.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_22| 1) |v_main_#t~malloc10.base_21| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_22|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_21|) 0))))) is different from false [2018-03-28 12:04:19,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:19,176 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:19,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-28 12:04:19,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-28 12:04:19,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-28 12:04:19,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-28 12:04:19,177 INFO L87 Difference]: Start difference. First operand 233 states and 253 transitions. Second operand 12 states. [2018-03-28 12:04:19,192 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_21| Int) (|v_main_#t~malloc11.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_22| 1) |v_main_#t~malloc10.base_21| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_22|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_21|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-03-28 12:04:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:19,559 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-03-28 12:04:19,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-28 12:04:19,559 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-03-28 12:04:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:19,561 INFO L225 Difference]: With dead ends: 348 [2018-03-28 12:04:19,561 INFO L226 Difference]: Without dead ends: 334 [2018-03-28 12:04:19,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-03-28 12:04:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-03-28 12:04:19,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 235. [2018-03-28 12:04:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-03-28 12:04:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions. [2018-03-28 12:04:19,578 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 55 [2018-03-28 12:04:19,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:19,578 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions. [2018-03-28 12:04:19,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-28 12:04:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions. [2018-03-28 12:04:19,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-03-28 12:04:19,578 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:19,579 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:19,579 INFO L408 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:19,579 INFO L82 PathProgramCache]: Analyzing trace with hash 832685737, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:19,586 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:19,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:19,642 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:19,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-03-28 12:04:19,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-03-28 12:04:19,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:19,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:19,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-28 12:04:19,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-28 12:04:19,693 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-03-28 12:04:19,698 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-03-28 12:04:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:19,718 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:19,737 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_24| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_24| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_24|))))) is different from false [2018-03-28 12:04:19,740 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_24| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc11.base_24|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_24| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|)))) is different from false [2018-03-28 12:04:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:19,790 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:19,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-28 12:04:19,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-28 12:04:19,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-28 12:04:19,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-28 12:04:19,791 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand 12 states. [2018-03-28 12:04:19,799 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_24| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc11.base_24|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_24| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|)))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-03-28 12:04:20,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:20,097 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-03-28 12:04:20,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-28 12:04:20,097 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-03-28 12:04:20,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:20,099 INFO L225 Difference]: With dead ends: 348 [2018-03-28 12:04:20,099 INFO L226 Difference]: Without dead ends: 334 [2018-03-28 12:04:20,099 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-03-28 12:04:20,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-03-28 12:04:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 233. [2018-03-28 12:04:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-03-28 12:04:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 253 transitions. [2018-03-28 12:04:20,127 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 253 transitions. Word has length 56 [2018-03-28 12:04:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:20,127 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 253 transitions. [2018-03-28 12:04:20,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-28 12:04:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 253 transitions. [2018-03-28 12:04:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-03-28 12:04:20,128 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:20,128 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:20,129 INFO L408 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:20,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1388007132, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:20,139 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:20,157 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:20,179 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:20,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-03-28 12:04:20,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-03-28 12:04:20,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:20,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:20,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-28 12:04:20,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-28 12:04:20,217 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-03-28 12:04:20,221 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-03-28 12:04:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:20,231 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:20,250 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_26| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_26|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_26| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_26| 0) |c_old(#valid)|))) is different from false [2018-03-28 12:04:20,253 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_25| Int) (|v_main_#t~malloc11.base_26| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_25|) 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_26|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_26| 1) |v_main_#t~malloc10.base_25| 0) |v_main_#t~malloc11.base_26| 0))))) is different from false [2018-03-28 12:04:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:20,292 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:20,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-28 12:04:20,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-28 12:04:20,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-28 12:04:20,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-28 12:04:20,293 INFO L87 Difference]: Start difference. First operand 233 states and 253 transitions. Second operand 12 states. [2018-03-28 12:04:20,302 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_25| Int) (|v_main_#t~malloc11.base_26| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_25|) 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_26|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_26| 1) |v_main_#t~malloc10.base_25| 0) |v_main_#t~malloc11.base_26| 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-03-28 12:04:20,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:20,680 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-03-28 12:04:20,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-28 12:04:20,681 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-03-28 12:04:20,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:20,683 INFO L225 Difference]: With dead ends: 348 [2018-03-28 12:04:20,683 INFO L226 Difference]: Without dead ends: 334 [2018-03-28 12:04:20,684 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-03-28 12:04:20,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-03-28 12:04:20,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 232. [2018-03-28 12:04:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-03-28 12:04:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-03-28 12:04:20,711 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 56 [2018-03-28 12:04:20,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:20,712 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-03-28 12:04:20,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-28 12:04:20,712 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-03-28 12:04:20,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-03-28 12:04:20,713 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:20,713 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:20,713 INFO L408 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:20,713 INFO L82 PathProgramCache]: Analyzing trace with hash -875108129, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:20,722 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:20,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:20,769 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:20,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-03-28 12:04:20,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-03-28 12:04:20,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:20,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:20,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-28 12:04:20,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-28 12:04:20,807 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-03-28 12:04:20,811 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-03-28 12:04:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:20,817 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:20,837 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_28| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_28|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_28| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_28| 0) |c_old(#valid)|))) is different from false [2018-03-28 12:04:20,841 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_27| Int) (|v_main_#t~malloc11.base_28| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_27| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_28|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_28| 1) |v_main_#t~malloc10.base_27| 0) |v_main_#t~malloc11.base_28| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc10.base_27|) 0))))) is different from false [2018-03-28 12:04:20,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:20,897 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:20,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-28 12:04:20,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-28 12:04:20,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-28 12:04:20,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-28 12:04:20,898 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 12 states. [2018-03-28 12:04:20,919 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_27| Int) (|v_main_#t~malloc11.base_28| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_27| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_28|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_28| 1) |v_main_#t~malloc10.base_27| 0) |v_main_#t~malloc11.base_28| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc10.base_27|) 0)))))) is different from false [2018-03-28 12:04:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:21,377 INFO L93 Difference]: Finished difference Result 349 states and 377 transitions. [2018-03-28 12:04:21,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-28 12:04:21,380 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-03-28 12:04:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:21,382 INFO L225 Difference]: With dead ends: 349 [2018-03-28 12:04:21,382 INFO L226 Difference]: Without dead ends: 335 [2018-03-28 12:04:21,383 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-03-28 12:04:21,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-03-28 12:04:21,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 234. [2018-03-28 12:04:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-03-28 12:04:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 254 transitions. [2018-03-28 12:04:21,412 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 254 transitions. Word has length 56 [2018-03-28 12:04:21,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:21,413 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 254 transitions. [2018-03-28 12:04:21,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-28 12:04:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 254 transitions. [2018-03-28 12:04:21,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-03-28 12:04:21,414 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:21,414 INFO L408 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:21,415 INFO L82 PathProgramCache]: Analyzing trace with hash 553718091, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:21,423 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:21,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:21,501 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:21,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-03-28 12:04:21,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-03-28 12:04:21,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:21,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:21,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-28 12:04:21,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-28 12:04:21,537 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-03-28 12:04:21,541 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-03-28 12:04:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:21,548 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:21,568 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_30| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_30|))) (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc11.base_30| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_30| 0)))) is different from false [2018-03-28 12:04:21,571 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_30| Int) (|v_main_#t~malloc10.base_29| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_29| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_29|) 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_30|))) (= (store (store (store .cse0 |v_main_#t~malloc11.base_30| 1) |v_main_#t~malloc10.base_29| 0) |v_main_#t~malloc11.base_30| 0) |c_old(#valid)|)))) is different from false [2018-03-28 12:04:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:21,640 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:04:21,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-28 12:04:21,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-28 12:04:21,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-28 12:04:21,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-28 12:04:21,641 INFO L87 Difference]: Start difference. First operand 234 states and 254 transitions. Second operand 12 states. [2018-03-28 12:04:21,653 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc11.base_30| Int) (|v_main_#t~malloc10.base_29| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_29| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_29|) 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_30|))) (= (store (store (store .cse0 |v_main_#t~malloc11.base_30| 1) |v_main_#t~malloc10.base_29| 0) |v_main_#t~malloc11.base_30| 0) |c_old(#valid)|))))) is different from false [2018-03-28 12:04:21,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:21,914 INFO L93 Difference]: Finished difference Result 237 states and 254 transitions. [2018-03-28 12:04:21,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-28 12:04:21,914 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-03-28 12:04:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:21,915 INFO L225 Difference]: With dead ends: 237 [2018-03-28 12:04:21,915 INFO L226 Difference]: Without dead ends: 223 [2018-03-28 12:04:21,915 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-03-28 12:04:21,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-03-28 12:04:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 120. [2018-03-28 12:04:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-03-28 12:04:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-03-28 12:04:21,930 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 57 [2018-03-28 12:04:21,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:21,930 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-03-28 12:04:21,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-28 12:04:21,930 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-03-28 12:04:21,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-03-28 12:04:21,930 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:21,930 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:21,931 INFO L408 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:21,931 INFO L82 PathProgramCache]: Analyzing trace with hash -21117222, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:21,940 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:21,965 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:21,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:21,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:21,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:21,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:21,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:21,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-03-28 12:04:22,004 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:22,005 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:22,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-03-28 12:04:22,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:22,014 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:22,014 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:22,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:04:22,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:22,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:22,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-03-28 12:04:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:22,262 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:22,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-03-28 12:04:22,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:22,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-03-28 12:04:22,850 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-28 12:04:22,850 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:22,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-03-28 12:04:22,851 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:22,853 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:22,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:22,856 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-03-28 12:04:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:22,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:04:22,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-03-28 12:04:22,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-03-28 12:04:22,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-03-28 12:04:22,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1687, Unknown=0, NotChecked=0, Total=1806 [2018-03-28 12:04:22,914 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 43 states. [2018-03-28 12:04:25,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:25,390 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2018-03-28 12:04:25,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-03-28 12:04:25,390 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 58 [2018-03-28 12:04:25,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:25,391 INFO L225 Difference]: With dead ends: 149 [2018-03-28 12:04:25,391 INFO L226 Difference]: Without dead ends: 148 [2018-03-28 12:04:25,392 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=769, Invalid=6203, Unknown=0, NotChecked=0, Total=6972 [2018-03-28 12:04:25,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-03-28 12:04:25,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 120. [2018-03-28 12:04:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-03-28 12:04:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-03-28 12:04:25,413 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 58 [2018-03-28 12:04:25,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:25,413 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-03-28 12:04:25,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-03-28 12:04:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-03-28 12:04:25,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-03-28 12:04:25,414 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:25,414 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:25,414 INFO L408 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:25,415 INFO L82 PathProgramCache]: Analyzing trace with hash -705173693, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:25,425 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:25,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:25,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-03-28 12:04:25,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:25,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:25,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:25,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:25,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-28 12:04:25,479 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:25,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-28 12:04:25,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:25,489 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:25,490 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:25,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:04:25,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:25,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:25,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-28 12:04:25,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-03-28 12:04:25,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-28 12:04:25,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:25,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:25,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:25,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-03-28 12:04:25,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-03-28 12:04:25,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:04:25,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:25,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:25,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-28 12:04:25,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-03-28 12:04:25,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-03-28 12:04:25,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-03-28 12:04:25,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 12:04:25,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:25,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-03-28 12:04:25,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:45 [2018-03-28 12:04:25,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-03-28 12:04:25,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-03-28 12:04:25,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 12:04:25,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:25,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:25,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-03-28 12:04:26,006 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:26,006 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:26,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-03-28 12:04:26,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-28 12:04:26,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:26,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-03-28 12:04:26,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-03-28 12:04:26,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:26,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:26,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-03-28 12:04:26,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-03-28 12:04:26,868 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:26,870 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:26,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:04:26,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:04:26,898 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-03-28 12:04:28,588 WARN L151 SmtUtils]: Spent 1523ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-03-28 12:04:30,030 WARN L148 SmtUtils]: Spent 1390ms on a formula simplification that was a NOOP. DAG size: 34 [2018-03-28 12:04:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:30,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:04:30,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-03-28 12:04:30,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-03-28 12:04:30,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-03-28 12:04:30,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1522, Unknown=0, NotChecked=0, Total=1640 [2018-03-28 12:04:30,067 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 41 states. [2018-03-28 12:04:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:31,653 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-03-28 12:04:31,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-03-28 12:04:31,685 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 61 [2018-03-28 12:04:31,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:31,686 INFO L225 Difference]: With dead ends: 154 [2018-03-28 12:04:31,686 INFO L226 Difference]: Without dead ends: 153 [2018-03-28 12:04:31,687 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=348, Invalid=3312, Unknown=0, NotChecked=0, Total=3660 [2018-03-28 12:04:31,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-03-28 12:04:31,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2018-03-28 12:04:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-03-28 12:04:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-03-28 12:04:31,700 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 61 [2018-03-28 12:04:31,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:31,700 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-03-28 12:04:31,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-03-28 12:04:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-03-28 12:04:31,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-03-28 12:04:31,701 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:31,701 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:31,701 INFO L408 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:31,701 INFO L82 PathProgramCache]: Analyzing trace with hash -385547963, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:31,709 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:31,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:31,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:31,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:31,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:31,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:31,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:31,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-03-28 12:04:31,787 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:31,787 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:31,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:04:31,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:31,795 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:31,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-03-28 12:04:31,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:31,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:31,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-03-28 12:04:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:32,115 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:32,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-03-28 12:04:32,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:32,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-03-28 12:04:32,806 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-28 12:04:32,806 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:32,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-03-28 12:04:32,808 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:32,812 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:32,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:32,816 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-03-28 12:04:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:32,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:04:32,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-03-28 12:04:32,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-03-28 12:04:32,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-03-28 12:04:32,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2102, Unknown=0, NotChecked=0, Total=2256 [2018-03-28 12:04:32,912 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 48 states. [2018-03-28 12:04:35,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:35,249 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-03-28 12:04:35,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-03-28 12:04:35,250 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 62 [2018-03-28 12:04:35,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:35,251 INFO L225 Difference]: With dead ends: 168 [2018-03-28 12:04:35,251 INFO L226 Difference]: Without dead ends: 167 [2018-03-28 12:04:35,252 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=836, Invalid=6646, Unknown=0, NotChecked=0, Total=7482 [2018-03-28 12:04:35,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-03-28 12:04:35,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2018-03-28 12:04:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-03-28 12:04:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-03-28 12:04:35,273 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 62 [2018-03-28 12:04:35,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:35,273 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2018-03-28 12:04:35,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-03-28 12:04:35,274 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-03-28 12:04:35,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-03-28 12:04:35,274 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:35,274 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:35,275 INFO L408 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:35,275 INFO L82 PathProgramCache]: Analyzing trace with hash -832531843, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:35,280 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:35,303 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:35,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:35,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:35,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:35,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-03-28 12:04:35,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-03-28 12:04:35,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:04:35,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:35,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:35,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:04:35,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-03-28 12:04:35,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-03-28 12:04:35,486 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:35,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-03-28 12:04:35,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 12:04:35,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:35,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:35,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2018-03-28 12:04:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:35,688 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:36,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-03-28 12:04:36,153 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:04:36,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-03-28 12:04:36,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:36,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:36,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:36,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:54 [2018-03-28 12:04:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:36,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:04:36,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-03-28 12:04:36,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-03-28 12:04:36,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-03-28 12:04:36,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1510, Unknown=0, NotChecked=0, Total=1640 [2018-03-28 12:04:36,381 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 41 states. [2018-03-28 12:04:43,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:43,626 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2018-03-28 12:04:43,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-03-28 12:04:43,626 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 65 [2018-03-28 12:04:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:43,627 INFO L225 Difference]: With dead ends: 205 [2018-03-28 12:04:43,627 INFO L226 Difference]: Without dead ends: 204 [2018-03-28 12:04:43,628 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=805, Invalid=6677, Unknown=0, NotChecked=0, Total=7482 [2018-03-28 12:04:43,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-03-28 12:04:43,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 160. [2018-03-28 12:04:43,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-03-28 12:04:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-03-28 12:04:43,641 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 65 [2018-03-28 12:04:43,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:43,641 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2018-03-28 12:04:43,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-03-28 12:04:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-03-28 12:04:43,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-03-28 12:04:43,642 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:43,642 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:43,642 INFO L408 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:43,642 INFO L82 PathProgramCache]: Analyzing trace with hash 434218203, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:43,647 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:43,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:43,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:43,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:43,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:43,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-03-28 12:04:43,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-03-28 12:04:43,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:04:43,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:43,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:43,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:04:43,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-03-28 12:04:44,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-03-28 12:04:44,122 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:44,122 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:44,123 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:44,124 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:44,124 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:44,125 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:44,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 93 [2018-03-28 12:04:44,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 12:04:44,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:44,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:44,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-03-28 12:04:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:44,391 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:45,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2018-03-28 12:04:45,385 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:04:45,387 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:04:45,387 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:04:45,387 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:04:45,387 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:04:45,388 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:04:45,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 49 [2018-03-28 12:04:45,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:45,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:45,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:45,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:86 [2018-03-28 12:04:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:45,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:04:45,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-03-28 12:04:45,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-03-28 12:04:45,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-03-28 12:04:45,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2720, Unknown=0, NotChecked=0, Total=2970 [2018-03-28 12:04:45,694 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 55 states. [2018-03-28 12:04:48,660 WARN L151 SmtUtils]: Spent 757ms on a formula simplification. DAG size of input: 95 DAG size of output 87 [2018-03-28 12:04:49,032 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 120 DAG size of output 107 [2018-03-28 12:04:49,209 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 98 DAG size of output 86 [2018-03-28 12:04:49,747 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 79 DAG size of output 71 [2018-03-28 12:04:50,532 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 80 DAG size of output 74 [2018-03-28 12:04:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:52,024 INFO L93 Difference]: Finished difference Result 214 states and 230 transitions. [2018-03-28 12:04:52,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-03-28 12:04:52,024 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 66 [2018-03-28 12:04:52,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:52,025 INFO L225 Difference]: With dead ends: 214 [2018-03-28 12:04:52,025 INFO L226 Difference]: Without dead ends: 213 [2018-03-28 12:04:52,027 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2468 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1479, Invalid=10293, Unknown=0, NotChecked=0, Total=11772 [2018-03-28 12:04:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-03-28 12:04:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 188. [2018-03-28 12:04:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-03-28 12:04:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2018-03-28 12:04:52,056 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 66 [2018-03-28 12:04:52,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:52,057 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2018-03-28 12:04:52,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-03-28 12:04:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2018-03-28 12:04:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-03-28 12:04:52,057 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:52,057 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:52,057 INFO L408 AbstractCegarLoop]: === Iteration 29 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:52,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1482206016, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:52,064 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:52,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:52,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-03-28 12:04:52,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:52,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:52,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:52,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:52,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-28 12:04:52,109 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:52,110 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:52,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:04:52,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:52,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-28 12:04:52,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:52,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:52,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-28 12:04:52,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-03-28 12:04:52,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-28 12:04:52,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:52,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:52,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:52,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-03-28 12:04:52,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-03-28 12:04:52,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:04:52,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:52,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:52,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-28 12:04:52,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-03-28 12:04:52,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-03-28 12:04:52,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-03-28 12:04:52,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 12:04:52,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:52,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-03-28 12:04:52,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:45 [2018-03-28 12:04:52,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-03-28 12:04:52,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-03-28 12:04:52,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 12:04:52,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:52,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:04:52,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-03-28 12:04:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-28 12:04:52,541 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:04:53,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-03-28 12:04:53,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-28 12:04:53,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:53,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-03-28 12:04:53,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-03-28 12:04:53,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:53,295 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:53,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-03-28 12:04:53,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-03-28 12:04:53,298 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:53,299 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:53,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:04:53,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:04:53,325 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-03-28 12:04:56,147 WARN L151 SmtUtils]: Spent 2672ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-03-28 12:04:57,607 WARN L148 SmtUtils]: Spent 1403ms on a formula simplification that was a NOOP. DAG size: 34 [2018-03-28 12:04:57,627 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-28 12:04:57,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:04:57,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2018-03-28 12:04:57,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-03-28 12:04:57,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-03-28 12:04:57,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-03-28 12:04:57,649 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand 43 states. [2018-03-28 12:04:59,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:04:59,269 INFO L93 Difference]: Finished difference Result 206 states and 219 transitions. [2018-03-28 12:04:59,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-03-28 12:04:59,269 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 68 [2018-03-28 12:04:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:04:59,270 INFO L225 Difference]: With dead ends: 206 [2018-03-28 12:04:59,270 INFO L226 Difference]: Without dead ends: 205 [2018-03-28 12:04:59,271 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=359, Invalid=3547, Unknown=0, NotChecked=0, Total=3906 [2018-03-28 12:04:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-03-28 12:04:59,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2018-03-28 12:04:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-03-28 12:04:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 214 transitions. [2018-03-28 12:04:59,292 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 214 transitions. Word has length 68 [2018-03-28 12:04:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:04:59,292 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 214 transitions. [2018-03-28 12:04:59,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-03-28 12:04:59,292 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 214 transitions. [2018-03-28 12:04:59,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-03-28 12:04:59,293 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:04:59,293 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:04:59,293 INFO L408 AbstractCegarLoop]: === Iteration 30 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:04:59,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1296253800, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:04:59,306 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:04:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:04:59,338 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:04:59,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:59,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:59,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:04:59,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:59,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:59,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-03-28 12:04:59,365 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:59,366 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:59,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-03-28 12:04:59,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:59,374 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:59,375 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:04:59,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:04:59,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:04:59,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:04:59,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-03-28 12:04:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:04:59,776 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:05:00,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-03-28 12:05:00,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:00,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-03-28 12:05:00,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-03-28 12:05:00,553 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:00,553 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-28 12:05:00,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:00,556 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:00,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:00,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-03-28 12:05:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:05:00,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:05:00,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-03-28 12:05:00,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-03-28 12:05:00,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-03-28 12:05:00,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2402, Unknown=0, NotChecked=0, Total=2550 [2018-03-28 12:05:00,625 INFO L87 Difference]: Start difference. First operand 200 states and 214 transitions. Second operand 51 states. [2018-03-28 12:05:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:05:04,290 INFO L93 Difference]: Finished difference Result 248 states and 265 transitions. [2018-03-28 12:05:04,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-03-28 12:05:04,290 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 69 [2018-03-28 12:05:04,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:05:04,291 INFO L225 Difference]: With dead ends: 248 [2018-03-28 12:05:04,291 INFO L226 Difference]: Without dead ends: 247 [2018-03-28 12:05:04,293 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1104, Invalid=10238, Unknown=0, NotChecked=0, Total=11342 [2018-03-28 12:05:04,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-03-28 12:05:04,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 200. [2018-03-28 12:05:04,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-03-28 12:05:04,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 214 transitions. [2018-03-28 12:05:04,327 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 214 transitions. Word has length 69 [2018-03-28 12:05:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:05:04,327 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 214 transitions. [2018-03-28 12:05:04,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-03-28 12:05:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 214 transitions. [2018-03-28 12:05:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-03-28 12:05:04,328 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:05:04,328 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:05:04,329 INFO L408 AbstractCegarLoop]: === Iteration 31 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:05:04,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1320893077, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:05:04,334 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:05:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:05:04,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:05:04,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:05:04,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:04,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:05:04,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:04,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:04,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-28 12:05:04,397 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:05:04,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-28 12:05:04,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:04,407 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:05:04,408 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:05:04,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:05:04,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:04,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:04,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-28 12:05:04,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-03-28 12:05:04,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-28 12:05:04,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:04,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:04,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:04,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-03-28 12:05:04,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-03-28 12:05:04,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:05:04,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:04,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:04,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-28 12:05:04,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-03-28 12:05:04,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-03-28 12:05:04,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-03-28 12:05:04,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 12:05:04,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:05:04,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-03-28 12:05:04,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:49 [2018-03-28 12:05:04,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-03-28 12:05:04,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:05:04,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:04,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:04,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:04,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-03-28 12:05:04,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-03-28 12:05:04,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-03-28 12:05:04,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 12:05:04,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:05:04,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:05:04,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-03-28 12:05:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:05:04,947 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:05:06,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-03-28 12:05:06,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-28 12:05:06,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:06,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-03-28 12:05:06,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-03-28 12:05:06,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-03-28 12:05:06,374 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-03-28 12:05:06,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-03-28 12:05:06,382 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:06,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-03-28 12:05:06,414 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-03-28 12:05:06,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2018-03-28 12:05:06,523 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-03-28 12:05:06,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2018-03-28 12:05:06,533 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-03-28 12:05:06,588 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:05:06,646 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:05:06,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-03-28 12:05:06,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-03-28 12:05:06,649 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:06,652 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:06,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2018-03-28 12:05:06,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-03-28 12:05:06,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-03-28 12:05:06,687 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-03-28 12:05:06,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:05:06,688 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:06,700 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-03-28 12:05:06,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-03-28 12:05:06,735 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:06,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-03-28 12:05:06,737 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:06,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-03-28 12:05:06,739 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:06,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 52 [2018-03-28 12:05:06,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-03-28 12:05:06,849 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:06,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-03-28 12:05:06,852 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:06,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2018-03-28 12:05:06,908 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 3 xjuncts. [2018-03-28 12:05:06,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2018-03-28 12:05:06,919 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 3 xjuncts. [2018-03-28 12:05:06,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2018-03-28 12:05:06,967 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-03-28 12:05:06,989 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:05:07,006 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-03-28 12:05:07,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-03-28 12:05:07,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:05:07,059 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 6 variables, input treesize:58, output treesize:84 [2018-03-28 12:05:07,530 WARN L151 SmtUtils]: Spent 307ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-03-28 12:05:07,902 WARN L148 SmtUtils]: Spent 308ms on a formula simplification that was a NOOP. DAG size: 34 [2018-03-28 12:05:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:05:07,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:05:07,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2018-03-28 12:05:07,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-03-28 12:05:07,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-03-28 12:05:07,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2375, Unknown=0, NotChecked=0, Total=2550 [2018-03-28 12:05:07,954 INFO L87 Difference]: Start difference. First operand 200 states and 214 transitions. Second operand 51 states. [2018-03-28 12:05:10,415 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 89 DAG size of output 48 [2018-03-28 12:05:13,469 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 93 DAG size of output 51 [2018-03-28 12:05:13,899 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 100 DAG size of output 47 [2018-03-28 12:05:16,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:05:16,243 INFO L93 Difference]: Finished difference Result 254 states and 269 transitions. [2018-03-28 12:05:16,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-03-28 12:05:16,243 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 72 [2018-03-28 12:05:16,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:05:16,244 INFO L225 Difference]: With dead ends: 254 [2018-03-28 12:05:16,245 INFO L226 Difference]: Without dead ends: 253 [2018-03-28 12:05:16,245 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=821, Invalid=5821, Unknown=0, NotChecked=0, Total=6642 [2018-03-28 12:05:16,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-03-28 12:05:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2018-03-28 12:05:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-03-28 12:05:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 267 transitions. [2018-03-28 12:05:16,271 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 267 transitions. Word has length 72 [2018-03-28 12:05:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:05:16,271 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 267 transitions. [2018-03-28 12:05:16,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-03-28 12:05:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 267 transitions. [2018-03-28 12:05:16,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-03-28 12:05:16,272 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:05:16,272 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:05:16,273 INFO L408 AbstractCegarLoop]: === Iteration 32 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:05:16,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2002787355, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:05:16,284 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:05:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:05:16,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:05:16,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:05:16,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:16,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:05:16,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:16,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:16,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-03-28 12:05:16,344 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:05:16,345 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:05:16,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:05:16,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:16,353 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:05:16,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-03-28 12:05:16,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:16,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:16,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-03-28 12:05:16,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-03-28 12:05:16,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:05:16,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:16,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:16,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:05:16,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-03-28 12:05:16,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-03-28 12:05:16,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-03-28 12:05:16,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 12:05:16,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:05:16,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:05:16,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:46 [2018-03-28 12:05:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:05:16,905 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:05:17,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-03-28 12:05:17,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-03-28 12:05:17,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:17,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:17,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:17,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:45 [2018-03-28 12:05:18,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-03-28 12:05:18,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:18,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-03-28 12:05:18,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-03-28 12:05:18,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:18,125 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:18,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-03-28 12:05:18,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-03-28 12:05:18,153 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:18,158 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:18,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-03-28 12:05:18,170 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:18,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:05:18,179 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-03-28 12:05:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:05:18,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:05:18,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 58 [2018-03-28 12:05:18,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-03-28 12:05:18,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-03-28 12:05:18,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3240, Unknown=0, NotChecked=0, Total=3422 [2018-03-28 12:05:18,268 INFO L87 Difference]: Start difference. First operand 252 states and 267 transitions. Second operand 59 states. [2018-03-28 12:05:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:05:26,408 INFO L93 Difference]: Finished difference Result 303 states and 321 transitions. [2018-03-28 12:05:26,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-03-28 12:05:26,408 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 76 [2018-03-28 12:05:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:05:26,409 INFO L225 Difference]: With dead ends: 303 [2018-03-28 12:05:26,410 INFO L226 Difference]: Without dead ends: 302 [2018-03-28 12:05:26,411 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3609 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1276, Invalid=15236, Unknown=0, NotChecked=0, Total=16512 [2018-03-28 12:05:26,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-03-28 12:05:26,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2018-03-28 12:05:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-03-28 12:05:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 267 transitions. [2018-03-28 12:05:26,433 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 267 transitions. Word has length 76 [2018-03-28 12:05:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:05:26,434 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 267 transitions. [2018-03-28 12:05:26,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-03-28 12:05:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 267 transitions. [2018-03-28 12:05:26,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-03-28 12:05:26,434 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:05:26,434 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:05:26,434 INFO L408 AbstractCegarLoop]: === Iteration 33 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:05:26,435 INFO L82 PathProgramCache]: Analyzing trace with hash 931867613, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:05:26,444 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:05:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:05:26,475 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:05:26,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:05:26,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:26,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:05:26,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:26,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-03-28 12:05:26,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-03-28 12:05:26,513 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:05:26,514 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:05:26,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-03-28 12:05:26,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:26,525 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:05:26,526 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:05:26,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:05:26,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:26,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:26,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-03-28 12:05:26,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-03-28 12:05:26,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:05:26,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:26,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:26,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:05:26,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-03-28 12:05:26,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-03-28 12:05:26,900 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:05:26,901 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:05:26,902 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:05:26,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 58 [2018-03-28 12:05:26,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 12:05:26,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:05:26,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:05:26,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:84 [2018-03-28 12:05:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:05:27,404 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:05:28,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-03-28 12:05:28,779 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:05:28,779 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:05:28,779 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:05:28,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-03-28 12:05:28,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:28,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:28,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:28,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:77 [2018-03-28 12:05:29,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-03-28 12:05:29,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:29,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-03-28 12:05:29,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-03-28 12:05:29,190 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:29,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:29,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-03-28 12:05:29,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:29,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-03-28 12:05:29,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-03-28 12:05:29,230 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:29,233 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:29,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:05:29,243 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-03-28 12:05:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:05:29,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:05:29,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2018-03-28 12:05:29,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-03-28 12:05:29,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-03-28 12:05:29,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=4167, Unknown=0, NotChecked=0, Total=4422 [2018-03-28 12:05:29,345 INFO L87 Difference]: Start difference. First operand 252 states and 267 transitions. Second operand 67 states. [2018-03-28 12:05:32,807 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 111 DAG size of output 79 [2018-03-28 12:05:34,833 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 102 DAG size of output 99 [2018-03-28 12:05:35,205 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 94 DAG size of output 91 [2018-03-28 12:05:36,013 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 118 DAG size of output 104 [2018-03-28 12:05:36,357 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 111 DAG size of output 99 [2018-03-28 12:05:36,998 WARN L151 SmtUtils]: Spent 202ms on a formula simplification. DAG size of input: 140 DAG size of output 121 [2018-03-28 12:05:37,305 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 111 DAG size of output 97 [2018-03-28 12:05:37,559 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 99 DAG size of output 96 [2018-03-28 12:05:37,993 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 98 DAG size of output 92 [2018-03-28 12:05:38,420 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 108 DAG size of output 99 [2018-03-28 12:05:38,606 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 94 DAG size of output 84 [2018-03-28 12:05:38,816 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 114 DAG size of output 99 [2018-03-28 12:05:39,032 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 101 DAG size of output 89 [2018-03-28 12:05:39,259 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 107 DAG size of output 97 [2018-03-28 12:05:39,637 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 92 DAG size of output 86 [2018-03-28 12:05:40,035 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 111 DAG size of output 100 [2018-03-28 12:05:40,766 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 101 DAG size of output 90 [2018-03-28 12:05:41,755 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 110 DAG size of output 94 [2018-03-28 12:05:42,475 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 93 DAG size of output 85 [2018-03-28 12:05:43,029 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 106 DAG size of output 92 [2018-03-28 12:05:43,475 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 87 DAG size of output 84 [2018-03-28 12:05:43,972 WARN L151 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 102 DAG size of output 91 [2018-03-28 12:05:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:05:44,529 INFO L93 Difference]: Finished difference Result 311 states and 329 transitions. [2018-03-28 12:05:44,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-03-28 12:05:44,529 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 79 [2018-03-28 12:05:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:05:44,530 INFO L225 Difference]: With dead ends: 311 [2018-03-28 12:05:44,530 INFO L226 Difference]: Without dead ends: 310 [2018-03-28 12:05:44,532 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6225 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=2108, Invalid=22698, Unknown=0, NotChecked=0, Total=24806 [2018-03-28 12:05:44,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-03-28 12:05:44,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 252. [2018-03-28 12:05:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-03-28 12:05:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 267 transitions. [2018-03-28 12:05:44,555 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 267 transitions. Word has length 79 [2018-03-28 12:05:44,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:05:44,556 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 267 transitions. [2018-03-28 12:05:44,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-03-28 12:05:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 267 transitions. [2018-03-28 12:05:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-03-28 12:05:44,556 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:05:44,557 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:05:44,557 INFO L408 AbstractCegarLoop]: === Iteration 34 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-28 12:05:44,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1319307314, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:05:44,562 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:05:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:05:44,587 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:05:44,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:05:44,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:44,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:05:44,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:44,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:44,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-28 12:05:44,623 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:05:44,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-28 12:05:44,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:44,631 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:05:44,631 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:05:44,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:05:44,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:44,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:44,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-28 12:05:44,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-03-28 12:05:44,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-28 12:05:44,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:44,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:44,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:44,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-03-28 12:05:44,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-03-28 12:05:44,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:05:44,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:44,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:44,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-28 12:05:44,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-03-28 12:05:44,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-03-28 12:05:44,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-03-28 12:05:44,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 12:05:44,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:05:44,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-03-28 12:05:44,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:49 [2018-03-28 12:05:45,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-03-28 12:05:45,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:05:45,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:45,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:45,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:45,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-03-28 12:05:45,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-03-28 12:05:45,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-03-28 12:05:45,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 12:05:45,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:05:45,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:05:45,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-03-28 12:05:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-28 12:05:45,193 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:05:45,806 WARN L148 SmtUtils]: Spent 136ms on a formula simplification that was a NOOP. DAG size: 43 [2018-03-28 12:05:51,246 WARN L148 SmtUtils]: Spent 1209ms on a formula simplification that was a NOOP. DAG size: 58 [2018-03-28 12:05:51,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-03-28 12:05:51,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-28 12:05:51,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:51,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2018-03-28 12:05:51,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-03-28 12:05:51,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-03-28 12:05:51,993 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-03-28 12:05:51,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-03-28 12:05:51,994 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:52,005 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-03-28 12:05:52,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-03-28 12:05:52,040 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:52,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-03-28 12:05:52,041 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:52,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-03-28 12:05:52,043 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:52,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 60 [2018-03-28 12:05:52,143 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:05:52,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-03-28 12:05:52,145 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:52,148 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:05:52,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-03-28 12:05:52,154 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:52,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-03-28 12:05:52,213 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-03-28 12:05:52,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2018-03-28 12:05:52,227 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-03-28 12:05:52,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2018-03-28 12:05:52,277 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-03-28 12:05:52,298 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-03-28 12:05:52,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-03-28 12:05:52,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-03-28 12:05:52,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 34 [2018-03-28 12:05:52,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2018-03-28 12:05:52,351 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-03-28 12:05:52,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2018-03-28 12:05:52,358 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-03-28 12:05:52,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-03-28 12:05:52,361 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:52,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2018-03-28 12:05:52,411 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-03-28 12:05:52,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2018-03-28 12:05:52,422 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 3 xjuncts. [2018-03-28 12:05:52,448 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:05:52,468 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:05:52,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-03-28 12:05:52,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-03-28 12:05:52,471 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-03-28 12:05:52,473 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:05:52,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-03-28 12:05:52,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:05:52,530 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 6 variables, input treesize:60, output treesize:84 [2018-03-28 12:05:53,020 WARN L151 SmtUtils]: Spent 314ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-03-28 12:05:53,405 WARN L148 SmtUtils]: Spent 309ms on a formula simplification that was a NOOP. DAG size: 34 [2018-03-28 12:05:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-28 12:05:53,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:05:53,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 52 [2018-03-28 12:05:53,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-03-28 12:05:53,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-03-28 12:05:53,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2577, Unknown=2, NotChecked=0, Total=2756 [2018-03-28 12:05:53,461 INFO L87 Difference]: Start difference. First operand 252 states and 267 transitions. Second operand 53 states. [2018-03-28 12:05:55,912 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 105 DAG size of output 64 [2018-03-28 12:06:06,883 WARN L151 SmtUtils]: Spent 3606ms on a formula simplification. DAG size of input: 110 DAG size of output 70 [2018-03-28 12:06:12,294 WARN L151 SmtUtils]: Spent 4057ms on a formula simplification. DAG size of input: 91 DAG size of output 58 [2018-03-28 12:06:17,784 WARN L151 SmtUtils]: Spent 5426ms on a formula simplification. DAG size of input: 71 DAG size of output 39 [2018-03-28 12:06:24,226 WARN L151 SmtUtils]: Spent 4082ms on a formula simplification. DAG size of input: 92 DAG size of output 52 Received shutdown request... [2018-03-28 12:06:28,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-03-28 12:06:28,697 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-28 12:06:28,700 WARN L197 ceAbstractionStarter]: Timeout [2018-03-28 12:06:28,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:06:28 BoogieIcfgContainer [2018-03-28 12:06:28,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-28 12:06:28,701 INFO L168 Benchmark]: Toolchain (without parser) took 148702.05 ms. Allocated memory was 306.2 MB in the beginning and 530.6 MB in the end (delta: 224.4 MB). Free memory was 242.6 MB in the beginning and 326.7 MB in the end (delta: -84.1 MB). Peak memory consumption was 140.3 MB. Max. memory is 5.3 GB. [2018-03-28 12:06:28,702 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 306.2 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-28 12:06:28,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.76 ms. Allocated memory is still 306.2 MB. Free memory was 242.6 MB in the beginning and 218.5 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-03-28 12:06:28,702 INFO L168 Benchmark]: Boogie Preprocessor took 59.65 ms. Allocated memory is still 306.2 MB. Free memory was 218.5 MB in the beginning and 215.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-03-28 12:06:28,703 INFO L168 Benchmark]: RCFGBuilder took 504.17 ms. Allocated memory was 306.2 MB in the beginning and 470.3 MB in the end (delta: 164.1 MB). Free memory was 215.6 MB in the beginning and 405.3 MB in the end (delta: -189.7 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. [2018-03-28 12:06:28,703 INFO L168 Benchmark]: TraceAbstraction took 147809.17 ms. Allocated memory was 470.3 MB in the beginning and 530.6 MB in the end (delta: 60.3 MB). Free memory was 405.3 MB in the beginning and 326.7 MB in the end (delta: 78.7 MB). Peak memory consumption was 138.9 MB. Max. memory is 5.3 GB. [2018-03-28 12:06:28,704 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.21 ms. Allocated memory is still 306.2 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 324.76 ms. Allocated memory is still 306.2 MB. Free memory was 242.6 MB in the beginning and 218.5 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 59.65 ms. Allocated memory is still 306.2 MB. Free memory was 218.5 MB in the beginning and 215.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 504.17 ms. Allocated memory was 306.2 MB in the beginning and 470.3 MB in the end (delta: 164.1 MB). Free memory was 215.6 MB in the beginning and 405.3 MB in the end (delta: -189.7 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 147809.17 ms. Allocated memory was 470.3 MB in the beginning and 530.6 MB in the end (delta: 60.3 MB). Free memory was 405.3 MB in the beginning and 326.7 MB in the end (delta: 78.7 MB). Peak memory consumption was 138.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 27 states, 53 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 75 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 27 states, 53 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 75 known predicates. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 27 states, 53 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 75 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 27 states, 53 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 75 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 27 states, 53 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 75 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 27 states, 53 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 75 known predicates. - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 27 states, 53 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 75 known predicates. - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 27 states, 53 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 75 known predicates. - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 27 states, 53 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 75 known predicates. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 27 states, 53 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 75 known predicates. - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (252states) and interpolant automaton (currently 27 states, 53 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 75 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 89 locations, 11 error locations. TIMEOUT Result, 147.7s OverallTime, 34 OverallIterations, 6 TraceHistogramMax, 104.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2189 SDtfs, 6400 SDslu, 24745 SDs, 0 SdLazy, 21371 SolverSat, 1095 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 28.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4110 GetRequests, 2637 SyntacticMatches, 34 SemanticMatches, 1438 ConstructedPredicates, 40 IntricatePredicates, 0 DeprecatedPredicates, 23344 ImplicationChecksByTransitivity, 105.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 33 MinimizatonAttempts, 1070 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 41.1s InterpolantComputationTime, 1737 NumberOfCodeBlocks, 1737 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 3406 ConstructedInterpolants, 686 QuantifiedInterpolants, 2755241 SizeOfPredicates, 639 NumberOfNonLiveVariables, 5357 ConjunctsInSsa, 1142 ConjunctsInUnsatCore, 68 InterpolantComputations, 38 PerfectInterpolantSequences, 16/928 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-28_12-06-28-710.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-28_12-06-28-710.csv Completed graceful shutdown