java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cf7e2d-m [2018-03-29 20:21:23,453 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-29 20:21:23,454 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-29 20:21:23,470 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-29 20:21:23,470 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-29 20:21:23,471 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-29 20:21:23,472 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-29 20:21:23,473 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-29 20:21:23,474 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-29 20:21:23,475 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-29 20:21:23,476 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-29 20:21:23,476 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-29 20:21:23,477 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-29 20:21:23,479 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-29 20:21:23,480 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-29 20:21:23,482 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-29 20:21:23,484 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-29 20:21:23,486 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-29 20:21:23,487 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-29 20:21:23,489 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-29 20:21:23,491 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-29 20:21:23,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-29 20:21:23,492 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-29 20:21:23,493 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-29 20:21:23,494 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-29 20:21:23,495 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-29 20:21:23,495 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-29 20:21:23,496 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-29 20:21:23,497 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-29 20:21:23,497 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-29 20:21:23,498 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-29 20:21:23,498 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-03-29 20:21:23,525 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-29 20:21:23,525 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-29 20:21:23,525 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-29 20:21:23,526 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-29 20:21:23,526 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-29 20:21:23,527 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-29 20:21:23,527 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-29 20:21:23,527 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-29 20:21:23,527 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-29 20:21:23,528 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-29 20:21:23,528 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-29 20:21:23,528 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-29 20:21:23,528 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-29 20:21:23,528 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-29 20:21:23,529 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-29 20:21:23,529 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-29 20:21:23,529 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-29 20:21:23,529 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-29 20:21:23,529 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-29 20:21:23,529 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-29 20:21:23,530 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-29 20:21:23,530 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-29 20:21:23,530 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-29 20:21:23,530 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-29 20:21:23,530 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-29 20:21:23,530 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-29 20:21:23,531 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-29 20:21:23,531 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-29 20:21:23,531 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-29 20:21:23,531 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-29 20:21:23,531 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-29 20:21:23,532 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:23,532 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-29 20:21:23,533 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-29 20:21:23,533 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-29 20:21:23,533 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-29 20:21:23,533 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-29 20:21:23,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-29 20:21:23,582 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-29 20:21:23,586 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-29 20:21:23,589 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-29 20:21:23,589 INFO L276 PluginConnector]: CDTParser initialized [2018-03-29 20:21:23,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:23,937 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6d0d913e7 [2018-03-29 20:21:24,112 INFO L287 CDTParser]: IsIndexed: true [2018-03-29 20:21:24,112 INFO L288 CDTParser]: Found 1 translation units. [2018-03-29 20:21:24,113 INFO L168 CDTParser]: Scanning cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,125 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-29 20:21:24,125 INFO L215 ultiparseSymbolTable]: [2018-03-29 20:21:24,125 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-29 20:21:24,126 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,126 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,126 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,126 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,126 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-29 20:21:24,126 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,126 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_short in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,127 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,127 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__size_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,127 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,127 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____time_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,127 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,127 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,127 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,128 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,128 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,128 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,128 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,128 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,128 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,128 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,128 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,129 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,129 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,129 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,129 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,129 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,129 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____id_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,129 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,129 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__key_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_int in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__id_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__time_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__register_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ushort in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____key_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__uint in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____off_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_long in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ulong in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_long in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_char in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_short in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,139 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__div_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,139 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,139 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,139 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,139 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,139 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_char in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,139 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__off_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,139 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,140 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,140 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,140 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,140 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,140 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:24,158 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6d0d913e7 [2018-03-29 20:21:24,162 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-29 20:21:24,166 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-29 20:21:24,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-29 20:21:24,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-29 20:21:24,174 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-29 20:21:24,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 08:21:24" (1/1) ... [2018-03-29 20:21:24,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29912fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:21:24, skipping insertion in model container [2018-03-29 20:21:24,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 08:21:24" (1/1) ... [2018-03-29 20:21:24,193 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 20:21:24,222 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 20:21:24,394 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 20:21:24,446 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 20:21:24,453 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-03-29 20:21:24,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:21:24 WrapperNode [2018-03-29 20:21:24,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-29 20:21:24,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-29 20:21:24,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-29 20:21:24,496 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-29 20:21:24,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:21:24" (1/1) ... [2018-03-29 20:21:24,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:21:24" (1/1) ... [2018-03-29 20:21:24,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:21:24" (1/1) ... [2018-03-29 20:21:24,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:21:24" (1/1) ... [2018-03-29 20:21:24,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:21:24" (1/1) ... [2018-03-29 20:21:24,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:21:24" (1/1) ... [2018-03-29 20:21:24,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:21:24" (1/1) ... [2018-03-29 20:21:24,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-29 20:21:24,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-29 20:21:24,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-29 20:21:24,551 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-29 20:21:24,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:21:24" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-29 20:21:24,690 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-29 20:21:24,690 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-29 20:21:24,690 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-03-29 20:21:24,691 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-03-29 20:21:24,691 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-03-29 20:21:24,691 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-29 20:21:24,691 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-03-29 20:21:24,691 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-03-29 20:21:24,691 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-03-29 20:21:24,691 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-03-29 20:21:24,692 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-03-29 20:21:24,692 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-03-29 20:21:24,692 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-03-29 20:21:24,692 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-03-29 20:21:24,692 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-03-29 20:21:24,692 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-03-29 20:21:24,692 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-03-29 20:21:24,693 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-03-29 20:21:24,693 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-03-29 20:21:24,693 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-03-29 20:21:24,693 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-03-29 20:21:24,693 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-03-29 20:21:24,693 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-03-29 20:21:24,694 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-03-29 20:21:24,694 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-03-29 20:21:24,694 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-03-29 20:21:24,694 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-03-29 20:21:24,694 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-03-29 20:21:24,694 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-03-29 20:21:24,694 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-03-29 20:21:24,695 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-03-29 20:21:24,695 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-03-29 20:21:24,695 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-03-29 20:21:24,695 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-03-29 20:21:24,695 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-03-29 20:21:24,695 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-03-29 20:21:24,695 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-03-29 20:21:24,695 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-03-29 20:21:24,695 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-03-29 20:21:24,695 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-03-29 20:21:24,695 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-03-29 20:21:24,696 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-03-29 20:21:24,696 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-03-29 20:21:24,696 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-03-29 20:21:24,696 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-03-29 20:21:24,696 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-03-29 20:21:24,696 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-03-29 20:21:24,696 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-03-29 20:21:24,696 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-03-29 20:21:24,696 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-03-29 20:21:24,697 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-03-29 20:21:24,697 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-03-29 20:21:24,697 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-03-29 20:21:24,697 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-03-29 20:21:24,697 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-03-29 20:21:24,697 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-03-29 20:21:24,697 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-03-29 20:21:24,697 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-03-29 20:21:24,697 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-29 20:21:24,697 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-03-29 20:21:24,697 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-03-29 20:21:24,698 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-29 20:21:24,698 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-03-29 20:21:24,698 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-03-29 20:21:24,698 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-03-29 20:21:24,698 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-03-29 20:21:24,698 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-03-29 20:21:24,698 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-03-29 20:21:24,698 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-03-29 20:21:24,698 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-03-29 20:21:24,699 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-03-29 20:21:24,699 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-03-29 20:21:24,699 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-03-29 20:21:24,699 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-03-29 20:21:24,699 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-03-29 20:21:24,699 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-03-29 20:21:24,699 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-03-29 20:21:24,699 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-03-29 20:21:24,699 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-03-29 20:21:24,699 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-03-29 20:21:24,699 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-03-29 20:21:24,699 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-03-29 20:21:24,700 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-03-29 20:21:24,700 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-03-29 20:21:24,700 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-03-29 20:21:24,700 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-03-29 20:21:24,700 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-03-29 20:21:24,700 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-03-29 20:21:24,700 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-03-29 20:21:24,700 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-03-29 20:21:24,701 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-03-29 20:21:24,701 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-03-29 20:21:24,701 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-03-29 20:21:24,701 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-03-29 20:21:24,701 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-03-29 20:21:24,701 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-03-29 20:21:24,701 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-03-29 20:21:24,702 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-03-29 20:21:24,702 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-03-29 20:21:24,702 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-03-29 20:21:24,702 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-03-29 20:21:24,702 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-03-29 20:21:24,702 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-03-29 20:21:24,702 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-03-29 20:21:24,703 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-03-29 20:21:24,703 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-03-29 20:21:24,703 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-03-29 20:21:24,703 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-03-29 20:21:24,703 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-03-29 20:21:24,703 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-03-29 20:21:24,703 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-29 20:21:24,703 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-29 20:21:24,703 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-29 20:21:24,703 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-29 20:21:24,704 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-29 20:21:24,704 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-29 20:21:24,704 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-29 20:21:24,704 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-29 20:21:25,112 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-29 20:21:25,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 08:21:25 BoogieIcfgContainer [2018-03-29 20:21:25,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-29 20:21:25,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-29 20:21:25,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-29 20:21:25,118 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-29 20:21:25,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 08:21:24" (1/3) ... [2018-03-29 20:21:25,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b825a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 08:21:25, skipping insertion in model container [2018-03-29 20:21:25,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:21:24" (2/3) ... [2018-03-29 20:21:25,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b825a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 08:21:25, skipping insertion in model container [2018-03-29 20:21:25,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 08:21:25" (3/3) ... [2018-03-29 20:21:25,121 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:21:25,130 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-29 20:21:25,136 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-03-29 20:21:25,170 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-29 20:21:25,170 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-29 20:21:25,170 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-29 20:21:25,170 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-29 20:21:25,170 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-29 20:21:25,171 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-29 20:21:25,171 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-29 20:21:25,171 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-29 20:21:25,171 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-29 20:21:25,171 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-29 20:21:25,184 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-03-29 20:21:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-03-29 20:21:25,191 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:25,193 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:25,193 INFO L408 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:25,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1897600849, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:25,217 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:25,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:25,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:21:25,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:25,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:25,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 20:21:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:25,318 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:25,353 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:21:25,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-29 20:21:25,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-29 20:21:25,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-29 20:21:25,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-29 20:21:25,366 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 4 states. [2018-03-29 20:21:25,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:25,517 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-03-29 20:21:25,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-29 20:21:25,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-03-29 20:21:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:25,529 INFO L225 Difference]: With dead ends: 95 [2018-03-29 20:21:25,530 INFO L226 Difference]: Without dead ends: 77 [2018-03-29 20:21:25,533 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-03-29 20:21:25,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-03-29 20:21:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-03-29 20:21:25,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-03-29 20:21:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-03-29 20:21:25,567 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 19 [2018-03-29 20:21:25,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:25,568 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-03-29 20:21:25,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-29 20:21:25,568 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-03-29 20:21:25,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-03-29 20:21:25,569 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:25,569 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:25,569 INFO L408 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:25,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1897600848, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:25,576 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:25,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:25,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-29 20:21:25,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:25,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:25,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-03-29 20:21:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:25,637 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:25,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-29 20:21:25,691 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:21:25,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-03-29 20:21:25,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-29 20:21:25,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-29 20:21:25,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-03-29 20:21:25,693 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 7 states. [2018-03-29 20:21:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:25,807 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-03-29 20:21:25,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 20:21:25,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-03-29 20:21:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:25,809 INFO L225 Difference]: With dead ends: 77 [2018-03-29 20:21:25,809 INFO L226 Difference]: Without dead ends: 76 [2018-03-29 20:21:25,810 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-03-29 20:21:25,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-03-29 20:21:25,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-03-29 20:21:25,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-03-29 20:21:25,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-03-29 20:21:25,819 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 19 [2018-03-29 20:21:25,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:25,820 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-03-29 20:21:25,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-29 20:21:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-03-29 20:21:25,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-03-29 20:21:25,821 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:25,822 INFO L408 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:25,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1105859402, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:25,831 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:25,875 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:25,924 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:25,973 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:21:25,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-03-29 20:21:25,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-29 20:21:25,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-29 20:21:25,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-03-29 20:21:25,975 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 7 states. [2018-03-29 20:21:26,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:26,123 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-03-29 20:21:26,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-29 20:21:26,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-03-29 20:21:26,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:26,125 INFO L225 Difference]: With dead ends: 76 [2018-03-29 20:21:26,125 INFO L226 Difference]: Without dead ends: 75 [2018-03-29 20:21:26,126 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-03-29 20:21:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-03-29 20:21:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-03-29 20:21:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-03-29 20:21:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-03-29 20:21:26,134 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 37 [2018-03-29 20:21:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:26,135 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-03-29 20:21:26,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-29 20:21:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-03-29 20:21:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-03-29 20:21:26,137 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:26,137 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:26,137 INFO L408 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:26,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1105859403, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:26,144 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:26,168 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:26,285 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:26,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-03-29 20:21:26,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:26,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-03-29 20:21:26,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:26,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:21:26,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-03-29 20:21:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:26,349 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:21:26,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2018-03-29 20:21:26,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-03-29 20:21:26,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-03-29 20:21:26,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-03-29 20:21:26,351 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 10 states. [2018-03-29 20:21:26,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:26,557 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-03-29 20:21:26,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-03-29 20:21:26,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-03-29 20:21:26,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:26,561 INFO L225 Difference]: With dead ends: 89 [2018-03-29 20:21:26,561 INFO L226 Difference]: Without dead ends: 88 [2018-03-29 20:21:26,562 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-03-29 20:21:26,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-03-29 20:21:26,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2018-03-29 20:21:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-03-29 20:21:26,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-03-29 20:21:26,571 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 37 [2018-03-29 20:21:26,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:26,571 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-03-29 20:21:26,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-03-29 20:21:26,572 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-03-29 20:21:26,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-03-29 20:21:26,573 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:26,573 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:26,573 INFO L408 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:26,573 INFO L82 PathProgramCache]: Analyzing trace with hash -78096902, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:26,585 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:26,615 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:26,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-29 20:21:26,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:26,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:26,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 20:21:26,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 20:21:26,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:26,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:26,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-03-29 20:21:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:26,705 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:26,762 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:21:26,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2018-03-29 20:21:26,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:21:26,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:21:26,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-03-29 20:21:26,763 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 12 states. [2018-03-29 20:21:26,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:26,976 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-03-29 20:21:26,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:21:26,976 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-03-29 20:21:26,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:26,977 INFO L225 Difference]: With dead ends: 85 [2018-03-29 20:21:26,978 INFO L226 Difference]: Without dead ends: 84 [2018-03-29 20:21:26,978 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-03-29 20:21:26,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-03-29 20:21:26,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-03-29 20:21:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-03-29 20:21:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-03-29 20:21:26,984 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 38 [2018-03-29 20:21:26,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:26,985 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-03-29 20:21:26,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:21:26,985 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-03-29 20:21:26,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-03-29 20:21:26,986 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:26,987 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:26,987 INFO L408 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:26,987 INFO L82 PathProgramCache]: Analyzing trace with hash -78096901, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:26,994 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:27,017 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:27,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:21:27,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:27,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:21:27,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:27,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:27,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-03-29 20:21:27,066 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:27,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-29 20:21:27,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:27,079 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:27,080 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:27,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:21:27,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:27,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:27,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:21:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:27,146 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:27,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-03-29 20:21:27,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:27,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-03-29 20:21:27,331 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-29 20:21:27,331 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:27,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-03-29 20:21:27,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:27,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:27,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:27,338 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2018-03-29 20:21:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:27,366 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:21:27,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 17 [2018-03-29 20:21:27,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-03-29 20:21:27,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-03-29 20:21:27,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-03-29 20:21:27,368 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 18 states. [2018-03-29 20:21:27,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:27,751 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-03-29 20:21:27,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-29 20:21:27,751 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-03-29 20:21:27,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:27,752 INFO L225 Difference]: With dead ends: 92 [2018-03-29 20:21:27,752 INFO L226 Difference]: Without dead ends: 91 [2018-03-29 20:21:27,753 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2018-03-29 20:21:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-03-29 20:21:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-03-29 20:21:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-03-29 20:21:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-03-29 20:21:27,762 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 38 [2018-03-29 20:21:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:27,762 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-03-29 20:21:27,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-03-29 20:21:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-03-29 20:21:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-03-29 20:21:27,763 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:27,764 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:27,764 INFO L408 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:27,764 INFO L82 PathProgramCache]: Analyzing trace with hash -712713128, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:27,770 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:27,794 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:27,816 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:27,872 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:21:27,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2018-03-29 20:21:27,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 20:21:27,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 20:21:27,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-29 20:21:27,873 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 6 states. [2018-03-29 20:21:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:27,894 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-03-29 20:21:27,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 20:21:27,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-03-29 20:21:27,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:27,896 INFO L225 Difference]: With dead ends: 96 [2018-03-29 20:21:27,896 INFO L226 Difference]: Without dead ends: 85 [2018-03-29 20:21:27,896 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-03-29 20:21:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-03-29 20:21:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-03-29 20:21:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-03-29 20:21:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-03-29 20:21:27,901 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 39 [2018-03-29 20:21:27,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:27,902 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-03-29 20:21:27,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 20:21:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-03-29 20:21:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-03-29 20:21:27,903 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:27,903 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:27,903 INFO L408 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:27,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1036144935, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:27,909 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:27,932 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:27,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-03-29 20:21:27,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-29 20:21:27,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:27,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:27,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 20:21:27,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-03-29 20:21:28,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-03-29 20:21:28,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-03-29 20:21:28,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:21:28,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:21:28,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:21:28,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-03-29 20:21:28,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:28,224 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:28,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-03-29 20:21:28,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:28,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-03-29 20:21:28,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-03-29 20:21:28,601 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:28,609 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:28,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:28,632 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-03-29 20:21:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:28,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:21:28,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-03-29 20:21:28,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-03-29 20:21:28,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-03-29 20:21:28,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-03-29 20:21:28,671 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 21 states. [2018-03-29 20:21:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:29,406 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2018-03-29 20:21:29,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-03-29 20:21:29,406 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-03-29 20:21:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:29,407 INFO L225 Difference]: With dead ends: 113 [2018-03-29 20:21:29,407 INFO L226 Difference]: Without dead ends: 112 [2018-03-29 20:21:29,408 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2018-03-29 20:21:29,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-03-29 20:21:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 99. [2018-03-29 20:21:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-03-29 20:21:29,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-03-29 20:21:29,416 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 52 [2018-03-29 20:21:29,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:29,416 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-03-29 20:21:29,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-03-29 20:21:29,417 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-03-29 20:21:29,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-03-29 20:21:29,418 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:29,418 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:29,418 INFO L408 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:29,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2049691577, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:29,431 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:29,457 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:29,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:29,497 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:29,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-03-29 20:21:29,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:29,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:29,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-03-29 20:21:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:29,536 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:21:29,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-03-29 20:21:29,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 20:21:29,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 20:21:29,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-29 20:21:29,538 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 6 states. [2018-03-29 20:21:29,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:29,641 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-03-29 20:21:29,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-29 20:21:29,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-03-29 20:21:29,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:29,643 INFO L225 Difference]: With dead ends: 102 [2018-03-29 20:21:29,643 INFO L226 Difference]: Without dead ends: 101 [2018-03-29 20:21:29,643 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-03-29 20:21:29,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-03-29 20:21:29,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-03-29 20:21:29,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-03-29 20:21:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-03-29 20:21:29,651 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 52 [2018-03-29 20:21:29,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:29,651 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-03-29 20:21:29,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 20:21:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-03-29 20:21:29,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-03-29 20:21:29,652 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:29,653 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:29,653 INFO L408 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:29,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2049691576, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:29,660 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:29,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:29,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:21:29,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:29,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:21:29,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:29,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:29,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:21:29,721 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:29,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-29 20:21:29,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:29,731 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:29,732 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:29,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:21:29,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:29,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:29,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:21:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:29,973 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:30,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:30,475 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:21:30,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 38 [2018-03-29 20:21:30,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-03-29 20:21:30,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-03-29 20:21:30,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2018-03-29 20:21:30,476 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 39 states. [2018-03-29 20:21:32,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:32,694 INFO L93 Difference]: Finished difference Result 183 states and 196 transitions. [2018-03-29 20:21:32,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-03-29 20:21:32,694 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-03-29 20:21:32,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:32,695 INFO L225 Difference]: With dead ends: 183 [2018-03-29 20:21:32,695 INFO L226 Difference]: Without dead ends: 182 [2018-03-29 20:21:32,697 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=817, Invalid=6323, Unknown=0, NotChecked=0, Total=7140 [2018-03-29 20:21:32,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-03-29 20:21:32,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 113. [2018-03-29 20:21:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-03-29 20:21:32,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-03-29 20:21:32,705 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 52 [2018-03-29 20:21:32,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:32,705 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-03-29 20:21:32,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-03-29 20:21:32,705 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-03-29 20:21:32,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-03-29 20:21:32,706 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:32,706 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:32,706 INFO L408 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:32,707 INFO L82 PathProgramCache]: Analyzing trace with hash 2055721887, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:32,716 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:32,739 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:32,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:21:32,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:32,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:21:32,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:32,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:32,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:21:32,776 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:32,776 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:32,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:21:32,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:32,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-29 20:21:32,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:32,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:32,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:21:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:32,936 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:33,240 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:33,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:21:33,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2018-03-29 20:21:33,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-03-29 20:21:33,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-03-29 20:21:33,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2018-03-29 20:21:33,262 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 31 states. [2018-03-29 20:21:34,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:34,418 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2018-03-29 20:21:34,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-03-29 20:21:34,419 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2018-03-29 20:21:34,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:34,420 INFO L225 Difference]: With dead ends: 178 [2018-03-29 20:21:34,420 INFO L226 Difference]: Without dead ends: 177 [2018-03-29 20:21:34,421 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=422, Invalid=2770, Unknown=0, NotChecked=0, Total=3192 [2018-03-29 20:21:34,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-03-29 20:21:34,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 127. [2018-03-29 20:21:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-03-29 20:21:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2018-03-29 20:21:34,427 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 53 [2018-03-29 20:21:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:34,427 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2018-03-29 20:21:34,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-03-29 20:21:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2018-03-29 20:21:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-03-29 20:21:34,428 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:34,428 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:34,428 INFO L408 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:34,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1011159860, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:34,434 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:34,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:34,473 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:34,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-03-29 20:21:34,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-03-29 20:21:34,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:34,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:34,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-29 20:21:34,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:21:34,511 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-03-29 20:21:34,515 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-03-29 20:21:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-29 20:21:34,528 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:34,546 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_16| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_16|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_16| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_16| 0) |c_old(#valid)|))) is different from false [2018-03-29 20:21:34,550 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_15| Int) (|v_main_#t~malloc11.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_15| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_16|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_16| 1) |v_main_#t~malloc10.base_15| 0) |v_main_#t~malloc11.base_16| 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_15|) 0))))) is different from false [2018-03-29 20:21:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-29 20:21:34,582 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:21:34,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:21:34,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:21:34,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:21:34,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:21:34,583 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 12 states. [2018-03-29 20:21:34,592 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_15| Int) (|v_main_#t~malloc11.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_15| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_16|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_16| 1) |v_main_#t~malloc10.base_15| 0) |v_main_#t~malloc11.base_16| 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_15|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-03-29 20:21:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:34,911 INFO L93 Difference]: Finished difference Result 239 states and 258 transitions. [2018-03-29 20:21:34,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:21:34,911 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-03-29 20:21:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:34,914 INFO L225 Difference]: With dead ends: 239 [2018-03-29 20:21:34,914 INFO L226 Difference]: Without dead ends: 227 [2018-03-29 20:21:34,915 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-03-29 20:21:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-03-29 20:21:34,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2018-03-29 20:21:34,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-03-29 20:21:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 242 transitions. [2018-03-29 20:21:34,934 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 242 transitions. Word has length 54 [2018-03-29 20:21:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:34,935 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 242 transitions. [2018-03-29 20:21:34,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:21:34,935 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 242 transitions. [2018-03-29 20:21:34,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-03-29 20:21:34,936 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:34,936 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:34,936 INFO L408 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:34,937 INFO L82 PathProgramCache]: Analyzing trace with hash 415297934, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:34,943 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:34,964 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:34,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-29 20:21:34,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-29 20:21:34,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:34,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:34,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:34,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-03-29 20:21:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:35,043 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:35,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-03-29 20:21:35,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-03-29 20:21:35,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:35,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:35,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:35,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-03-29 20:21:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:35,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-29 20:21:35,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 15 [2018-03-29 20:21:35,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-03-29 20:21:35,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-03-29 20:21:35,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-03-29 20:21:35,206 INFO L87 Difference]: Start difference. First operand 224 states and 242 transitions. Second operand 15 states. [2018-03-29 20:21:35,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:35,510 INFO L93 Difference]: Finished difference Result 296 states and 317 transitions. [2018-03-29 20:21:35,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-03-29 20:21:35,510 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-03-29 20:21:35,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:35,513 INFO L225 Difference]: With dead ends: 296 [2018-03-29 20:21:35,513 INFO L226 Difference]: Without dead ends: 288 [2018-03-29 20:21:35,514 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2018-03-29 20:21:35,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-03-29 20:21:35,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 257. [2018-03-29 20:21:35,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-03-29 20:21:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 279 transitions. [2018-03-29 20:21:35,543 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 279 transitions. Word has length 55 [2018-03-29 20:21:35,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:35,544 INFO L459 AbstractCegarLoop]: Abstraction has 257 states and 279 transitions. [2018-03-29 20:21:35,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-03-29 20:21:35,544 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 279 transitions. [2018-03-29 20:21:35,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-03-29 20:21:35,546 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:35,547 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:35,547 INFO L408 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:35,547 INFO L82 PathProgramCache]: Analyzing trace with hash -609999223, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:35,556 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:35,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:35,599 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:35,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-03-29 20:21:35,603 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:35,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-03-29 20:21:35,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:35,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:35,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-29 20:21:35,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:21:35,648 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-03-29 20:21:35,652 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-03-29 20:21:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-29 20:21:35,663 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:35,682 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_20| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_20| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_20|))))) is different from false [2018-03-29 20:21:35,685 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_20| Int) (|v_main_#t~malloc10.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_19| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_20|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_20| 1) |v_main_#t~malloc10.base_19| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_19|)))))) is different from false [2018-03-29 20:21:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-29 20:21:35,739 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:21:35,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:21:35,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:21:35,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:21:35,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:21:35,740 INFO L87 Difference]: Start difference. First operand 257 states and 279 transitions. Second operand 12 states. [2018-03-29 20:21:35,748 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc11.base_20| Int) (|v_main_#t~malloc10.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_19| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_20|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_20| 1) |v_main_#t~malloc10.base_19| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_19|))))))) is different from false [2018-03-29 20:21:36,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:36,056 INFO L93 Difference]: Finished difference Result 388 states and 419 transitions. [2018-03-29 20:21:36,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:21:36,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-03-29 20:21:36,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:36,058 INFO L225 Difference]: With dead ends: 388 [2018-03-29 20:21:36,059 INFO L226 Difference]: Without dead ends: 368 [2018-03-29 20:21:36,059 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-03-29 20:21:36,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-03-29 20:21:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 176. [2018-03-29 20:21:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-03-29 20:21:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-03-29 20:21:36,075 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 55 [2018-03-29 20:21:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:36,075 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-03-29 20:21:36,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:21:36,076 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-03-29 20:21:36,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-03-29 20:21:36,077 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:36,077 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:36,077 INFO L408 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:36,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1776017105, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:36,083 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:36,101 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:36,122 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:36,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-03-29 20:21:36,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-03-29 20:21:36,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:36,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:36,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-29 20:21:36,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:21:36,171 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-03-29 20:21:36,176 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-03-29 20:21:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:36,190 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:36,220 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_22| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_22|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_22| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|))) is different from false [2018-03-29 20:21:36,225 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_21| Int) (|v_main_#t~malloc11.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_22| 1) |v_main_#t~malloc10.base_21| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_22|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_21|) 0))))) is different from false [2018-03-29 20:21:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:36,280 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:21:36,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:21:36,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:21:36,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:21:36,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:21:36,281 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 12 states. [2018-03-29 20:21:36,295 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_21| Int) (|v_main_#t~malloc11.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_22| 1) |v_main_#t~malloc10.base_21| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_22|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_21|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-03-29 20:21:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:37,014 INFO L93 Difference]: Finished difference Result 309 states and 325 transitions. [2018-03-29 20:21:37,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:21:37,014 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-03-29 20:21:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:37,016 INFO L225 Difference]: With dead ends: 309 [2018-03-29 20:21:37,016 INFO L226 Difference]: Without dead ends: 297 [2018-03-29 20:21:37,016 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-03-29 20:21:37,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-03-29 20:21:37,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 176. [2018-03-29 20:21:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-03-29 20:21:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-03-29 20:21:37,042 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 60 [2018-03-29 20:21:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:37,042 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-03-29 20:21:37,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:21:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-03-29 20:21:37,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-03-29 20:21:37,043 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:37,043 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:37,043 INFO L408 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:37,044 INFO L82 PathProgramCache]: Analyzing trace with hash -105397872, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:37,051 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:37,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:37,090 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:37,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-03-29 20:21:37,093 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:37,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-03-29 20:21:37,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:37,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:37,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-29 20:21:37,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:21:37,134 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-03-29 20:21:37,137 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-03-29 20:21:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:37,146 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:37,162 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_24| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_24| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_24|))))) is different from false [2018-03-29 20:21:37,165 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_24| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc11.base_24|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_24| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|)))) is different from false [2018-03-29 20:21:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:37,219 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:21:37,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:21:37,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:21:37,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:21:37,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:21:37,220 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 12 states. [2018-03-29 20:21:37,241 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_24| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc11.base_24|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_24| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|)))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-03-29 20:21:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:37,711 INFO L93 Difference]: Finished difference Result 250 states and 263 transitions. [2018-03-29 20:21:37,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:21:37,711 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-03-29 20:21:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:37,712 INFO L225 Difference]: With dead ends: 250 [2018-03-29 20:21:37,712 INFO L226 Difference]: Without dead ends: 238 [2018-03-29 20:21:37,713 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-03-29 20:21:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-03-29 20:21:37,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 115. [2018-03-29 20:21:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-03-29 20:21:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-03-29 20:21:37,723 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 61 [2018-03-29 20:21:37,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:37,723 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-03-29 20:21:37,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:21:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-03-29 20:21:37,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-03-29 20:21:37,724 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:37,724 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:37,724 INFO L408 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:37,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1803017946, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:37,735 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:37,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:37,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:21:37,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:37,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:21:37,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:37,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:37,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:21:37,784 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:37,784 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:37,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:21:37,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:37,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-29 20:21:37,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:37,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:37,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:21:38,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:38,135 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:38,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:21:38,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 48 [2018-03-29 20:21:38,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-03-29 20:21:38,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-03-29 20:21:38,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2200, Unknown=0, NotChecked=0, Total=2352 [2018-03-29 20:21:38,884 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 49 states. [2018-03-29 20:21:42,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:42,494 INFO L93 Difference]: Finished difference Result 178 states and 186 transitions. [2018-03-29 20:21:42,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-03-29 20:21:42,494 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 61 [2018-03-29 20:21:42,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:42,495 INFO L225 Difference]: With dead ends: 178 [2018-03-29 20:21:42,495 INFO L226 Difference]: Without dead ends: 177 [2018-03-29 20:21:42,498 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2327 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1219, Invalid=10553, Unknown=0, NotChecked=0, Total=11772 [2018-03-29 20:21:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-03-29 20:21:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 138. [2018-03-29 20:21:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-03-29 20:21:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 144 transitions. [2018-03-29 20:21:42,509 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 144 transitions. Word has length 61 [2018-03-29 20:21:42,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:42,509 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 144 transitions. [2018-03-29 20:21:42,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-03-29 20:21:42,509 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 144 transitions. [2018-03-29 20:21:42,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-03-29 20:21:42,509 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:42,510 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:42,510 INFO L408 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:42,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1306320949, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:42,516 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:42,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:42,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:21:42,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:42,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:42,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 20:21:42,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:21:42,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:42,553 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:42,553 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:42,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:21:42,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:42,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:42,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-03-29 20:21:42,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-03-29 20:21:42,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 20:21:42,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:42,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:42,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:42,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-03-29 20:21:42,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-03-29 20:21:42,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-29 20:21:42,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:42,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:42,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:42,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-03-29 20:21:42,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-03-29 20:21:42,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-03-29 20:21:42,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:21:42,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:21:42,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:21:42,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-03-29 20:21:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:42,835 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:43,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-03-29 20:21:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 20:21:43,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:43,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-03-29 20:21:43,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-03-29 20:21:43,559 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:43,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:43,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-03-29 20:21:43,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-03-29 20:21:43,567 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:43,568 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:43,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:21:43,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:21:43,596 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-03-29 20:21:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:43,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:21:43,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-03-29 20:21:43,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-03-29 20:21:43,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-03-29 20:21:43,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-03-29 20:21:43,785 INFO L87 Difference]: Start difference. First operand 138 states and 144 transitions. Second operand 42 states. [2018-03-29 20:21:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:45,226 INFO L93 Difference]: Finished difference Result 171 states and 177 transitions. [2018-03-29 20:21:45,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-03-29 20:21:45,226 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 67 [2018-03-29 20:21:45,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:45,227 INFO L225 Difference]: With dead ends: 171 [2018-03-29 20:21:45,227 INFO L226 Difference]: Without dead ends: 170 [2018-03-29 20:21:45,228 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=416, Invalid=4006, Unknown=0, NotChecked=0, Total=4422 [2018-03-29 20:21:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-03-29 20:21:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 138. [2018-03-29 20:21:45,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-03-29 20:21:45,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2018-03-29 20:21:45,244 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 67 [2018-03-29 20:21:45,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:45,244 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2018-03-29 20:21:45,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-03-29 20:21:45,244 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2018-03-29 20:21:45,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-03-29 20:21:45,245 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:45,245 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:45,246 INFO L408 AbstractCegarLoop]: === Iteration 19 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:45,246 INFO L82 PathProgramCache]: Analyzing trace with hash 239796070, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:45,253 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:45,276 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:45,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:21:45,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:45,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:21:45,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:45,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:45,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:21:45,298 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:45,299 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:45,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:21:45,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:45,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-29 20:21:45,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:45,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:45,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:21:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:45,977 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:47,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:21:47,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 68 [2018-03-29 20:21:47,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-03-29 20:21:47,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-03-29 20:21:47,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=4410, Unknown=0, NotChecked=0, Total=4692 [2018-03-29 20:21:47,440 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand 69 states. [2018-03-29 20:21:55,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:21:55,534 INFO L93 Difference]: Finished difference Result 233 states and 242 transitions. [2018-03-29 20:21:55,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-03-29 20:21:55,571 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 79 [2018-03-29 20:21:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:21:55,572 INFO L225 Difference]: With dead ends: 233 [2018-03-29 20:21:55,572 INFO L226 Difference]: Without dead ends: 232 [2018-03-29 20:21:55,576 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6957 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=2849, Invalid=26907, Unknown=0, NotChecked=0, Total=29756 [2018-03-29 20:21:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-03-29 20:21:55,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 200. [2018-03-29 20:21:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-03-29 20:21:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 206 transitions. [2018-03-29 20:21:55,595 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 206 transitions. Word has length 79 [2018-03-29 20:21:55,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:21:55,595 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 206 transitions. [2018-03-29 20:21:55,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-03-29 20:21:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 206 transitions. [2018-03-29 20:21:55,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-03-29 20:21:55,596 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:21:55,596 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:21:55,596 INFO L408 AbstractCegarLoop]: === Iteration 20 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:21:55,596 INFO L82 PathProgramCache]: Analyzing trace with hash -742476633, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:21:55,609 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:21:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:21:55,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:21:55,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:21:55,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:55,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:55,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 20:21:55,653 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:55,654 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:21:55,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:21:55,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:55,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:21:55,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:55,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:55,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-03-29 20:21:55,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-03-29 20:21:55,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 20:21:55,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:55,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:55,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:55,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-03-29 20:21:55,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-03-29 20:21:55,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 8 treesize of output 7 [2018-03-29 20:21:55,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:55,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:55,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:55,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-03-29 20:21:55,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-03-29 20:21:55,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-29 20:21:55,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:55,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:55,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:55,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-03-29 20:21:56,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-03-29 20:21:56,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-03-29 20:21:56,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:21:56,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:21:56,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:21:56,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-03-29 20:21:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 7 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:56,167 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:21:57,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-03-29 20:21:57,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 20:21:57,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:57,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-03-29 20:21:57,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 34 [2018-03-29 20:21:57,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2018-03-29 20:21:57,415 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-03-29 20:21:57,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-03-29 20:21:57,417 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:57,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2018-03-29 20:21:57,423 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-03-29 20:21:57,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2018-03-29 20:21:57,463 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-03-29 20:21:57,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2018-03-29 20:21:57,469 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-03-29 20:21:57,493 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:21:57,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:21:57,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2018-03-29 20:21:57,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-03-29 20:21:57,521 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:57,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 60 [2018-03-29 20:21:57,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-03-29 20:21:57,612 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-03-29 20:21:57,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2018-03-29 20:21:57,623 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-03-29 20:21:57,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2018-03-29 20:21:57,685 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-03-29 20:21:57,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2018-03-29 20:21:57,728 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-03-29 20:21:57,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-03-29 20:21:57,733 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-03-29 20:21:57,756 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-03-29 20:21:57,783 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-03-29 20:21:57,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-03-29 20:21:57,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-03-29 20:21:57,786 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-03-29 20:21:57,789 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:21:57,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-03-29 20:21:57,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:21:57,841 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 6 variables, input treesize:60, output treesize:84 [2018-03-29 20:21:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:21:58,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:21:58,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-03-29 20:21:58,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-03-29 20:21:58,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-03-29 20:21:58,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2474, Unknown=0, NotChecked=0, Total=2652 [2018-03-29 20:21:58,048 INFO L87 Difference]: Start difference. First operand 200 states and 206 transitions. Second operand 52 states. [2018-03-29 20:22:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:22:01,043 INFO L93 Difference]: Finished difference Result 224 states and 231 transitions. [2018-03-29 20:22:01,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-03-29 20:22:01,082 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 82 [2018-03-29 20:22:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:22:01,083 INFO L225 Difference]: With dead ends: 224 [2018-03-29 20:22:01,083 INFO L226 Difference]: Without dead ends: 223 [2018-03-29 20:22:01,084 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1717 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1417, Invalid=7703, Unknown=0, NotChecked=0, Total=9120 [2018-03-29 20:22:01,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-03-29 20:22:01,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 199. [2018-03-29 20:22:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-03-29 20:22:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 205 transitions. [2018-03-29 20:22:01,116 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 205 transitions. Word has length 82 [2018-03-29 20:22:01,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:22:01,116 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 205 transitions. [2018-03-29 20:22:01,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-03-29 20:22:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 205 transitions. [2018-03-29 20:22:01,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-03-29 20:22:01,117 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:22:01,118 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:22:01,118 INFO L408 AbstractCegarLoop]: === Iteration 21 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:22:01,118 INFO L82 PathProgramCache]: Analyzing trace with hash 466654152, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:22:01,126 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:22:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:22:01,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:22:01,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:22:01,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:01,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:22:01,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:01,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:22:01,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:22:01,194 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:22:01,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-29 20:22:01,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:01,204 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:22:01,205 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:22:01,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:22:01,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:01,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:22:01,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:22:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:22:01,582 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:22:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:22:02,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:22:02,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 54 [2018-03-29 20:22:02,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-03-29 20:22:02,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-03-29 20:22:02,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2781, Unknown=0, NotChecked=0, Total=2970 [2018-03-29 20:22:02,417 INFO L87 Difference]: Start difference. First operand 199 states and 205 transitions. Second operand 55 states. [2018-03-29 20:22:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:22:08,262 INFO L93 Difference]: Finished difference Result 379 states and 393 transitions. [2018-03-29 20:22:08,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-03-29 20:22:08,262 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 82 [2018-03-29 20:22:08,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:22:08,264 INFO L225 Difference]: With dead ends: 379 [2018-03-29 20:22:08,264 INFO L226 Difference]: Without dead ends: 378 [2018-03-29 20:22:08,265 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4860 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2029, Invalid=18851, Unknown=0, NotChecked=0, Total=20880 [2018-03-29 20:22:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-03-29 20:22:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 250. [2018-03-29 20:22:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-03-29 20:22:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 263 transitions. [2018-03-29 20:22:08,287 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 263 transitions. Word has length 82 [2018-03-29 20:22:08,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:22:08,287 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 263 transitions. [2018-03-29 20:22:08,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-03-29 20:22:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 263 transitions. [2018-03-29 20:22:08,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-03-29 20:22:08,288 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:22:08,288 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:22:08,288 INFO L408 AbstractCegarLoop]: === Iteration 22 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:22:08,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1541939169, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:22:08,295 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:22:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:22:08,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:22:08,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 6 treesize of output 5 [2018-03-29 20:22:08,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:08,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:22:08,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:08,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:22:08,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:22:08,474 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:22:08,474 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:22:08,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:22:08,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:08,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-29 20:22:08,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:08,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:22:08,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:22:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:22:08,808 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:22:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:22:09,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:22:09,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 46 [2018-03-29 20:22:09,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-03-29 20:22:09,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-03-29 20:22:09,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1999, Unknown=0, NotChecked=0, Total=2162 [2018-03-29 20:22:09,428 INFO L87 Difference]: Start difference. First operand 250 states and 263 transitions. Second operand 47 states. [2018-03-29 20:22:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:22:12,386 INFO L93 Difference]: Finished difference Result 383 states and 396 transitions. [2018-03-29 20:22:12,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-03-29 20:22:12,387 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 83 [2018-03-29 20:22:12,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:22:12,388 INFO L225 Difference]: With dead ends: 383 [2018-03-29 20:22:12,388 INFO L226 Difference]: Without dead ends: 382 [2018-03-29 20:22:12,389 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1182, Invalid=8520, Unknown=0, NotChecked=0, Total=9702 [2018-03-29 20:22:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-03-29 20:22:12,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 264. [2018-03-29 20:22:12,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-03-29 20:22:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 274 transitions. [2018-03-29 20:22:12,420 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 274 transitions. Word has length 83 [2018-03-29 20:22:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:22:12,420 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 274 transitions. [2018-03-29 20:22:12,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-03-29 20:22:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 274 transitions. [2018-03-29 20:22:12,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-03-29 20:22:12,421 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:22:12,421 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:22:12,421 INFO L408 AbstractCegarLoop]: === Iteration 23 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:22:12,421 INFO L82 PathProgramCache]: Analyzing trace with hash 153237420, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:22:12,427 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:22:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:22:12,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:22:12,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:22:12,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:12,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:22:12,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:12,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:22:12,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:22:12,475 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:22:12,476 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:22:12,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:22:12,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:12,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-29 20:22:12,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:12,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:22:12,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:22:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:22:13,097 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:22:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:22:14,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:22:14,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 66 [2018-03-29 20:22:14,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-03-29 20:22:14,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-03-29 20:22:14,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4176, Unknown=0, NotChecked=0, Total=4422 [2018-03-29 20:22:14,402 INFO L87 Difference]: Start difference. First operand 264 states and 274 transitions. Second operand 67 states. [2018-03-29 20:22:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:22:23,655 INFO L93 Difference]: Finished difference Result 397 states and 409 transitions. [2018-03-29 20:22:23,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-03-29 20:22:23,655 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 85 [2018-03-29 20:22:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:22:23,657 INFO L225 Difference]: With dead ends: 397 [2018-03-29 20:22:23,657 INFO L226 Difference]: Without dead ends: 396 [2018-03-29 20:22:23,658 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8659 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=2937, Invalid=31473, Unknown=0, NotChecked=0, Total=34410 [2018-03-29 20:22:23,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-03-29 20:22:23,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 260. [2018-03-29 20:22:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-03-29 20:22:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 270 transitions. [2018-03-29 20:22:23,692 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 270 transitions. Word has length 85 [2018-03-29 20:22:23,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:22:23,693 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 270 transitions. [2018-03-29 20:22:23,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-03-29 20:22:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 270 transitions. [2018-03-29 20:22:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-03-29 20:22:23,693 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:22:23,693 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:22:23,694 INFO L408 AbstractCegarLoop]: === Iteration 24 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:22:23,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2054967898, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:22:23,703 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:22:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:22:23,729 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:22:23,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:22:23,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:23,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:22:23,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:23,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:22:23,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:22:23,753 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:22:23,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-29 20:22:23,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:23,761 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:22:23,762 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:22:23,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:22:23,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:23,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:22:23,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:22:24,501 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:22:24,501 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:22:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:22:25,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:22:25,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 32] total 69 [2018-03-29 20:22:25,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-03-29 20:22:25,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-03-29 20:22:25,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4581, Unknown=0, NotChecked=0, Total=4830 [2018-03-29 20:22:25,852 INFO L87 Difference]: Start difference. First operand 260 states and 270 transitions. Second operand 70 states. [2018-03-29 20:22:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:22:39,170 INFO L93 Difference]: Finished difference Result 446 states and 458 transitions. [2018-03-29 20:22:39,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-03-29 20:22:39,170 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 91 [2018-03-29 20:22:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:22:39,172 INFO L225 Difference]: With dead ends: 446 [2018-03-29 20:22:39,172 INFO L226 Difference]: Without dead ends: 445 [2018-03-29 20:22:39,173 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11508 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=3701, Invalid=41031, Unknown=0, NotChecked=0, Total=44732 [2018-03-29 20:22:39,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-03-29 20:22:39,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 243. [2018-03-29 20:22:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-03-29 20:22:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 252 transitions. [2018-03-29 20:22:39,195 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 252 transitions. Word has length 91 [2018-03-29 20:22:39,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:22:39,196 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 252 transitions. [2018-03-29 20:22:39,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-03-29 20:22:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 252 transitions. [2018-03-29 20:22:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-03-29 20:22:39,196 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:22:39,196 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:22:39,196 INFO L408 AbstractCegarLoop]: === Iteration 25 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:22:39,197 INFO L82 PathProgramCache]: Analyzing trace with hash -651400218, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:22:39,202 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:22:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:22:39,234 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:22:39,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:22:39,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:39,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:22:39,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:39,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:22:39,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:22:39,256 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:22:39,256 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:22:39,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:22:39,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:39,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-29 20:22:39,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:22:39,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:22:39,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:22:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:22:40,191 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:22:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:22:42,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:22:42,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42] total 84 [2018-03-29 20:22:42,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-03-29 20:22:42,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-03-29 20:22:42,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=6783, Unknown=0, NotChecked=0, Total=7140 [2018-03-29 20:22:42,313 INFO L87 Difference]: Start difference. First operand 243 states and 252 transitions. Second operand 85 states. [2018-03-29 20:22:47,794 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 61 DAG size of output 59 [2018-03-29 20:22:48,478 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 69 DAG size of output 60 [2018-03-29 20:23:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:23:07,390 INFO L93 Difference]: Finished difference Result 529 states and 544 transitions. [2018-03-29 20:23:07,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2018-03-29 20:23:07,390 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 109 [2018-03-29 20:23:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:23:07,392 INFO L225 Difference]: With dead ends: 529 [2018-03-29 20:23:07,392 INFO L226 Difference]: Without dead ends: 528 [2018-03-29 20:23:07,395 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29250 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=6686, Invalid=89104, Unknown=0, NotChecked=0, Total=95790 [2018-03-29 20:23:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-03-29 20:23:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 269. [2018-03-29 20:23:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-03-29 20:23:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 279 transitions. [2018-03-29 20:23:07,428 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 279 transitions. Word has length 109 [2018-03-29 20:23:07,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:23:07,429 INFO L459 AbstractCegarLoop]: Abstraction has 269 states and 279 transitions. [2018-03-29 20:23:07,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-03-29 20:23:07,429 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 279 transitions. [2018-03-29 20:23:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-03-29 20:23:07,429 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:23:07,429 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:23:07,430 INFO L408 AbstractCegarLoop]: === Iteration 26 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:23:07,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1290307198, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:23:07,441 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:23:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:23:07,473 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:23:07,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:23:07,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:23:07,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:23:07,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:23:07,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:23:07,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:23:07,492 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:23:07,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-29 20:23:07,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:23:07,500 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:23:07,500 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:23:07,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:23:07,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:23:07,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:23:07,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:23:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:23:08,844 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:23:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:23:11,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:23:11,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48] total 96 [2018-03-29 20:23:11,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-03-29 20:23:11,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-03-29 20:23:11,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=8799, Unknown=0, NotChecked=0, Total=9312 [2018-03-29 20:23:11,856 INFO L87 Difference]: Start difference. First operand 269 states and 279 transitions. Second operand 97 states. [2018-03-29 20:23:14,606 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 58 DAG size of output 56 [2018-03-29 20:23:15,105 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 61 DAG size of output 56 [2018-03-29 20:23:15,379 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 58 DAG size of output 56 [2018-03-29 20:23:17,366 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 69 DAG size of output 67 [2018-03-29 20:23:17,659 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 68 DAG size of output 66 [2018-03-29 20:23:18,032 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 68 DAG size of output 66 [2018-03-29 20:23:18,605 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 69 DAG size of output 67 [2018-03-29 20:23:18,898 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 68 DAG size of output 66 [2018-03-29 20:23:19,212 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 71 DAG size of output 66 [2018-03-29 20:23:27,195 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 89 DAG size of output 78 [2018-03-29 20:23:27,577 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 90 DAG size of output 79 [2018-03-29 20:23:28,496 WARN L151 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 102 DAG size of output 80 [2018-03-29 20:23:28,863 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 98 DAG size of output 79 [2018-03-29 20:23:31,122 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 70 DAG size of output 68 [2018-03-29 20:23:31,994 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 86 DAG size of output 70 [2018-03-29 20:23:32,306 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 83 DAG size of output 69 [2018-03-29 20:23:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:23:38,087 INFO L93 Difference]: Finished difference Result 540 states and 556 transitions. [2018-03-29 20:23:38,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-03-29 20:23:38,087 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 112 [2018-03-29 20:23:38,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:23:38,089 INFO L225 Difference]: With dead ends: 540 [2018-03-29 20:23:38,089 INFO L226 Difference]: Without dead ends: 539 [2018-03-29 20:23:38,094 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26510 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=7398, Invalid=85932, Unknown=0, NotChecked=0, Total=93330 [2018-03-29 20:23:38,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-03-29 20:23:38,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 323. [2018-03-29 20:23:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-03-29 20:23:38,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 333 transitions. [2018-03-29 20:23:38,153 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 333 transitions. Word has length 112 [2018-03-29 20:23:38,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:23:38,153 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 333 transitions. [2018-03-29 20:23:38,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-03-29 20:23:38,153 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 333 transitions. [2018-03-29 20:23:38,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-03-29 20:23:38,154 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:23:38,154 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 20:23:38,154 INFO L408 AbstractCegarLoop]: === Iteration 27 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-29 20:23:38,154 INFO L82 PathProgramCache]: Analyzing trace with hash 990612454, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:23:38,164 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:23:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:23:38,207 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:23:38,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:23:38,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:23:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:23:38,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:23:38,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:23:38,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:23:38,234 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:23:38,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-29 20:23:38,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:23:38,242 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:23:38,243 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:23:38,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:23:38,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:23:38,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:23:38,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:23:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:23:40,141 INFO L314 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-03-29 20:23:43,425 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-03-29 20:23:43,426 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-29 20:23:43,430 WARN L197 ceAbstractionStarter]: Timeout [2018-03-29 20:23:43,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 08:23:43 BoogieIcfgContainer [2018-03-29 20:23:43,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-29 20:23:43,431 INFO L168 Benchmark]: Toolchain (without parser) took 139268.33 ms. Allocated memory was 307.2 MB in the beginning and 632.3 MB in the end (delta: 325.1 MB). Free memory was 244.9 MB in the beginning and 365.0 MB in the end (delta: -120.1 MB). Peak memory consumption was 204.9 MB. Max. memory is 5.3 GB. [2018-03-29 20:23:43,433 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 307.2 MB. Free memory is still 269.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-29 20:23:43,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.16 ms. Allocated memory is still 307.2 MB. Free memory was 244.9 MB in the beginning and 220.7 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 5.3 GB. [2018-03-29 20:23:43,433 INFO L168 Benchmark]: Boogie Preprocessor took 55.34 ms. Allocated memory is still 307.2 MB. Free memory was 220.7 MB in the beginning and 217.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-03-29 20:23:43,433 INFO L168 Benchmark]: RCFGBuilder took 562.10 ms. Allocated memory was 307.2 MB in the beginning and 470.3 MB in the end (delta: 163.1 MB). Free memory was 217.7 MB in the beginning and 405.0 MB in the end (delta: -187.3 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-03-29 20:23:43,434 INFO L168 Benchmark]: TraceAbstraction took 138316.30 ms. Allocated memory was 470.3 MB in the beginning and 632.3 MB in the end (delta: 162.0 MB). Free memory was 405.0 MB in the beginning and 365.0 MB in the end (delta: 40.0 MB). Peak memory consumption was 202.0 MB. Max. memory is 5.3 GB. [2018-03-29 20:23:43,436 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 307.2 MB. Free memory is still 269.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 328.16 ms. Allocated memory is still 307.2 MB. Free memory was 244.9 MB in the beginning and 220.7 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 55.34 ms. Allocated memory is still 307.2 MB. Free memory was 220.7 MB in the beginning and 217.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 562.10 ms. Allocated memory was 307.2 MB in the beginning and 470.3 MB in the end (delta: 163.1 MB). Free memory was 217.7 MB in the beginning and 405.0 MB in the end (delta: -187.3 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 138316.30 ms. Allocated memory was 470.3 MB in the beginning and 632.3 MB in the end (delta: 162.0 MB). Free memory was 405.0 MB in the beginning and 365.0 MB in the end (delta: 40.0 MB). Peak memory consumption was 202.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 102 known predicates. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 102 known predicates. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 102 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 102 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 102 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 102 known predicates. - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 102 known predicates. - TimeoutResultAtElement [Line: 558]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 558). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 102 known predicates. - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 102 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 91 locations, 9 error locations. TIMEOUT Result, 138.2s OverallTime, 27 OverallIterations, 8 TraceHistogramMax, 106.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1946 SDtfs, 12432 SDslu, 30741 SDs, 0 SdLazy, 29117 SolverSat, 2291 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4347 GetRequests, 2305 SyntacticMatches, 17 SemanticMatches, 2025 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 96450 ImplicationChecksByTransitivity, 110.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 1800 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 1572 NumberOfCodeBlocks, 1572 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3092 ConstructedInterpolants, 303 QuantifiedInterpolants, 3093513 SizeOfPredicates, 582 NumberOfNonLiveVariables, 4604 ConjunctsInSsa, 1106 ConjunctsInUnsatCore, 52 InterpolantComputations, 27 PerfectInterpolantSequences, 17/1258 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-29_20-23-43-442.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-29_20-23-43-442.csv Completed graceful shutdown