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-35b68b2 [2018-04-06 19:11:08,808 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-06 19:11:08,809 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-06 19:11:08,823 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-06 19:11:08,823 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-06 19:11:08,824 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-06 19:11:08,825 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-06 19:11:08,827 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-06 19:11:08,829 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-06 19:11:08,830 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-06 19:11:08,831 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-06 19:11:08,831 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-06 19:11:08,832 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-06 19:11:08,834 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-06 19:11:08,835 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-06 19:11:08,837 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-06 19:11:08,839 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-06 19:11:08,841 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-06 19:11:08,842 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-06 19:11:08,843 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-06 19:11:08,845 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-06 19:11:08,846 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-06 19:11:08,846 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-06 19:11:08,847 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-06 19:11:08,848 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-06 19:11:08,849 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-06 19:11:08,849 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-06 19:11:08,850 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-06 19:11:08,851 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-06 19:11:08,851 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-06 19:11:08,852 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-06 19:11:08,852 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-06 19:11:08,877 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-06 19:11:08,877 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-06 19:11:08,877 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-06 19:11:08,877 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-06 19:11:08,878 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-06 19:11:08,878 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-06 19:11:08,879 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-06 19:11:08,879 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-06 19:11:08,879 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-06 19:11:08,879 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-06 19:11:08,879 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-06 19:11:08,880 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-06 19:11:08,880 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-06 19:11:08,880 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-06 19:11:08,880 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-06 19:11:08,880 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-06 19:11:08,881 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-06 19:11:08,881 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-06 19:11:08,881 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-06 19:11:08,881 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-06 19:11:08,881 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-06 19:11:08,881 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-06 19:11:08,882 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-06 19:11:08,882 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-06 19:11:08,882 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-06 19:11:08,882 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-06 19:11:08,882 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 19:11:08,883 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-06 19:11:08,883 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-06 19:11:08,883 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-06 19:11:08,883 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-06 19:11:08,883 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-06 19:11:08,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:08,884 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-06 19:11:08,884 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-06 19:11:08,885 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-06 19:11:08,885 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-06 19:11:08,885 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-06 19:11:08,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-06 19:11:08,931 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-06 19:11:08,935 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-06 19:11:08,937 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-06 19:11:08,937 INFO L276 PluginConnector]: CDTParser initialized [2018-04-06 19:11:08,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,248 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG583152ee7 [2018-04-06 19:11:09,429 INFO L287 CDTParser]: IsIndexed: true [2018-04-06 19:11:09,429 INFO L288 CDTParser]: Found 1 translation units. [2018-04-06 19:11:09,429 INFO L168 CDTParser]: Scanning cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,440 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-06 19:11:09,440 INFO L215 ultiparseSymbolTable]: [2018-04-06 19:11:09,441 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-06 19:11:09,441 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,441 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,441 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,441 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,441 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-06 19:11:09,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_short in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__size_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____time_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____id_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__key_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_int in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__id_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__time_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__register_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,447 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,447 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,447 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,447 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,447 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,447 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,447 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,447 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ushort in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____key_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,448 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,449 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__uint in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____off_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_long in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,450 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ulong in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_long in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,451 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_char in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_short in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__div_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,452 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_char in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__off_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,454 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,454 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:09,471 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG583152ee7 [2018-04-06 19:11:09,475 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-06 19:11:09,476 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-06 19:11:09,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-06 19:11:09,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-06 19:11:09,483 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-06 19:11:09,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 07:11:09" (1/1) ... [2018-04-06 19:11:09,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@225fa7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:11:09, skipping insertion in model container [2018-04-06 19:11:09,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 07:11:09" (1/1) ... [2018-04-06 19:11:09,500 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 19:11:09,530 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 19:11:09,722 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 19:11:09,770 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 19:11:09,778 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-06 19:11:09,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:11:09 WrapperNode [2018-04-06 19:11:09,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-06 19:11:09,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-06 19:11:09,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-06 19:11:09,827 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-06 19:11:09,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:11:09" (1/1) ... [2018-04-06 19:11:09,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:11:09" (1/1) ... [2018-04-06 19:11:09,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:11:09" (1/1) ... [2018-04-06 19:11:09,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:11:09" (1/1) ... [2018-04-06 19:11:09,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:11:09" (1/1) ... [2018-04-06 19:11:09,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:11:09" (1/1) ... [2018-04-06 19:11:09,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:11:09" (1/1) ... [2018-04-06 19:11:09,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-06 19:11:09,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-06 19:11:09,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-06 19:11:09,881 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-06 19:11:09,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:11:09" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 19:11:10,014 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-06 19:11:10,015 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-06 19:11:10,015 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-06 19:11:10,015 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-06 19:11:10,015 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-04-06 19:11:10,015 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-06 19:11:10,015 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-06 19:11:10,015 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-06 19:11:10,015 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-06 19:11:10,015 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-06 19:11:10,016 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-06 19:11:10,016 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-06 19:11:10,016 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-06 19:11:10,016 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-06 19:11:10,016 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-06 19:11:10,016 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-06 19:11:10,016 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-06 19:11:10,016 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-06 19:11:10,016 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-06 19:11:10,017 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-06 19:11:10,017 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-06 19:11:10,017 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-06 19:11:10,017 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-06 19:11:10,017 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-06 19:11:10,017 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-06 19:11:10,017 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-06 19:11:10,017 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-06 19:11:10,017 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-06 19:11:10,017 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-06 19:11:10,018 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-06 19:11:10,018 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-06 19:11:10,018 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-06 19:11:10,018 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-06 19:11:10,018 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-06 19:11:10,018 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-06 19:11:10,018 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-06 19:11:10,018 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-06 19:11:10,019 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-06 19:11:10,019 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-06 19:11:10,019 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-06 19:11:10,019 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-06 19:11:10,019 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-06 19:11:10,019 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-06 19:11:10,019 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-06 19:11:10,020 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-06 19:11:10,020 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-06 19:11:10,020 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-06 19:11:10,020 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-06 19:11:10,020 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-06 19:11:10,020 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-06 19:11:10,020 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-06 19:11:10,020 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-06 19:11:10,021 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-06 19:11:10,021 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-06 19:11:10,021 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-06 19:11:10,021 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-06 19:11:10,021 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-06 19:11:10,021 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-06 19:11:10,021 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-06 19:11:10,022 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-06 19:11:10,022 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-06 19:11:10,022 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-06 19:11:10,022 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-06 19:11:10,022 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-06 19:11:10,022 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-06 19:11:10,022 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-06 19:11:10,022 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-06 19:11:10,023 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-06 19:11:10,023 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-06 19:11:10,023 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-06 19:11:10,023 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-06 19:11:10,023 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-06 19:11:10,023 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-06 19:11:10,023 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-06 19:11:10,024 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-06 19:11:10,024 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-06 19:11:10,024 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-06 19:11:10,024 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-06 19:11:10,024 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-06 19:11:10,024 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-06 19:11:10,024 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-06 19:11:10,024 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-06 19:11:10,025 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-06 19:11:10,025 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-06 19:11:10,025 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-06 19:11:10,025 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-06 19:11:10,025 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-06 19:11:10,025 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-06 19:11:10,026 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-06 19:11:10,026 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-06 19:11:10,026 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-06 19:11:10,026 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-06 19:11:10,026 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-06 19:11:10,026 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-06 19:11:10,026 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-06 19:11:10,026 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-06 19:11:10,027 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-06 19:11:10,027 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-06 19:11:10,027 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-06 19:11:10,027 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-06 19:11:10,027 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-06 19:11:10,027 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-06 19:11:10,027 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-06 19:11:10,027 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-06 19:11:10,028 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-06 19:11:10,028 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-06 19:11:10,028 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-06 19:11:10,028 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-06 19:11:10,028 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-06 19:11:10,028 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-04-06 19:11:10,028 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-06 19:11:10,028 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-06 19:11:10,029 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-06 19:11:10,029 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-06 19:11:10,029 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-06 19:11:10,029 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-06 19:11:10,029 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-06 19:11:10,029 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-06 19:11:10,479 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-06 19:11:10,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 07:11:10 BoogieIcfgContainer [2018-04-06 19:11:10,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-06 19:11:10,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-06 19:11:10,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-06 19:11:10,484 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-06 19:11:10,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 07:11:09" (1/3) ... [2018-04-06 19:11:10,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e73f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 07:11:10, skipping insertion in model container [2018-04-06 19:11:10,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:11:09" (2/3) ... [2018-04-06 19:11:10,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e73f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 07:11:10, skipping insertion in model container [2018-04-06 19:11:10,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 07:11:10" (3/3) ... [2018-04-06 19:11:10,487 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:11:10,495 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-06 19:11:10,502 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-04-06 19:11:10,547 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-06 19:11:10,547 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-06 19:11:10,547 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-06 19:11:10,547 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-06 19:11:10,547 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-06 19:11:10,547 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-06 19:11:10,547 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-06 19:11:10,548 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-06 19:11:10,548 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-06 19:11:10,548 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-06 19:11:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-04-06 19:11:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-06 19:11:10,565 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:10,566 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:10,566 INFO L408 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:10,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1897600849, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:10,581 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:10,617 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:10,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:10,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:10,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:10,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 19:11:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:10,685 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:10,716 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:11:10,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 19:11:10,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 19:11:10,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 19:11:10,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 19:11:10,730 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 4 states. [2018-04-06 19:11:10,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:10,834 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-04-06 19:11:10,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 19:11:10,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-06 19:11:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:10,848 INFO L225 Difference]: With dead ends: 95 [2018-04-06 19:11:10,848 INFO L226 Difference]: Without dead ends: 77 [2018-04-06 19:11:10,852 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-06 19:11:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-06 19:11:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-04-06 19:11:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-06 19:11:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-04-06 19:11:10,897 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 19 [2018-04-06 19:11:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:10,897 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-04-06 19:11:10,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 19:11:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-04-06 19:11:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-06 19:11:10,898 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:10,899 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:10,899 INFO L408 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:10,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1897600848, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:10,905 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:10,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:10,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:10,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:10,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:10,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-06 19:11:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:10,979 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:11,050 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:11:11,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-06 19:11:11,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 19:11:11,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 19:11:11,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-06 19:11:11,053 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 7 states. [2018-04-06 19:11:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:11,174 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-04-06 19:11:11,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 19:11:11,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-04-06 19:11:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:11,176 INFO L225 Difference]: With dead ends: 77 [2018-04-06 19:11:11,176 INFO L226 Difference]: Without dead ends: 76 [2018-04-06 19:11:11,177 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-06 19:11:11,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-04-06 19:11:11,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-04-06 19:11:11,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-06 19:11:11,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-04-06 19:11:11,186 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 19 [2018-04-06 19:11:11,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:11,187 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-04-06 19:11:11,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 19:11:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-04-06 19:11:11,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-06 19:11:11,188 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:11,189 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:11,189 INFO L408 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:11,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1105859402, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:11,202 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:11,229 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:11,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:11,312 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:11,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-04-06 19:11:11,361 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:11:11,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-06 19:11:11,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 19:11:11,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 19:11:11,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-06 19:11:11,362 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 7 states. [2018-04-06 19:11:11,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:11,526 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-04-06 19:11:11,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-06 19:11:11,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-04-06 19:11:11,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:11,528 INFO L225 Difference]: With dead ends: 76 [2018-04-06 19:11:11,528 INFO L226 Difference]: Without dead ends: 75 [2018-04-06 19:11:11,528 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-06 19:11:11,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-06 19:11:11,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-06 19:11:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-06 19:11:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-04-06 19:11:11,536 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 37 [2018-04-06 19:11:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:11,536 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-04-06 19:11:11,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 19:11:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-04-06 19:11:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-06 19:11:11,538 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:11,538 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:11,540 INFO L408 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:11,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1105859403, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:11,548 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:11,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:11,664 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:11,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-06 19:11:11,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:11,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-06 19:11:11,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:11,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:11:11,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-06 19:11:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:11,728 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:11:11,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2018-04-06 19:11:11,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-06 19:11:11,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-06 19:11:11,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-06 19:11:11,729 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 10 states. [2018-04-06 19:11:12,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:12,019 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-04-06 19:11:12,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-06 19:11:12,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-04-06 19:11:12,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:12,023 INFO L225 Difference]: With dead ends: 89 [2018-04-06 19:11:12,023 INFO L226 Difference]: Without dead ends: 88 [2018-04-06 19:11:12,024 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-04-06 19:11:12,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-06 19:11:12,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2018-04-06 19:11:12,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-06 19:11:12,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-04-06 19:11:12,030 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 37 [2018-04-06 19:11:12,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:12,030 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-04-06 19:11:12,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-06 19:11:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-04-06 19:11:12,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-06 19:11:12,031 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:12,031 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:12,031 INFO L408 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:12,031 INFO L82 PathProgramCache]: Analyzing trace with hash -78096902, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:12,038 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:12,065 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:12,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:12,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:12,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:12,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 19:11:12,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 19:11:12,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:12,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:12,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-06 19:11:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:12,148 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:12,199 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:11:12,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2018-04-06 19:11:12,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:11:12,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:11:12,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-04-06 19:11:12,200 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 12 states. [2018-04-06 19:11:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:12,376 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-04-06 19:11:12,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:11:12,377 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-04-06 19:11:12,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:12,378 INFO L225 Difference]: With dead ends: 85 [2018-04-06 19:11:12,378 INFO L226 Difference]: Without dead ends: 84 [2018-04-06 19:11:12,378 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-04-06 19:11:12,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-06 19:11:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-04-06 19:11:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-06 19:11:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-04-06 19:11:12,387 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 38 [2018-04-06 19:11:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:12,387 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-04-06 19:11:12,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:11:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-04-06 19:11:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-06 19:11:12,389 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:12,389 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:12,389 INFO L408 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:12,389 INFO L82 PathProgramCache]: Analyzing trace with hash -78096901, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:12,395 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:12,416 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:12,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:12,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:12,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:12,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:12,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:12,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-06 19:11:12,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:12,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-06 19:11:12,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:12,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:12,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:12,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:11:12,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:12,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:12,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:11:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:12,533 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:12,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-04-06 19:11:12,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:12,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-06 19:11:12,700 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 19:11:12,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:12,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-06 19:11:12,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:12,705 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:12,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:12,707 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2018-04-06 19:11:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:12,734 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:11:12,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 17 [2018-04-06 19:11:12,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-06 19:11:12,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-06 19:11:12,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-04-06 19:11:12,735 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 18 states. [2018-04-06 19:11:13,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:13,070 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-04-06 19:11:13,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-06 19:11:13,070 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-04-06 19:11:13,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:13,071 INFO L225 Difference]: With dead ends: 96 [2018-04-06 19:11:13,071 INFO L226 Difference]: Without dead ends: 95 [2018-04-06 19:11:13,072 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2018-04-06 19:11:13,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-06 19:11:13,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2018-04-06 19:11:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-06 19:11:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-04-06 19:11:13,080 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 38 [2018-04-06 19:11:13,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:13,080 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-04-06 19:11:13,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-06 19:11:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-04-06 19:11:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-06 19:11:13,082 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:13,082 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:13,082 INFO L408 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:13,082 INFO L82 PathProgramCache]: Analyzing trace with hash -712713128, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:13,088 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:13,109 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:13,125 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:13,182 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:11:13,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2018-04-06 19:11:13,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 19:11:13,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 19:11:13,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-06 19:11:13,183 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 6 states. [2018-04-06 19:11:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:13,204 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-04-06 19:11:13,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 19:11:13,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-04-06 19:11:13,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:13,206 INFO L225 Difference]: With dead ends: 96 [2018-04-06 19:11:13,206 INFO L226 Difference]: Without dead ends: 85 [2018-04-06 19:11:13,206 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-04-06 19:11:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-06 19:11:13,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-04-06 19:11:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-06 19:11:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-04-06 19:11:13,212 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 39 [2018-04-06 19:11:13,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:13,212 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-04-06 19:11:13,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 19:11:13,212 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-04-06 19:11:13,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-06 19:11:13,213 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:13,213 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:13,213 INFO L408 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:13,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1036144935, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:13,220 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:13,243 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:13,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-06 19:11:13,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 19:11:13,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:13,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:13,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 19:11:13,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-04-06 19:11:13,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-06 19:11:13,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-06 19:11:13,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:11:13,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:11:13,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:11:13,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-04-06 19:11:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:13,558 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:13,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-06 19:11:13,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:13,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-06 19:11:13,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-06 19:11:13,852 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:13,854 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:13,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:13,863 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-04-06 19:11:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:13,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:11:13,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-06 19:11:13,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-06 19:11:13,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-06 19:11:13,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-04-06 19:11:13,898 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 21 states. [2018-04-06 19:11:14,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:14,580 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-04-06 19:11:14,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-06 19:11:14,580 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-04-06 19:11:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:14,581 INFO L225 Difference]: With dead ends: 110 [2018-04-06 19:11:14,581 INFO L226 Difference]: Without dead ends: 109 [2018-04-06 19:11:14,582 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2018-04-06 19:11:14,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-06 19:11:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2018-04-06 19:11:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-06 19:11:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-04-06 19:11:14,589 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 52 [2018-04-06 19:11:14,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:14,589 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-04-06 19:11:14,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-06 19:11:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-04-06 19:11:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-06 19:11:14,590 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:14,591 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:14,591 INFO L408 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:14,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2049691577, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:14,598 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:14,621 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:14,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-04-06 19:11:14,636 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:14,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-04-06 19:11:14,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:14,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:14,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-04-06 19:11:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:14,667 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:11:14,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-06 19:11:14,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 19:11:14,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 19:11:14,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-06 19:11:14,668 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 6 states. [2018-04-06 19:11:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:14,748 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-04-06 19:11:14,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-06 19:11:14,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-04-06 19:11:14,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:14,750 INFO L225 Difference]: With dead ends: 102 [2018-04-06 19:11:14,750 INFO L226 Difference]: Without dead ends: 101 [2018-04-06 19:11:14,750 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-06 19:11:14,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-06 19:11:14,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-04-06 19:11:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-06 19:11:14,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-04-06 19:11:14,758 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 52 [2018-04-06 19:11:14,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:14,759 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-04-06 19:11:14,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 19:11:14,759 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-04-06 19:11:14,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-06 19:11:14,760 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:14,760 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:14,760 INFO L408 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:14,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2049691576, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:14,770 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:14,799 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:14,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:14,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:14,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:14,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:14,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:14,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:11:14,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:14,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-06 19:11:14,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:14,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:14,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:14,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:11:14,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:14,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:14,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:11:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:15,064 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:15,541 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:11:15,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 38 [2018-04-06 19:11:15,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-06 19:11:15,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-06 19:11:15,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2018-04-06 19:11:15,543 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 39 states. [2018-04-06 19:11:17,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:17,738 INFO L93 Difference]: Finished difference Result 183 states and 196 transitions. [2018-04-06 19:11:17,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-06 19:11:17,738 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-04-06 19:11:17,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:17,739 INFO L225 Difference]: With dead ends: 183 [2018-04-06 19:11:17,740 INFO L226 Difference]: Without dead ends: 182 [2018-04-06 19:11:17,742 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-04-06 19:11:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-06 19:11:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 113. [2018-04-06 19:11:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-06 19:11:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-04-06 19:11:17,752 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 52 [2018-04-06 19:11:17,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:17,752 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-04-06 19:11:17,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-06 19:11:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-04-06 19:11:17,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-06 19:11:17,753 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:17,754 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:17,754 INFO L408 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:17,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2055721887, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:17,764 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:17,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:17,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:17,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:17,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:17,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:17,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:17,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:11:17,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:17,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:17,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:11:17,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:17,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-06 19:11:17,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:17,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:17,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:11:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:17,983 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:18,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:11:18,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2018-04-06 19:11:18,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-06 19:11:18,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-06 19:11:18,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2018-04-06 19:11:18,297 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 31 states. [2018-04-06 19:11:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:19,447 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2018-04-06 19:11:19,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-06 19:11:19,447 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2018-04-06 19:11:19,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:19,448 INFO L225 Difference]: With dead ends: 178 [2018-04-06 19:11:19,448 INFO L226 Difference]: Without dead ends: 177 [2018-04-06 19:11:19,449 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=422, Invalid=2770, Unknown=0, NotChecked=0, Total=3192 [2018-04-06 19:11:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-06 19:11:19,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 127. [2018-04-06 19:11:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-06 19:11:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2018-04-06 19:11:19,456 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 53 [2018-04-06 19:11:19,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:19,456 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2018-04-06 19:11:19,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-06 19:11:19,456 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2018-04-06 19:11:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-06 19:11:19,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:19,458 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:19,458 INFO L408 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:19,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1011159860, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:19,465 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:19,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:19,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:19,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-06 19:11:19,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-06 19:11:19,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:19,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:19,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 19:11:19,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:11:19,562 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-06 19:11:19,566 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-06 19:11:19,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-06 19:11:19,585 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:19,602 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_16| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_16|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_16| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_16| 0) |c_old(#valid)|))) is different from false [2018-04-06 19:11:19,605 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_15| Int) (|v_main_#t~malloc11.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_15| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_16|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_16| 1) |v_main_#t~malloc10.base_15| 0) |v_main_#t~malloc11.base_16| 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_15|) 0))))) is different from false [2018-04-06 19:11:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-06 19:11:19,639 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:11:19,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:11:19,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:11:19,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:11:19,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:11:19,639 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 12 states. [2018-04-06 19:11:19,648 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_15| Int) (|v_main_#t~malloc11.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_15| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_16|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_16| 1) |v_main_#t~malloc10.base_15| 0) |v_main_#t~malloc11.base_16| 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_15|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-06 19:11:19,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:19,933 INFO L93 Difference]: Finished difference Result 239 states and 258 transitions. [2018-04-06 19:11:19,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:11:19,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-04-06 19:11:19,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:19,935 INFO L225 Difference]: With dead ends: 239 [2018-04-06 19:11:19,935 INFO L226 Difference]: Without dead ends: 227 [2018-04-06 19:11:19,936 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-06 19:11:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-06 19:11:19,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2018-04-06 19:11:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-06 19:11:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 242 transitions. [2018-04-06 19:11:19,955 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 242 transitions. Word has length 54 [2018-04-06 19:11:19,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:19,956 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 242 transitions. [2018-04-06 19:11:19,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:11:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 242 transitions. [2018-04-06 19:11:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-06 19:11:19,957 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:19,957 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:19,957 INFO L408 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:19,957 INFO L82 PathProgramCache]: Analyzing trace with hash 415297934, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:19,966 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:19,986 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:19,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-06 19:11:19,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 19:11:19,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:19,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:19,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:19,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-04-06 19:11:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:20,042 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:20,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-06 19:11:20,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-06 19:11:20,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:20,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:20,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:20,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-04-06 19:11:20,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:20,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-06 19:11:20,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 15 [2018-04-06 19:11:20,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-06 19:11:20,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-06 19:11:20,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-04-06 19:11:20,190 INFO L87 Difference]: Start difference. First operand 224 states and 242 transitions. Second operand 15 states. [2018-04-06 19:11:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:20,483 INFO L93 Difference]: Finished difference Result 296 states and 317 transitions. [2018-04-06 19:11:20,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-06 19:11:20,483 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-04-06 19:11:20,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:20,485 INFO L225 Difference]: With dead ends: 296 [2018-04-06 19:11:20,485 INFO L226 Difference]: Without dead ends: 288 [2018-04-06 19:11:20,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2018-04-06 19:11:20,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-06 19:11:20,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 257. [2018-04-06 19:11:20,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-04-06 19:11:20,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 279 transitions. [2018-04-06 19:11:20,505 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 279 transitions. Word has length 55 [2018-04-06 19:11:20,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:20,506 INFO L459 AbstractCegarLoop]: Abstraction has 257 states and 279 transitions. [2018-04-06 19:11:20,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-06 19:11:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 279 transitions. [2018-04-06 19:11:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-06 19:11:20,507 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:20,507 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:20,508 INFO L408 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:20,508 INFO L82 PathProgramCache]: Analyzing trace with hash -609999223, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:20,518 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:20,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:20,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:20,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-06 19:11:20,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:20,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-06 19:11:20,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:20,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:20,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 19:11:20,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:11:20,650 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-06 19:11:20,653 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-06 19:11:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-06 19:11:20,661 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:20,681 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_20| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_20| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_20|))))) is different from false [2018-04-06 19:11:20,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-04-06 19:11:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-06 19:11:20,739 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:11:20,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:11:20,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:11:20,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:11:20,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:11:20,740 INFO L87 Difference]: Start difference. First operand 257 states and 279 transitions. Second operand 12 states. [2018-04-06 19:11:20,755 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc11.base_20| Int) (|v_main_#t~malloc10.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_19| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_20|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_20| 1) |v_main_#t~malloc10.base_19| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_19|))))))) is different from false [2018-04-06 19:11:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:21,271 INFO L93 Difference]: Finished difference Result 388 states and 419 transitions. [2018-04-06 19:11:21,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:11:21,272 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-06 19:11:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:21,273 INFO L225 Difference]: With dead ends: 388 [2018-04-06 19:11:21,273 INFO L226 Difference]: Without dead ends: 368 [2018-04-06 19:11:21,274 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-06 19:11:21,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-04-06 19:11:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 176. [2018-04-06 19:11:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-06 19:11:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-04-06 19:11:21,286 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 55 [2018-04-06 19:11:21,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:21,286 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-04-06 19:11:21,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:11:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-04-06 19:11:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-06 19:11:21,287 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:21,287 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:21,287 INFO L408 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:21,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1776017105, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:21,315 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:21,337 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:21,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:21,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-06 19:11:21,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-06 19:11:21,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:21,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:21,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 19:11:21,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:11:21,480 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-06 19:11:21,484 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-06 19:11:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:21,493 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:21,542 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_22| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_22|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_22| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|))) is different from false [2018-04-06 19:11:21,546 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_21| Int) (|v_main_#t~malloc11.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_22| 1) |v_main_#t~malloc10.base_21| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_22|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_21|) 0))))) is different from false [2018-04-06 19:11:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:21,612 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:11:21,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:11:21,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:11:21,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:11:21,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:11:21,613 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 12 states. [2018-04-06 19:11:21,621 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_21| Int) (|v_main_#t~malloc11.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_22| 1) |v_main_#t~malloc10.base_21| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_22|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_21|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-06 19:11:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:21,935 INFO L93 Difference]: Finished difference Result 309 states and 325 transitions. [2018-04-06 19:11:21,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:11:21,935 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-04-06 19:11:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:21,937 INFO L225 Difference]: With dead ends: 309 [2018-04-06 19:11:21,937 INFO L226 Difference]: Without dead ends: 297 [2018-04-06 19:11:21,938 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-06 19:11:21,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-04-06 19:11:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 176. [2018-04-06 19:11:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-06 19:11:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-04-06 19:11:21,954 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 60 [2018-04-06 19:11:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:21,955 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-04-06 19:11:21,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:11:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-04-06 19:11:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-06 19:11:21,956 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:21,956 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:21,956 INFO L408 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash -105397872, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:21,966 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:21,988 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:22,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:22,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-06 19:11:22,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:22,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-06 19:11:22,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:22,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:22,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 19:11:22,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:11:22,051 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-06 19:11:22,055 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-06 19:11:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:22,064 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:22,080 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_24| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_24| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_24|))))) is different from false [2018-04-06 19:11:22,084 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_24| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc11.base_24|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_24| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|)))) is different from false [2018-04-06 19:11:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:22,140 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:11:22,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:11:22,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:11:22,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:11:22,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:11:22,141 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 12 states. [2018-04-06 19:11:22,156 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_24| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc11.base_24|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_24| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|)))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-06 19:11:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:22,676 INFO L93 Difference]: Finished difference Result 250 states and 263 transitions. [2018-04-06 19:11:22,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:11:22,677 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-04-06 19:11:22,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:22,678 INFO L225 Difference]: With dead ends: 250 [2018-04-06 19:11:22,678 INFO L226 Difference]: Without dead ends: 238 [2018-04-06 19:11:22,679 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-06 19:11:22,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-06 19:11:22,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 115. [2018-04-06 19:11:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-06 19:11:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-04-06 19:11:22,697 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 61 [2018-04-06 19:11:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:22,697 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-04-06 19:11:22,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:11:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-04-06 19:11:22,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-06 19:11:22,698 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:22,699 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:22,699 INFO L408 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:22,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1803017946, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:22,714 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:22,739 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:22,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:22,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:22,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-04-06 19:11:22,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:22,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:22,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:11:22,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:22,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:22,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:11:22,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:22,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-06 19:11:22,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:22,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:22,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:11:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:23,122 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:23,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:11:23,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 48 [2018-04-06 19:11:23,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-06 19:11:23,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-06 19:11:23,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2200, Unknown=0, NotChecked=0, Total=2352 [2018-04-06 19:11:23,868 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 49 states. [2018-04-06 19:11:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:27,455 INFO L93 Difference]: Finished difference Result 178 states and 186 transitions. [2018-04-06 19:11:27,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-06 19:11:27,455 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 61 [2018-04-06 19:11:27,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:27,456 INFO L225 Difference]: With dead ends: 178 [2018-04-06 19:11:27,456 INFO L226 Difference]: Without dead ends: 177 [2018-04-06 19:11:27,458 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2329 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1219, Invalid=10553, Unknown=0, NotChecked=0, Total=11772 [2018-04-06 19:11:27,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-06 19:11:27,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 138. [2018-04-06 19:11:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-06 19:11:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 144 transitions. [2018-04-06 19:11:27,477 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 144 transitions. Word has length 61 [2018-04-06 19:11:27,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:27,478 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 144 transitions. [2018-04-06 19:11:27,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-06 19:11:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 144 transitions. [2018-04-06 19:11:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-06 19:11:27,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:27,478 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:27,479 INFO L408 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:27,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1306320949, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:27,487 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:27,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:27,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:27,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:27,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:27,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 19:11:27,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:27,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:27,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:27,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:27,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:11:27,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:27,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:27,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-06 19:11:27,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-06 19:11:27,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-04-06 19:11:27,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:27,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:27,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:27,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-06 19:11:27,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-06 19:11:27,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 19:11:27,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:27,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:27,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:27,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-06 19:11:27,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-06 19:11:27,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-06 19:11:27,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:11:27,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:11:27,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:11:27,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-06 19:11:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:27,848 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:28,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-04-06 19:11:28,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 19:11:28,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:28,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-04-06 19:11:28,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-06 19:11:28,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:28,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:28,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-06 19:11:28,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-04-06 19:11:28,593 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:28,594 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:28,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:11:28,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:11:28,620 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-04-06 19:11:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:28,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:11:28,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-04-06 19:11:28,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-06 19:11:28,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-06 19:11:28,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-04-06 19:11:28,814 INFO L87 Difference]: Start difference. First operand 138 states and 144 transitions. Second operand 42 states. [2018-04-06 19:11:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:30,116 INFO L93 Difference]: Finished difference Result 169 states and 175 transitions. [2018-04-06 19:11:30,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-06 19:11:30,116 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 67 [2018-04-06 19:11:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:30,117 INFO L225 Difference]: With dead ends: 169 [2018-04-06 19:11:30,117 INFO L226 Difference]: Without dead ends: 168 [2018-04-06 19:11:30,118 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=398, Invalid=3762, Unknown=0, NotChecked=0, Total=4160 [2018-04-06 19:11:30,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-06 19:11:30,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 138. [2018-04-06 19:11:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-06 19:11:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2018-04-06 19:11:30,128 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 67 [2018-04-06 19:11:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:30,129 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2018-04-06 19:11:30,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-06 19:11:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2018-04-06 19:11:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-06 19:11:30,130 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:30,130 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:30,130 INFO L408 AbstractCegarLoop]: === Iteration 19 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:30,131 INFO L82 PathProgramCache]: Analyzing trace with hash 239796070, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:30,141 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:30,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:30,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:30,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:30,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:30,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:30,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:30,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:11:30,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:30,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:30,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:11:30,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:30,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-06 19:11:30,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:30,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:30,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:11:30,888 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:30,888 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:32,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:11:32,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 68 [2018-04-06 19:11:32,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-06 19:11:32,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-06 19:11:32,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=4410, Unknown=0, NotChecked=0, Total=4692 [2018-04-06 19:11:32,366 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand 69 states. [2018-04-06 19:11:40,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:40,604 INFO L93 Difference]: Finished difference Result 233 states and 242 transitions. [2018-04-06 19:11:40,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-04-06 19:11:40,604 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 79 [2018-04-06 19:11:40,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:40,605 INFO L225 Difference]: With dead ends: 233 [2018-04-06 19:11:40,605 INFO L226 Difference]: Without dead ends: 232 [2018-04-06 19:11:40,610 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6959 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2849, Invalid=26907, Unknown=0, NotChecked=0, Total=29756 [2018-04-06 19:11:40,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-06 19:11:40,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 200. [2018-04-06 19:11:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-06 19:11:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 206 transitions. [2018-04-06 19:11:40,641 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 206 transitions. Word has length 79 [2018-04-06 19:11:40,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:40,642 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 206 transitions. [2018-04-06 19:11:40,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-06 19:11:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 206 transitions. [2018-04-06 19:11:40,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-06 19:11:40,643 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:40,643 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:40,643 INFO L408 AbstractCegarLoop]: === Iteration 20 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:40,643 INFO L82 PathProgramCache]: Analyzing trace with hash -742476633, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:40,651 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:40,683 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:40,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:40,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:40,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:40,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 19:11:40,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:40,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:40,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:11:40,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:40,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:40,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:40,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:40,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-06 19:11:40,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-06 19:11:40,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 12 treesize of output 11 [2018-04-06 19:11:40,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:40,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:40,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:40,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-06 19:11:40,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-06 19:11:40,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 19:11:40,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:40,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:40,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:40,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-06 19:11:40,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-06 19:11:40,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 19:11:40,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:40,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:41,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:41,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-06 19:11:41,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-06 19:11:41,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-06 19:11:41,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:11:41,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:11:41,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:11:41,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-06 19:11:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 7 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:41,214 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:42,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-04-06 19:11:42,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 19:11:42,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:42,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-06 19:11:42,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 34 [2018-04-06 19:11:42,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2018-04-06 19:11:42,550 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-06 19:11:42,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-06 19:11:42,552 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:42,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2018-04-06 19:11:42,558 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-06 19:11:42,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2018-04-06 19:11:42,600 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-04-06 19:11:42,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2018-04-06 19:11:42,606 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-06 19:11:42,630 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:11:42,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:11:42,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2018-04-06 19:11:42,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-04-06 19:11:42,657 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:42,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 60 [2018-04-06 19:11:42,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-04-06 19:11:42,751 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-04-06 19:11:42,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2018-04-06 19:11:42,761 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-04-06 19:11:42,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2018-04-06 19:11:42,823 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-06 19:11:42,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2018-04-06 19:11:42,866 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-06 19:11:42,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-04-06 19:11:42,871 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-04-06 19:11:42,895 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 19:11:42,921 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 19:11:42,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-04-06 19:11:42,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-04-06 19:11:42,925 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:42,927 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:42,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-06 19:11:42,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:11:42,980 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 6 variables, input treesize:60, output treesize:84 [2018-04-06 19:11:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:43,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:11:43,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-04-06 19:11:43,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-06 19:11:43,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-06 19:11:43,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2474, Unknown=0, NotChecked=0, Total=2652 [2018-04-06 19:11:43,187 INFO L87 Difference]: Start difference. First operand 200 states and 206 transitions. Second operand 52 states. [2018-04-06 19:11:45,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:45,568 INFO L93 Difference]: Finished difference Result 222 states and 229 transitions. [2018-04-06 19:11:45,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-06 19:11:45,568 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 82 [2018-04-06 19:11:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:45,569 INFO L225 Difference]: With dead ends: 222 [2018-04-06 19:11:45,569 INFO L226 Difference]: Without dead ends: 221 [2018-04-06 19:11:45,570 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1241, Invalid=6591, Unknown=0, NotChecked=0, Total=7832 [2018-04-06 19:11:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-06 19:11:45,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 199. [2018-04-06 19:11:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-06 19:11:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 205 transitions. [2018-04-06 19:11:45,598 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 205 transitions. Word has length 82 [2018-04-06 19:11:45,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:45,598 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 205 transitions. [2018-04-06 19:11:45,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-06 19:11:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 205 transitions. [2018-04-06 19:11:45,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-06 19:11:45,599 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:45,599 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:45,599 INFO L408 AbstractCegarLoop]: === Iteration 21 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash 466654152, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:45,610 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:45,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:45,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:45,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:45,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:45,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:45,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:45,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:11:45,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:45,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-06 19:11:45,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:45,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:45,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:45,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:11:45,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:45,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:45,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:11:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:46,048 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:46,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:11:46,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 54 [2018-04-06 19:11:46,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-06 19:11:46,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-06 19:11:46,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2781, Unknown=0, NotChecked=0, Total=2970 [2018-04-06 19:11:46,890 INFO L87 Difference]: Start difference. First operand 199 states and 205 transitions. Second operand 55 states. [2018-04-06 19:11:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:52,737 INFO L93 Difference]: Finished difference Result 379 states and 393 transitions. [2018-04-06 19:11:52,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-06 19:11:52,737 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 82 [2018-04-06 19:11:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:52,739 INFO L225 Difference]: With dead ends: 379 [2018-04-06 19:11:52,739 INFO L226 Difference]: Without dead ends: 378 [2018-04-06 19:11:52,741 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4860 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2029, Invalid=18851, Unknown=0, NotChecked=0, Total=20880 [2018-04-06 19:11:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-04-06 19:11:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 250. [2018-04-06 19:11:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-06 19:11:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 263 transitions. [2018-04-06 19:11:52,778 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 263 transitions. Word has length 82 [2018-04-06 19:11:52,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:52,779 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 263 transitions. [2018-04-06 19:11:52,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-06 19:11:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 263 transitions. [2018-04-06 19:11:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-06 19:11:52,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:52,780 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:52,780 INFO L408 AbstractCegarLoop]: === Iteration 22 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:52,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1541939169, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:52,788 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:52,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:52,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:52,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:52,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:52,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:52,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:52,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:11:52,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:52,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:52,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:11:52,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:52,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-06 19:11:52,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:52,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:52,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:11:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:53,179 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:53,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:11:53,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 46 [2018-04-06 19:11:53,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-06 19:11:53,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-06 19:11:53,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1999, Unknown=0, NotChecked=0, Total=2162 [2018-04-06 19:11:53,795 INFO L87 Difference]: Start difference. First operand 250 states and 263 transitions. Second operand 47 states. [2018-04-06 19:11:56,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:11:56,715 INFO L93 Difference]: Finished difference Result 383 states and 396 transitions. [2018-04-06 19:11:56,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-06 19:11:56,715 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 83 [2018-04-06 19:11:56,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:11:56,716 INFO L225 Difference]: With dead ends: 383 [2018-04-06 19:11:56,716 INFO L226 Difference]: Without dead ends: 382 [2018-04-06 19:11:56,717 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1182, Invalid=8520, Unknown=0, NotChecked=0, Total=9702 [2018-04-06 19:11:56,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-04-06 19:11:56,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 264. [2018-04-06 19:11:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-04-06 19:11:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 274 transitions. [2018-04-06 19:11:56,754 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 274 transitions. Word has length 83 [2018-04-06 19:11:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:11:56,754 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 274 transitions. [2018-04-06 19:11:56,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-06 19:11:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 274 transitions. [2018-04-06 19:11:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-06 19:11:56,756 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:11:56,756 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:11:56,756 INFO L408 AbstractCegarLoop]: === Iteration 23 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:11:56,756 INFO L82 PathProgramCache]: Analyzing trace with hash 153237420, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:11:56,764 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:11:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:11:56,796 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:11:56,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:56,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:56,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:11:56,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:56,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:56,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:11:56,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:56,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:11:56,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:11:56,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:56,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-06 19:11:56,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:11:56,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:11:56,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:11:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:57,490 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:11:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:11:58,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:11:58,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 66 [2018-04-06 19:11:58,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-06 19:11:58,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-06 19:11:58,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4176, Unknown=0, NotChecked=0, Total=4422 [2018-04-06 19:11:58,812 INFO L87 Difference]: Start difference. First operand 264 states and 274 transitions. Second operand 67 states. [2018-04-06 19:12:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:12:08,093 INFO L93 Difference]: Finished difference Result 397 states and 409 transitions. [2018-04-06 19:12:08,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-04-06 19:12:08,094 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 85 [2018-04-06 19:12:08,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:12:08,095 INFO L225 Difference]: With dead ends: 397 [2018-04-06 19:12:08,095 INFO L226 Difference]: Without dead ends: 396 [2018-04-06 19:12:08,096 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8664 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=2937, Invalid=31473, Unknown=0, NotChecked=0, Total=34410 [2018-04-06 19:12:08,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-04-06 19:12:08,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 260. [2018-04-06 19:12:08,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-06 19:12:08,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 270 transitions. [2018-04-06 19:12:08,121 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 270 transitions. Word has length 85 [2018-04-06 19:12:08,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:12:08,122 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 270 transitions. [2018-04-06 19:12:08,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-06 19:12:08,122 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 270 transitions. [2018-04-06 19:12:08,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-04-06 19:12:08,123 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:12:08,123 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:12:08,123 INFO L408 AbstractCegarLoop]: === Iteration 24 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:12:08,123 INFO L82 PathProgramCache]: Analyzing trace with hash -2054967898, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:12:08,129 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:12:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:12:08,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:12:08,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:12:08,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:12:08,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:12:08,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:12:08,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:12:08,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:12:08,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:12:08,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-06 19:12:08,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:12:08,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:12:08,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:12:08,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:12:08,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:12:08,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:12:08,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:12:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:12:08,939 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:12:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:12:10,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:12:10,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 32] total 69 [2018-04-06 19:12:10,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-06 19:12:10,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-06 19:12:10,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4581, Unknown=0, NotChecked=0, Total=4830 [2018-04-06 19:12:10,332 INFO L87 Difference]: Start difference. First operand 260 states and 270 transitions. Second operand 70 states. [2018-04-06 19:12:24,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:12:24,182 INFO L93 Difference]: Finished difference Result 446 states and 458 transitions. [2018-04-06 19:12:24,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-04-06 19:12:24,182 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 91 [2018-04-06 19:12:24,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:12:24,184 INFO L225 Difference]: With dead ends: 446 [2018-04-06 19:12:24,184 INFO L226 Difference]: Without dead ends: 445 [2018-04-06 19:12:24,185 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11664 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=3727, Invalid=41429, Unknown=0, NotChecked=0, Total=45156 [2018-04-06 19:12:24,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-04-06 19:12:24,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 243. [2018-04-06 19:12:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-06 19:12:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 252 transitions. [2018-04-06 19:12:24,208 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 252 transitions. Word has length 91 [2018-04-06 19:12:24,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:12:24,208 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 252 transitions. [2018-04-06 19:12:24,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-06 19:12:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 252 transitions. [2018-04-06 19:12:24,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-06 19:12:24,209 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:12:24,209 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:12:24,209 INFO L408 AbstractCegarLoop]: === Iteration 25 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:12:24,209 INFO L82 PathProgramCache]: Analyzing trace with hash -651400218, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:12:24,218 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:12:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:12:24,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:12:24,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:12:24,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:12:24,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:12:24,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:12:24,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:12:24,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:12:24,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:12:24,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:12:24,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:12:24,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:12:24,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-06 19:12:24,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:12:24,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:12:24,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:12:25,245 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:12:25,246 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:12:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:12:27,463 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:12:27,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42] total 84 [2018-04-06 19:12:27,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-06 19:12:27,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-06 19:12:27,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=6783, Unknown=0, NotChecked=0, Total=7140 [2018-04-06 19:12:27,465 INFO L87 Difference]: Start difference. First operand 243 states and 252 transitions. Second operand 85 states. [2018-04-06 19:12:32,752 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 61 DAG size of output 59 [2018-04-06 19:12:33,444 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 69 DAG size of output 60 [2018-04-06 19:12:38,094 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 70 DAG size of output 66 [2018-04-06 19:12:52,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:12:52,145 INFO L93 Difference]: Finished difference Result 529 states and 544 transitions. [2018-04-06 19:12:52,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2018-04-06 19:12:52,145 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 109 [2018-04-06 19:12:52,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:12:52,147 INFO L225 Difference]: With dead ends: 529 [2018-04-06 19:12:52,147 INFO L226 Difference]: Without dead ends: 528 [2018-04-06 19:12:52,152 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29263 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=6686, Invalid=89104, Unknown=0, NotChecked=0, Total=95790 [2018-04-06 19:12:52,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-04-06 19:12:52,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 269. [2018-04-06 19:12:52,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-04-06 19:12:52,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 279 transitions. [2018-04-06 19:12:52,193 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 279 transitions. Word has length 109 [2018-04-06 19:12:52,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:12:52,193 INFO L459 AbstractCegarLoop]: Abstraction has 269 states and 279 transitions. [2018-04-06 19:12:52,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-06 19:12:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 279 transitions. [2018-04-06 19:12:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-04-06 19:12:52,194 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:12:52,194 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:12:52,194 INFO L408 AbstractCegarLoop]: === Iteration 26 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:12:52,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1290307198, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:12:52,200 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:12:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:12:52,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:12:52,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:12:52,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:12:52,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-04-06 19:12:52,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:12:52,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:12:52,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:12:52,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:12:52,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-06 19:12:52,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:12:52,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:12:52,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:12:52,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:12:52,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:12:52,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:12:52,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:12:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:12:53,596 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:12:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:12:56,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:12:56,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48] total 96 [2018-04-06 19:12:56,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-06 19:12:56,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-06 19:12:56,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=8799, Unknown=0, NotChecked=0, Total=9312 [2018-04-06 19:12:56,521 INFO L87 Difference]: Start difference. First operand 269 states and 279 transitions. Second operand 97 states. [2018-04-06 19:12:59,250 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 58 DAG size of output 56 [2018-04-06 19:12:59,742 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 61 DAG size of output 56 [2018-04-06 19:13:00,016 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 58 DAG size of output 56 [2018-04-06 19:13:00,454 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 58 DAG size of output 56 [2018-04-06 19:13:01,939 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 69 DAG size of output 67 [2018-04-06 19:13:02,223 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 68 DAG size of output 66 [2018-04-06 19:13:02,570 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 68 DAG size of output 66 [2018-04-06 19:13:03,128 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 69 DAG size of output 67 [2018-04-06 19:13:03,411 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 68 DAG size of output 66 [2018-04-06 19:13:03,718 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 71 DAG size of output 66 [2018-04-06 19:13:05,425 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 67 DAG size of output 65 [2018-04-06 19:13:11,556 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 89 DAG size of output 78 [2018-04-06 19:13:11,946 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 90 DAG size of output 79 [2018-04-06 19:13:12,891 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 102 DAG size of output 80 [2018-04-06 19:13:13,255 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 98 DAG size of output 79 [2018-04-06 19:13:15,562 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 70 DAG size of output 68 [2018-04-06 19:13:16,420 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 86 DAG size of output 70 [2018-04-06 19:13:16,728 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 83 DAG size of output 69 [2018-04-06 19:13:22,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:13:22,494 INFO L93 Difference]: Finished difference Result 540 states and 556 transitions. [2018-04-06 19:13:22,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-04-06 19:13:22,494 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 112 [2018-04-06 19:13:22,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:13:22,496 INFO L225 Difference]: With dead ends: 540 [2018-04-06 19:13:22,496 INFO L226 Difference]: Without dead ends: 539 [2018-04-06 19:13:22,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26515 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=7398, Invalid=85932, Unknown=0, NotChecked=0, Total=93330 [2018-04-06 19:13:22,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-04-06 19:13:22,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 323. [2018-04-06 19:13:22,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-06 19:13:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 333 transitions. [2018-04-06 19:13:22,572 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 333 transitions. Word has length 112 [2018-04-06 19:13:22,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:13:22,573 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 333 transitions. [2018-04-06 19:13:22,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-06 19:13:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 333 transitions. [2018-04-06 19:13:22,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-04-06 19:13:22,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:13:22,573 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:13:22,573 INFO L408 AbstractCegarLoop]: === Iteration 27 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:13:22,574 INFO L82 PathProgramCache]: Analyzing trace with hash 990612454, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:13:22,579 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:13:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:13:22,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:13:22,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:13:22,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:13:22,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:13:22,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:13:22,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:13:22,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:13:22,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:13:22,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-06 19:13:22,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:13:22,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:13:22,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:13:22,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:13:22,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:13:22,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:13:22,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:13:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:13:24,615 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:13:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:13:28,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:13:28,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54] total 108 [2018-04-06 19:13:28,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-04-06 19:13:28,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-04-06 19:13:28,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=734, Invalid=11038, Unknown=0, NotChecked=0, Total=11772 [2018-04-06 19:13:28,494 INFO L87 Difference]: Start difference. First operand 323 states and 333 transitions. Second operand 109 states. [2018-04-06 19:13:43,297 WARN L151 SmtUtils]: Spent 187ms on a formula simplification. DAG size of input: 106 DAG size of output 91 [2018-04-06 19:13:43,715 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 107 DAG size of output 92 [2018-04-06 19:13:44,083 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 82 DAG size of output 67 [2018-04-06 19:13:44,571 WARN L151 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 124 DAG size of output 94 [2018-04-06 19:13:44,972 WARN L151 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 120 DAG size of output 93 [2018-04-06 19:13:45,469 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 76 DAG size of output 64 [2018-04-06 19:13:45,938 WARN L148 SmtUtils]: Spent 129ms on a formula simplification that was a NOOP. DAG size: 91 [2018-04-06 19:13:46,293 WARN L148 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 89 [2018-04-06 19:13:46,762 WARN L151 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 87 DAG size of output 83 [2018-04-06 19:13:47,546 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 109 DAG size of output 85 [2018-04-06 19:13:47,876 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 106 DAG size of output 84 [2018-04-06 19:13:48,654 WARN L148 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-06 19:13:49,346 WARN L151 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 78 DAG size of output 76 [2018-04-06 19:13:49,844 WARN L151 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 97 DAG size of output 77 [2018-04-06 19:13:50,120 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 94 DAG size of output 76 [2018-04-06 19:13:50,915 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 69 DAG size of output 67 [2018-04-06 19:13:51,308 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 85 DAG size of output 69 [2018-04-06 19:13:51,548 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 82 DAG size of output 68 [2018-04-06 19:13:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:13:55,183 INFO L93 Difference]: Finished difference Result 547 states and 564 transitions. [2018-04-06 19:13:55,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-04-06 19:13:55,184 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 115 [2018-04-06 19:13:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:13:55,185 INFO L225 Difference]: With dead ends: 547 [2018-04-06 19:13:55,185 INFO L226 Difference]: Without dead ends: 546 [2018-04-06 19:13:55,189 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23675 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=8245, Invalid=82055, Unknown=0, NotChecked=0, Total=90300 [2018-04-06 19:13:55,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-04-06 19:13:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 364. [2018-04-06 19:13:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-04-06 19:13:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 374 transitions. [2018-04-06 19:13:55,254 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 374 transitions. Word has length 115 [2018-04-06 19:13:55,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:13:55,254 INFO L459 AbstractCegarLoop]: Abstraction has 364 states and 374 transitions. [2018-04-06 19:13:55,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-04-06 19:13:55,254 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 374 transitions. [2018-04-06 19:13:55,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-04-06 19:13:55,255 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:13:55,255 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:13:55,255 INFO L408 AbstractCegarLoop]: === Iteration 28 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:13:55,255 INFO L82 PathProgramCache]: Analyzing trace with hash -2109460216, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:13:55,261 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:13:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:13:55,298 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:13:55,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:13:55,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:13:55,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:13:55,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:13:55,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:13:55,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:13:55,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:13:55,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:13:55,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:13:55,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:13:55,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-06 19:13:55,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:13:55,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:13:55,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:13:56,346 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:13:56,346 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:13:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:13:58,650 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:13:58,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45] total 90 [2018-04-06 19:13:58,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-06 19:13:58,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-06 19:13:58,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=7798, Unknown=0, NotChecked=0, Total=8190 [2018-04-06 19:13:58,651 INFO L87 Difference]: Start difference. First operand 364 states and 374 transitions. Second operand 91 states. [2018-04-06 19:14:10,992 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 76 DAG size of output 74 [2018-04-06 19:14:11,721 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 91 DAG size of output 74 [2018-04-06 19:14:12,034 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 88 DAG size of output 74 [2018-04-06 19:14:12,826 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 88 DAG size of output 74 [2018-04-06 19:14:15,347 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 77 DAG size of output 69 [2018-04-06 19:14:15,950 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 81 DAG size of output 73 [2018-04-06 19:14:22,074 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 78 DAG size of output 67 [2018-04-06 19:14:34,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:14:34,650 INFO L93 Difference]: Finished difference Result 908 states and 928 transitions. [2018-04-06 19:14:34,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 306 states. [2018-04-06 19:14:34,650 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 130 [2018-04-06 19:14:34,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:14:34,653 INFO L225 Difference]: With dead ends: 908 [2018-04-06 19:14:34,653 INFO L226 Difference]: Without dead ends: 907 [2018-04-06 19:14:34,659 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51304 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=9953, Invalid=144103, Unknown=0, NotChecked=0, Total=154056 [2018-04-06 19:14:34,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-04-06 19:14:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 428. [2018-04-06 19:14:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-04-06 19:14:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 446 transitions. [2018-04-06 19:14:34,758 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 446 transitions. Word has length 130 [2018-04-06 19:14:34,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:14:34,758 INFO L459 AbstractCegarLoop]: Abstraction has 428 states and 446 transitions. [2018-04-06 19:14:34,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-06 19:14:34,758 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 446 transitions. [2018-04-06 19:14:34,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-04-06 19:14:34,759 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:14:34,759 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:14:34,759 INFO L408 AbstractCegarLoop]: === Iteration 29 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:14:34,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1937855252, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:14:34,766 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:14:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:14:34,805 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:14:34,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:14:34,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:14:34,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:14:34,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:14:34,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:14:34,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:14:34,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:14:34,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-06 19:14:34,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:14:34,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:14:34,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:14:34,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:14:34,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:14:34,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:14:34,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:14:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:14:36,255 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:14:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:14:39,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:14:39,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51] total 102 [2018-04-06 19:14:39,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-04-06 19:14:39,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-04-06 19:14:39,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=10011, Unknown=0, NotChecked=0, Total=10506 [2018-04-06 19:14:39,351 INFO L87 Difference]: Start difference. First operand 428 states and 446 transitions. Second operand 103 states. [2018-04-06 19:14:42,907 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 61 DAG size of output 58 [2018-04-06 19:14:51,387 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 73 DAG size of output 71 [2018-04-06 19:14:52,519 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 83 DAG size of output 70 [2018-04-06 19:14:53,000 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 80 DAG size of output 70 [2018-04-06 19:14:54,470 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 80 DAG size of output 70 [2018-04-06 19:14:57,793 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 79 DAG size of output 73 [2018-04-06 19:14:58,249 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 78 DAG size of output 72 [2018-04-06 19:14:58,645 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 69 DAG size of output 61 [2018-04-06 19:14:58,852 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 78 DAG size of output 72 [2018-04-06 19:14:59,192 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 69 DAG size of output 61 [2018-04-06 19:14:59,843 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 80 DAG size of output 74 [2018-04-06 19:15:00,241 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 79 DAG size of output 73 [2018-04-06 19:15:00,568 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 82 DAG size of output 73 [2018-04-06 19:15:01,620 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 76 DAG size of output 70 [2018-04-06 19:15:01,847 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 75 DAG size of output 69 [2018-04-06 19:15:03,546 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 78 DAG size of output 72 [2018-04-06 19:15:04,400 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 72 DAG size of output 68 [2018-04-06 19:15:04,615 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 81 DAG size of output 72 [2018-04-06 19:15:05,014 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 71 DAG size of output 67 [2018-04-06 19:15:05,690 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 71 DAG size of output 67 [2018-04-06 19:15:06,618 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 73 DAG size of output 69 [2018-04-06 19:15:06,838 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 73 DAG size of output 67 [2018-04-06 19:15:07,151 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 72 DAG size of output 68 [2018-04-06 19:15:07,567 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 75 DAG size of output 68 [2018-04-06 19:15:08,413 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 79 DAG size of output 70 [2018-04-06 19:15:09,866 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 90 DAG size of output 72 [2018-04-06 19:15:10,400 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 86 DAG size of output 71 [2018-04-06 19:15:12,416 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 65 DAG size of output 63 [2018-04-06 19:15:13,183 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 64 DAG size of output 62 [2018-04-06 19:15:15,240 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 66 DAG size of output 64 Received shutdown request... [2018-04-06 19:15:15,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2018-04-06 19:15:15,349 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-06 19:15:15,353 WARN L197 ceAbstractionStarter]: Timeout [2018-04-06 19:15:15,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 07:15:15 BoogieIcfgContainer [2018-04-06 19:15:15,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-06 19:15:15,354 INFO L168 Benchmark]: Toolchain (without parser) took 245878.74 ms. Allocated memory was 307.2 MB in the beginning and 535.8 MB in the end (delta: 228.6 MB). Free memory was 244.6 MB in the beginning and 402.6 MB in the end (delta: -158.0 MB). Peak memory consumption was 252.9 MB. Max. memory is 5.3 GB. [2018-04-06 19:15:15,355 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 307.2 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-06 19:15:15,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.99 ms. Allocated memory is still 307.2 MB. Free memory was 244.6 MB in the beginning and 220.7 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-06 19:15:15,355 INFO L168 Benchmark]: Boogie Preprocessor took 53.50 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-04-06 19:15:15,355 INFO L168 Benchmark]: RCFGBuilder took 599.06 ms. Allocated memory was 307.2 MB in the beginning and 472.9 MB in the end (delta: 165.7 MB). Free memory was 217.7 MB in the beginning and 407.1 MB in the end (delta: -189.4 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. [2018-04-06 19:15:15,356 INFO L168 Benchmark]: TraceAbstraction took 244872.08 ms. Allocated memory was 472.9 MB in the beginning and 535.8 MB in the end (delta: 62.9 MB). Free memory was 407.1 MB in the beginning and 402.6 MB in the end (delta: 4.4 MB). Peak memory consumption was 249.6 MB. Max. memory is 5.3 GB. [2018-04-06 19:15:15,357 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.19 ms. Allocated memory is still 307.2 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 349.99 ms. Allocated memory is still 307.2 MB. Free memory was 244.6 MB in the beginning and 220.7 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 53.50 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 599.06 ms. Allocated memory was 307.2 MB in the beginning and 472.9 MB in the end (delta: 165.7 MB). Free memory was 217.7 MB in the beginning and 407.1 MB in the end (delta: -189.4 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 244872.08 ms. Allocated memory was 472.9 MB in the beginning and 535.8 MB in the end (delta: 62.9 MB). Free memory was 407.1 MB in the beginning and 402.6 MB in the end (delta: 4.4 MB). Peak memory consumption was 249.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 246 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 246 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 246 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 246 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 246 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 246 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 246 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 558]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 558). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 246 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and interpolant automaton (currently 246 states, 103 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 91 locations, 9 error locations. TIMEOUT Result, 244.8s OverallTime, 29 OverallIterations, 8 TraceHistogramMax, 204.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2258 SDtfs, 20106 SDslu, 45211 SDs, 0 SdLazy, 48801 SolverSat, 4010 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5829 GetRequests, 2761 SyntacticMatches, 17 SemanticMatches, 3050 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 205988 ImplicationChecksByTransitivity, 210.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=428occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 2458 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 38.2s InterpolantComputationTime, 1950 NumberOfCodeBlocks, 1950 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3842 ConstructedInterpolants, 309 QuantifiedInterpolants, 4964817 SizeOfPredicates, 783 NumberOfNonLiveVariables, 5620 ConjunctsInSsa, 1492 ConjunctsInUnsatCore, 58 InterpolantComputations, 27 PerfectInterpolantSequences, 17/2408 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-06_19-15-15-363.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-06_19-15-15-363.csv Completed graceful shutdown