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 --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 03:44:43,875 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 03:44:43,877 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 03:44:43,889 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 03:44:43,889 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 03:44:43,889 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 03:44:43,890 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 03:44:43,892 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 03:44:43,893 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 03:44:43,894 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 03:44:43,894 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 03:44:43,895 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 03:44:43,895 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 03:44:43,896 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 03:44:43,897 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 03:44:43,898 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 03:44:43,900 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 03:44:43,901 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 03:44:43,902 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 03:44:43,903 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 03:44:43,904 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 03:44:43,905 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 03:44:43,905 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 03:44:43,906 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 03:44:43,906 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 03:44:43,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 03:44:43,907 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 03:44:43,908 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 03:44:43,908 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 03:44:43,909 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 03:44:43,909 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 03:44:43,909 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-13 03:44:43,920 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 03:44:43,920 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 03:44:43,921 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 03:44:43,921 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 03:44:43,921 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 03:44:43,921 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 03:44:43,922 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 03:44:43,922 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 03:44:43,922 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 03:44:43,922 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 03:44:43,922 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 03:44:43,922 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 03:44:43,923 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 03:44:43,923 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 03:44:43,923 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 03:44:43,923 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 03:44:43,923 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 03:44:43,923 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 03:44:43,923 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 03:44:43,924 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 03:44:43,924 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 03:44:43,924 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 03:44:43,924 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 03:44:43,924 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 03:44:43,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 03:44:43,965 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 03:44:43,968 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 03:44:43,969 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 03:44:43,970 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 03:44:43,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,243 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd7134f608 [2018-04-13 03:44:44,361 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 03:44:44,361 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 03:44:44,361 INFO L168 CDTParser]: Scanning cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,370 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 03:44:44,370 INFO L215 ultiparseSymbolTable]: [2018-04-13 03:44:44,370 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 03:44:44,370 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,371 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,371 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,371 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,371 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 03:44:44,371 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,371 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,371 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,371 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,371 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__ushort in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,371 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,372 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,372 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,372 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,372 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,372 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,372 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,372 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,372 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,372 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,373 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,373 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,373 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,373 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,373 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,373 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,373 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____u_int in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,373 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____key_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,373 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,373 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,373 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__u_char in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,374 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,374 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,374 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,374 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,374 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,374 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,374 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,374 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,374 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,375 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,375 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,375 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,375 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____u_char in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,375 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,375 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,375 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,375 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____id_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,375 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,375 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,375 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,376 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,376 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,376 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__id_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,376 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,376 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,376 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,376 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,376 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,376 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,376 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__uint in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,377 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,377 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,377 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,377 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,377 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,377 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,377 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,377 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____off_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,377 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,377 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,377 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__size_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,378 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____time_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,378 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,378 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,378 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__key_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,378 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,378 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,378 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,378 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,378 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__u_int in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,378 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,378 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,379 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__div_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,379 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__off_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,379 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,379 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,379 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__time_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,379 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,379 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,379 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,379 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,379 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,379 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,380 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__register_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,380 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,380 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,380 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,380 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,380 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,380 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,380 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,380 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,380 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,380 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,380 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,380 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,380 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,381 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,381 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,381 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____u_long in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,381 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,381 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__u_short in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,381 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,381 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,381 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,381 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,381 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,381 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,381 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,381 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____u_short in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,381 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,381 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__ulong in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,381 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,381 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i__u_long in cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:44,395 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd7134f608 [2018-04-13 03:44:44,399 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 03:44:44,400 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 03:44:44,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 03:44:44,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 03:44:44,406 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 03:44:44,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:44:44" (1/1) ... [2018-04-13 03:44:44,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfb42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:44:44, skipping insertion in model container [2018-04-13 03:44:44,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:44:44" (1/1) ... [2018-04-13 03:44:44,424 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 03:44:44,446 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 03:44:44,590 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 03:44:44,629 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 03:44:44,634 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-13 03:44:44,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:44:44 WrapperNode [2018-04-13 03:44:44,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 03:44:44,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 03:44:44,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 03:44:44,677 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 03:44:44,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:44:44" (1/1) ... [2018-04-13 03:44:44,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:44:44" (1/1) ... [2018-04-13 03:44:44,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:44:44" (1/1) ... [2018-04-13 03:44:44,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:44:44" (1/1) ... [2018-04-13 03:44:44,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:44:44" (1/1) ... [2018-04-13 03:44:44,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:44:44" (1/1) ... [2018-04-13 03:44:44,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:44:44" (1/1) ... [2018-04-13 03:44:44,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 03:44:44,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 03:44:44,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 03:44:44,719 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 03:44:44,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:44:44" (1/1) ... No working directory specified, using /home/ultimate/work/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-13 03:44:44,811 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 03:44:44,811 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 03:44:44,811 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 03:44:44,811 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 03:44:44,811 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-04-13 03:44:44,811 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 03:44:44,811 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 03:44:44,811 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrcmp_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 03:44:44,811 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 03:44:44,812 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 03:44:44,812 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 03:44:44,812 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 03:44:44,812 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 03:44:44,812 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 03:44:44,812 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 03:44:44,812 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 03:44:44,812 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 03:44:44,812 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 03:44:44,812 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 03:44:44,812 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 03:44:44,813 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 03:44:44,813 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 03:44:44,813 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 03:44:44,813 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 03:44:44,813 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 03:44:44,813 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 03:44:44,813 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 03:44:44,813 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 03:44:44,813 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 03:44:44,814 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 03:44:44,814 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 03:44:44,814 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 03:44:44,814 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 03:44:44,814 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 03:44:44,814 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 03:44:44,814 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 03:44:44,814 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 03:44:44,815 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 03:44:44,815 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 03:44:44,815 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 03:44:44,815 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 03:44:44,815 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 03:44:44,815 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 03:44:44,815 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 03:44:44,815 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 03:44:44,815 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 03:44:44,815 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 03:44:44,816 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 03:44:44,816 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 03:44:44,816 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 03:44:44,816 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 03:44:44,816 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 03:44:44,816 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 03:44:44,816 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 03:44:44,816 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 03:44:44,816 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 03:44:44,816 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 03:44:44,817 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 03:44:44,817 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 03:44:44,817 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 03:44:44,817 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 03:44:44,817 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 03:44:44,817 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 03:44:44,817 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 03:44:44,817 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 03:44:44,817 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 03:44:44,817 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 03:44:44,818 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 03:44:44,818 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 03:44:44,818 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 03:44:44,818 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 03:44:44,818 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 03:44:44,818 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 03:44:44,818 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 03:44:44,818 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 03:44:44,818 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 03:44:44,818 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 03:44:44,819 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 03:44:44,819 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 03:44:44,819 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 03:44:44,819 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 03:44:44,819 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 03:44:44,819 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 03:44:44,819 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 03:44:44,819 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 03:44:44,819 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 03:44:44,819 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 03:44:44,820 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 03:44:44,820 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 03:44:44,820 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 03:44:44,820 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 03:44:44,820 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 03:44:44,820 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 03:44:44,820 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 03:44:44,820 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 03:44:44,820 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 03:44:44,820 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 03:44:44,821 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 03:44:44,821 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 03:44:44,821 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 03:44:44,821 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 03:44:44,821 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 03:44:44,821 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 03:44:44,821 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 03:44:44,821 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 03:44:44,821 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 03:44:44,821 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 03:44:44,821 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 03:44:44,822 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 03:44:44,822 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-04-13 03:44:44,822 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 03:44:44,822 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 03:44:44,822 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 03:44:44,822 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 03:44:44,822 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 03:44:44,822 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 03:44:44,822 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 03:44:44,822 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 03:44:45,092 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 03:44:45,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:44:45 BoogieIcfgContainer [2018-04-13 03:44:45,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 03:44:45,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 03:44:45,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 03:44:45,095 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 03:44:45,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 03:44:44" (1/3) ... [2018-04-13 03:44:45,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b399f43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:44:45, skipping insertion in model container [2018-04-13 03:44:45,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:44:44" (2/3) ... [2018-04-13 03:44:45,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b399f43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:44:45, skipping insertion in model container [2018-04-13 03:44:45,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:44:45" (3/3) ... [2018-04-13 03:44:45,097 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:44:45,102 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 03:44:45,107 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-13 03:44:45,136 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 03:44:45,136 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 03:44:45,136 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 03:44:45,136 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 03:44:45,136 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 03:44:45,136 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 03:44:45,136 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 03:44:45,136 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 03:44:45,137 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 03:44:45,137 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 03:44:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-04-13 03:44:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 03:44:45,149 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:45,150 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:44:45,150 INFO L408 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:45,153 INFO L82 PathProgramCache]: Analyzing trace with hash 900692356, now seen corresponding path program 1 times [2018-04-13 03:44:45,154 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:45,154 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:45,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:45,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:45,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:45,224 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:45,238 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:44:45,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:44:45,238 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:44:45,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:45,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:44:45,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-13 03:44:45,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:45,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:45,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 03:44:45,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:45,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:45,328 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-13 03:44:45,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:45,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:44:45,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-13 03:44:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:44:45,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:44:45,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:44:45,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:44:45,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:44:45,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:44:45,383 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 5 states. [2018-04-13 03:44:45,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:45,474 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-04-13 03:44:45,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:44:45,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-04-13 03:44:45,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:45,480 INFO L225 Difference]: With dead ends: 55 [2018-04-13 03:44:45,480 INFO L226 Difference]: Without dead ends: 52 [2018-04-13 03:44:45,481 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-13 03:44:45,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-13 03:44:45,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-13 03:44:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-13 03:44:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-04-13 03:44:45,502 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 13 [2018-04-13 03:44:45,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:45,502 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-04-13 03:44:45,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:44:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-04-13 03:44:45,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 03:44:45,503 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:45,503 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:44:45,503 INFO L408 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:45,503 INFO L82 PathProgramCache]: Analyzing trace with hash 900692357, now seen corresponding path program 1 times [2018-04-13 03:44:45,503 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:45,503 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:45,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:45,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:45,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:45,511 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:45,514 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:44:45,514 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:44:45,514 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:44:45,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:45,534 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:44:45,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:44:45,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:45,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:44:45,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:45,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:45,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:44:45,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:45,573 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-13 03:44:45,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:45,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:45,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:45,610 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-13 03:44:45,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:45,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:45,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 03:44:45,625 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-13 03:44:45,626 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:44:45,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:44:45,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 03:44:45,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 03:44:45,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:44:45,627 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-04-13 03:44:45,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:45,739 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-04-13 03:44:45,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:44:45,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-13 03:44:45,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:45,740 INFO L225 Difference]: With dead ends: 51 [2018-04-13 03:44:45,740 INFO L226 Difference]: Without dead ends: 51 [2018-04-13 03:44:45,741 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-13 03:44:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-13 03:44:45,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-13 03:44:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-13 03:44:45,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-04-13 03:44:45,746 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 13 [2018-04-13 03:44:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:45,746 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-04-13 03:44:45,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 03:44:45,746 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-04-13 03:44:45,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 03:44:45,747 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:45,747 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:44:45,747 INFO L408 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:45,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2143307995, now seen corresponding path program 1 times [2018-04-13 03:44:45,747 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:45,747 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:45,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:45,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:45,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:45,760 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:45,780 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-13 03:44:45,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:44:45,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 03:44:45,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 03:44:45,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 03:44:45,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 03:44:45,781 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 4 states. [2018-04-13 03:44:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:45,832 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-04-13 03:44:45,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 03:44:45,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-13 03:44:45,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:45,833 INFO L225 Difference]: With dead ends: 50 [2018-04-13 03:44:45,833 INFO L226 Difference]: Without dead ends: 50 [2018-04-13 03:44:45,833 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-13 03:44:45,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-13 03:44:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-13 03:44:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-13 03:44:45,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-04-13 03:44:45,836 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 14 [2018-04-13 03:44:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:45,836 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-04-13 03:44:45,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 03:44:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-04-13 03:44:45,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 03:44:45,837 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:45,837 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:44:45,837 INFO L408 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:45,837 INFO L82 PathProgramCache]: Analyzing trace with hash -2143307994, now seen corresponding path program 1 times [2018-04-13 03:44:45,837 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:45,837 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:45,838 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:45,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:45,838 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:45,847 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:45,871 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-13 03:44:45,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:44:45,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:44:45,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:44:45,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:44:45,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:44:45,872 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-04-13 03:44:45,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:45,904 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-04-13 03:44:45,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:44:45,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-13 03:44:45,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:45,905 INFO L225 Difference]: With dead ends: 49 [2018-04-13 03:44:45,905 INFO L226 Difference]: Without dead ends: 49 [2018-04-13 03:44:45,905 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:44:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-13 03:44:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-13 03:44:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-13 03:44:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-04-13 03:44:45,907 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 14 [2018-04-13 03:44:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:45,908 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-04-13 03:44:45,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:44:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-04-13 03:44:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 03:44:45,908 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:45,908 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:44:45,908 INFO L408 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:45,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1571754480, now seen corresponding path program 1 times [2018-04-13 03:44:45,908 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:45,908 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:45,909 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:45,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:45,909 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:45,919 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:45,941 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-13 03:44:45,941 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:44:45,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:44:45,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:44:45,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:44:45,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:44:45,942 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2018-04-13 03:44:45,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:45,982 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-04-13 03:44:45,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:44:45,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-13 03:44:45,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:45,983 INFO L225 Difference]: With dead ends: 46 [2018-04-13 03:44:45,983 INFO L226 Difference]: Without dead ends: 46 [2018-04-13 03:44:45,983 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:44:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-04-13 03:44:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-04-13 03:44:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-13 03:44:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-04-13 03:44:45,985 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 18 [2018-04-13 03:44:45,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:45,985 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-04-13 03:44:45,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:44:45,985 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-04-13 03:44:45,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 03:44:45,986 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:45,986 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:44:45,986 INFO L408 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:45,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1571754481, now seen corresponding path program 1 times [2018-04-13 03:44:45,986 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:45,986 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:45,987 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:45,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:45,987 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:45,996 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:46,059 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-13 03:44:46,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:44:46,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 03:44:46,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 03:44:46,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 03:44:46,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-13 03:44:46,061 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 8 states. [2018-04-13 03:44:46,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:46,152 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-04-13 03:44:46,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 03:44:46,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-13 03:44:46,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:46,154 INFO L225 Difference]: With dead ends: 66 [2018-04-13 03:44:46,154 INFO L226 Difference]: Without dead ends: 66 [2018-04-13 03:44:46,155 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-04-13 03:44:46,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-13 03:44:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2018-04-13 03:44:46,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-13 03:44:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-04-13 03:44:46,157 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 18 [2018-04-13 03:44:46,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:46,157 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-04-13 03:44:46,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 03:44:46,157 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-04-13 03:44:46,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 03:44:46,158 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:46,158 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] [2018-04-13 03:44:46,158 INFO L408 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:46,158 INFO L82 PathProgramCache]: Analyzing trace with hash -353712010, now seen corresponding path program 1 times [2018-04-13 03:44:46,158 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:46,158 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:46,159 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:46,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:46,159 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:46,166 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:46,203 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-13 03:44:46,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:44:46,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:44:46,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:44:46,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:44:46,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:44:46,204 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 5 states. [2018-04-13 03:44:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:46,247 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-04-13 03:44:46,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:44:46,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-13 03:44:46,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:46,248 INFO L225 Difference]: With dead ends: 53 [2018-04-13 03:44:46,248 INFO L226 Difference]: Without dead ends: 53 [2018-04-13 03:44:46,249 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:44:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-13 03:44:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-04-13 03:44:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-13 03:44:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-04-13 03:44:46,252 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 22 [2018-04-13 03:44:46,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:46,252 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-04-13 03:44:46,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:44:46,252 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-04-13 03:44:46,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 03:44:46,253 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:46,253 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] [2018-04-13 03:44:46,253 INFO L408 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:46,253 INFO L82 PathProgramCache]: Analyzing trace with hash -353712009, now seen corresponding path program 1 times [2018-04-13 03:44:46,253 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:46,253 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:46,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:46,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:46,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:46,264 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:46,338 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-13 03:44:46,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:44:46,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 03:44:46,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 03:44:46,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 03:44:46,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-13 03:44:46,339 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2018-04-13 03:44:46,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:46,410 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-04-13 03:44:46,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 03:44:46,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-04-13 03:44:46,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:46,411 INFO L225 Difference]: With dead ends: 60 [2018-04-13 03:44:46,411 INFO L226 Difference]: Without dead ends: 60 [2018-04-13 03:44:46,411 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-13 03:44:46,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-13 03:44:46,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-04-13 03:44:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-13 03:44:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-04-13 03:44:46,413 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 22 [2018-04-13 03:44:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:46,413 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-04-13 03:44:46,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 03:44:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-04-13 03:44:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 03:44:46,414 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:46,414 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] [2018-04-13 03:44:46,414 INFO L408 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:46,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1920110756, now seen corresponding path program 1 times [2018-04-13 03:44:46,414 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:46,414 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:46,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:46,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:46,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:46,422 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:46,448 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-13 03:44:46,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:44:46,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 03:44:46,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 03:44:46,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 03:44:46,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 03:44:46,450 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 3 states. [2018-04-13 03:44:46,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:46,460 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-04-13 03:44:46,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 03:44:46,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-04-13 03:44:46,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:46,461 INFO L225 Difference]: With dead ends: 57 [2018-04-13 03:44:46,461 INFO L226 Difference]: Without dead ends: 57 [2018-04-13 03:44:46,461 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 03:44:46,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-13 03:44:46,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-04-13 03:44:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-13 03:44:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-04-13 03:44:46,464 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 23 [2018-04-13 03:44:46,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:46,465 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-04-13 03:44:46,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 03:44:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-04-13 03:44:46,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 03:44:46,465 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:46,465 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] [2018-04-13 03:44:46,466 INFO L408 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:46,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1858113249, now seen corresponding path program 1 times [2018-04-13 03:44:46,466 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:46,466 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:46,467 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:46,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:46,467 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:46,480 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:46,484 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:44:46,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:44:46,484 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:44:46,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:46,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:44:46,528 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-13 03:44:46,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 03:44:46,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:46,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:46,548 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-13 03:44:46,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-13 03:44:46,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:44:46,575 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-13 03:44:46,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,583 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-13 03:44:46,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-13 03:44:46,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-13 03:44:46,605 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-13 03:44:46,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-13 03:44:46,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:36 [2018-04-13 03:44:46,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-13 03:44:46,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-13 03:44:46,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,675 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 03:44:46,675 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 0 case distinctions, treesize of input 14 treesize of output 10 [2018-04-13 03:44:46,676 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,684 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2018-04-13 03:44:46,702 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-13 03:44:46,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:44:46,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-13 03:44:46,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 03:44:46,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 03:44:46,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-04-13 03:44:46,703 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 13 states. [2018-04-13 03:44:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:47,054 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-04-13 03:44:47,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 03:44:47,054 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-04-13 03:44:47,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:47,055 INFO L225 Difference]: With dead ends: 86 [2018-04-13 03:44:47,055 INFO L226 Difference]: Without dead ends: 86 [2018-04-13 03:44:47,056 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:44:47,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-13 03:44:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2018-04-13 03:44:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-13 03:44:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-04-13 03:44:47,060 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 26 [2018-04-13 03:44:47,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:47,061 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-04-13 03:44:47,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 03:44:47,061 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-04-13 03:44:47,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 03:44:47,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:47,062 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] [2018-04-13 03:44:47,062 INFO L408 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1040464799, now seen corresponding path program 1 times [2018-04-13 03:44:47,063 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:47,063 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:47,063 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:47,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:47,063 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:47,080 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:47,084 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:44:47,084 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:44:47,084 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:44:47,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:47,109 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:44:47,172 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-13 03:44:47,174 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-13 03:44:47,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:47,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:47,180 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-13 03:44:47,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-04-13 03:44:47,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-04-13 03:44:47,321 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 03:44:47,321 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-13 03:44:47,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:47,335 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 03:44:47,336 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 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-13 03:44:47,336 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:47,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-04-13 03:44:47,370 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:47,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:44:47,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:47,390 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:50, output treesize:8 [2018-04-13 03:44:47,412 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-13 03:44:47,412 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:44:47,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-04-13 03:44:47,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 03:44:47,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 03:44:47,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-04-13 03:44:47,413 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 14 states. [2018-04-13 03:44:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:47,863 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2018-04-13 03:44:47,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 03:44:47,863 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-04-13 03:44:47,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:47,864 INFO L225 Difference]: With dead ends: 140 [2018-04-13 03:44:47,864 INFO L226 Difference]: Without dead ends: 140 [2018-04-13 03:44:47,864 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2018-04-13 03:44:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-13 03:44:47,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 103. [2018-04-13 03:44:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-13 03:44:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-04-13 03:44:47,868 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 26 [2018-04-13 03:44:47,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:47,869 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-04-13 03:44:47,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 03:44:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-04-13 03:44:47,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 03:44:47,869 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:47,870 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] [2018-04-13 03:44:47,870 INFO L408 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:47,870 INFO L82 PathProgramCache]: Analyzing trace with hash -648478943, now seen corresponding path program 1 times [2018-04-13 03:44:47,870 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:47,870 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:47,871 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:47,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:47,871 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:47,881 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:47,886 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:44:47,886 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:44:47,886 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:44:47,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:47,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:44:47,918 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-13 03:44:47,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:47,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:44:47,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:47,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:47,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:44:47,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:47,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:47,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 03:44:47,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:47,955 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-13 03:44:47,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:47,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:47,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 03:44:47,980 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 16 treesize of output 13 [2018-04-13 03:44:47,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 03:44:47,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:47,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:47,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:47,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-13 03:44:48,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 03:44:48,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 03:44:48,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:48,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:48,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 03:44:48,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-04-13 03:44:48,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-04-13 03:44:48,085 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-13 03:44:48,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:44:48,096 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 10 treesize of output 1 [2018-04-13 03:44:48,097 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:48,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:44:48,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:44:48,109 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:54 [2018-04-13 03:44:48,205 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-13 03:44:48,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:44:48,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 03:44:48,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 03:44:48,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 03:44:48,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-04-13 03:44:48,207 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 14 states. [2018-04-13 03:44:49,658 WARN L151 SmtUtils]: Spent 1123ms on a formula simplification. DAG size of input: 52 DAG size of output 47 [2018-04-13 03:44:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:49,922 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2018-04-13 03:44:49,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 03:44:49,923 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-04-13 03:44:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:49,924 INFO L225 Difference]: With dead ends: 144 [2018-04-13 03:44:49,924 INFO L226 Difference]: Without dead ends: 144 [2018-04-13 03:44:49,924 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-04-13 03:44:49,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-13 03:44:49,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 113. [2018-04-13 03:44:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-13 03:44:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-04-13 03:44:49,929 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 26 [2018-04-13 03:44:49,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:49,929 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-04-13 03:44:49,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 03:44:49,930 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-04-13 03:44:49,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 03:44:49,930 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:49,930 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:44:49,931 INFO L408 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:49,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2021301671, now seen corresponding path program 1 times [2018-04-13 03:44:49,931 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:49,931 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:49,932 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:49,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:49,932 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:49,941 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:44:50,081 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:44:50,081 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:44:50,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:50,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:44:50,112 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-13 03:44:50,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:50,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:50,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 03:44:50,152 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 16 treesize of output 13 [2018-04-13 03:44:50,154 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 13 treesize of output 12 [2018-04-13 03:44:50,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:50,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:50,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:50,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-13 03:44:50,322 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 35 treesize of output 35 [2018-04-13 03:44:50,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-04-13 03:44:50,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:50,341 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 24 treesize of output 22 [2018-04-13 03:44:50,342 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 03:44:50,364 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 35 [2018-04-13 03:44:50,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-04-13 03:44:50,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 03:44:50,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-13 03:44:50,421 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:107 [2018-04-13 03:44:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:44:50,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:44:50,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2018-04-13 03:44:50,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 03:44:50,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 03:44:50,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-04-13 03:44:50,531 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 27 states. [2018-04-13 03:44:51,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:51,342 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2018-04-13 03:44:51,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 03:44:51,343 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 30 [2018-04-13 03:44:51,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:51,343 INFO L225 Difference]: With dead ends: 142 [2018-04-13 03:44:51,343 INFO L226 Difference]: Without dead ends: 142 [2018-04-13 03:44:51,344 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=1400, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 03:44:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-13 03:44:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 111. [2018-04-13 03:44:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-13 03:44:51,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2018-04-13 03:44:51,347 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 30 [2018-04-13 03:44:51,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:51,347 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2018-04-13 03:44:51,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 03:44:51,347 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2018-04-13 03:44:51,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 03:44:51,348 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:51,348 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:44:51,348 INFO L408 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:51,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1493322769, now seen corresponding path program 2 times [2018-04-13 03:44:51,348 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:51,348 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:51,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:51,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:51,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:51,355 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:51,358 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:44:51,359 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:44:51,359 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:44:51,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:44:51,400 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:44:51,400 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:44:51,404 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:44:51,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:44:51,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:51,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 03:44:51,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:51,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:51,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:44:51,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:51,446 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-13 03:44:51,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:51,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:51,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:51,455 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-13 03:44:51,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:51,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:51,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 03:44:51,480 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 16 treesize of output 13 [2018-04-13 03:44:51,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 03:44:51,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:51,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:51,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:51,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-04-13 03:44:51,505 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 29 treesize of output 30 [2018-04-13 03:44:51,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 13 treesize of output 12 [2018-04-13 03:44:51,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:51,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:51,518 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-13 03:44:51,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-13 03:44:51,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-04-13 03:44:51,633 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 10 treesize of output 1 [2018-04-13 03:44:51,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:51,644 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 15 treesize of output 12 [2018-04-13 03:44:51,645 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 03:44:51,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:44:51,658 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-13 03:44:51,658 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:53, output treesize:40 [2018-04-13 03:44:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:44:51,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:44:51,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 03:44:51,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 03:44:51,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 03:44:51,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-04-13 03:44:51,770 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 17 states. [2018-04-13 03:44:52,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:52,424 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2018-04-13 03:44:52,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 03:44:52,424 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-04-13 03:44:52,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:52,425 INFO L225 Difference]: With dead ends: 152 [2018-04-13 03:44:52,425 INFO L226 Difference]: Without dead ends: 152 [2018-04-13 03:44:52,426 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:44:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-13 03:44:52,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 121. [2018-04-13 03:44:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-13 03:44:52,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2018-04-13 03:44:52,430 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 34 [2018-04-13 03:44:52,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:52,430 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2018-04-13 03:44:52,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 03:44:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2018-04-13 03:44:52,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 03:44:52,431 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:52,431 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] [2018-04-13 03:44:52,431 INFO L408 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:52,431 INFO L82 PathProgramCache]: Analyzing trace with hash -470374570, now seen corresponding path program 1 times [2018-04-13 03:44:52,431 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:52,431 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:52,432 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:52,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:44:52,439 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:52,451 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:52,453 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:44:52,454 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:44:52,454 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:44:52,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:52,473 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:44:52,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:52,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-13 03:44:52,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:52,514 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-13 03:44:52,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:52,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:52,523 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-13 03:44:52,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-13 03:44:52,547 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-13 03:44:52,552 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-13 03:44:52,556 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-13 03:44:52,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:44:52,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 03:44:52,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 03:44:52,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 03:44:52,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-13 03:44:52,557 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand 8 states. [2018-04-13 03:44:52,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:52,623 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2018-04-13 03:44:52,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 03:44:52,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-04-13 03:44:52,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:52,624 INFO L225 Difference]: With dead ends: 120 [2018-04-13 03:44:52,624 INFO L226 Difference]: Without dead ends: 59 [2018-04-13 03:44:52,624 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-13 03:44:52,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-13 03:44:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-04-13 03:44:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-04-13 03:44:52,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-04-13 03:44:52,625 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 35 [2018-04-13 03:44:52,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:52,625 INFO L459 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-04-13 03:44:52,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 03:44:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-04-13 03:44:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 03:44:52,626 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:52,626 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:44:52,626 INFO L408 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:52,626 INFO L82 PathProgramCache]: Analyzing trace with hash 936637079, now seen corresponding path program 2 times [2018-04-13 03:44:52,626 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:52,626 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:52,630 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:52,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:52,630 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:52,639 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:44:52,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:44:52,894 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:44:52,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:44:52,918 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:44:52,919 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:44:52,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:44:52,926 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-13 03:44:52,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:52,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:52,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 03:44:52,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 03:44:52,948 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 13 treesize of output 12 [2018-04-13 03:44:52,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:52,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:52,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:52,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-13 03:44:53,124 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 34 treesize of output 34 [2018-04-13 03:44:53,134 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2018-04-13 03:44:53,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-13 03:44:53,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2018-04-13 03:44:53,165 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 03:44:53,188 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 24 treesize of output 17 [2018-04-13 03:44:53,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:53,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-04-13 03:44:53,189 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:53,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 03:44:53,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-13 03:44:53,232 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:47, output treesize:103 [2018-04-13 03:44:53,331 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:44:53,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:44:53,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2018-04-13 03:44:53,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 03:44:53,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 03:44:53,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:44:53,332 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 28 states. [2018-04-13 03:44:53,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:53,803 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-04-13 03:44:53,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 03:44:53,803 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2018-04-13 03:44:53,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:53,804 INFO L225 Difference]: With dead ends: 61 [2018-04-13 03:44:53,804 INFO L226 Difference]: Without dead ends: 57 [2018-04-13 03:44:53,805 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=1343, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 03:44:53,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-13 03:44:53,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-04-13 03:44:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-13 03:44:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-04-13 03:44:53,806 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 38 [2018-04-13 03:44:53,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:53,807 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-04-13 03:44:53,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 03:44:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-04-13 03:44:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 03:44:53,808 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:53,808 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:44:53,808 INFO L408 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:53,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1892133121, now seen corresponding path program 3 times [2018-04-13 03:44:53,808 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:53,808 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:53,809 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:53,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:44:53,809 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:53,818 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:53,824 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:44:53,824 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:44:53,824 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:44:53,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:44:53,858 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 03:44:53,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:44:53,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:44:53,869 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-13 03:44:53,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:53,875 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-13 03:44:53,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:53,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:53,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:44:53,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:53,890 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-13 03:44:53,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:53,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:53,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:53,898 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-13 03:44:53,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:53,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:53,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 03:44:53,917 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 16 treesize of output 13 [2018-04-13 03:44:53,919 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 13 treesize of output 12 [2018-04-13 03:44:53,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:53,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:53,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:53,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-04-13 03:44:53,938 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 29 treesize of output 30 [2018-04-13 03:44:53,939 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 13 treesize of output 12 [2018-04-13 03:44:53,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:53,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:53,948 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-13 03:44:53,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-04-13 03:44:54,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-04-13 03:44:54,026 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-13 03:44:54,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:54,032 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 15 treesize of output 12 [2018-04-13 03:44:54,033 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 03:44:54,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:44:54,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:44:54,040 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:34 [2018-04-13 03:44:54,114 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:44:54,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:44:54,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 03:44:54,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 03:44:54,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 03:44:54,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-04-13 03:44:54,115 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 16 states. [2018-04-13 03:44:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:54,617 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-04-13 03:44:54,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 03:44:54,617 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-04-13 03:44:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:54,618 INFO L225 Difference]: With dead ends: 71 [2018-04-13 03:44:54,618 INFO L226 Difference]: Without dead ends: 71 [2018-04-13 03:44:54,618 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:44:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-13 03:44:54,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2018-04-13 03:44:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-13 03:44:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-04-13 03:44:54,620 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 42 [2018-04-13 03:44:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:54,620 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-04-13 03:44:54,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 03:44:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-04-13 03:44:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-13 03:44:54,620 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:54,620 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:44:54,620 INFO L408 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:54,620 INFO L82 PathProgramCache]: Analyzing trace with hash 46225287, now seen corresponding path program 3 times [2018-04-13 03:44:54,620 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:54,622 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:54,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:54,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:44:54,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:54,633 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-04-13 03:44:54,808 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:44:54,808 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:44:54,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:44:54,855 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 03:44:54,856 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:44:54,860 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:44:54,896 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-13 03:44:54,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:54,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:54,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 03:44:54,938 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 16 treesize of output 13 [2018-04-13 03:44:54,940 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 13 treesize of output 12 [2018-04-13 03:44:54,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:54,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:54,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:54,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-13 03:44:55,196 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 34 treesize of output 34 [2018-04-13 03:44:55,201 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 30 treesize of output 23 [2018-04-13 03:44:55,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:55,216 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-04-13 03:44:55,217 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:55,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2018-04-13 03:44:55,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-13 03:44:55,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 03:44:55,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-13 03:44:55,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:77 [2018-04-13 03:44:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:44:55,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:44:55,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2018-04-13 03:44:55,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 03:44:55,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 03:44:55,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:44:55,385 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 31 states. [2018-04-13 03:44:57,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:57,223 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-04-13 03:44:57,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-13 03:44:57,224 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 46 [2018-04-13 03:44:57,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:57,224 INFO L225 Difference]: With dead ends: 74 [2018-04-13 03:44:57,224 INFO L226 Difference]: Without dead ends: 63 [2018-04-13 03:44:57,225 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1441 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=788, Invalid=4614, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 03:44:57,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-04-13 03:44:57,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-04-13 03:44:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-04-13 03:44:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-04-13 03:44:57,227 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 46 [2018-04-13 03:44:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:57,227 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-04-13 03:44:57,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 03:44:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-04-13 03:44:57,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 03:44:57,228 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:57,228 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:44:57,228 INFO L408 AbstractCegarLoop]: === Iteration 19 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:44:57,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1952901647, now seen corresponding path program 4 times [2018-04-13 03:44:57,228 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:57,228 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:57,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:57,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:44:57,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:57,239 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:57,244 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:44:57,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:44:57,244 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:44:57,245 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:44:57,274 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:44:57,274 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:44:57,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:44:57,293 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-13 03:44:57,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:57,311 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-13 03:44:57,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:57,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:57,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:44:57,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:57,326 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-13 03:44:57,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:57,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:57,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:44:57,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-13 03:44:57,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:57,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:57,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 03:44:57,354 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-13 03:44:57,355 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-13 03:44:57,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:57,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:57,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:57,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-13 03:44:57,381 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 28 treesize of output 29 [2018-04-13 03:44:57,382 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 13 treesize of output 12 [2018-04-13 03:44:57,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:57,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:57,391 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-13 03:44:57,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-13 03:44:57,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-04-13 03:44:57,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 03:44:57,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:57,585 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 15 treesize of output 12 [2018-04-13 03:44:57,586 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 03:44:57,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:44:57,597 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-13 03:44:57,597 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-04-13 03:44:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 24 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:44:57,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:44:57,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 03:44:57,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 03:44:57,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 03:44:57,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-04-13 03:44:57,700 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 18 states. [2018-04-13 03:44:58,419 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 58 DAG size of output 49 [2018-04-13 03:44:58,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:58,582 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-04-13 03:44:58,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 03:44:58,583 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2018-04-13 03:44:58,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:58,583 INFO L225 Difference]: With dead ends: 59 [2018-04-13 03:44:58,583 INFO L226 Difference]: Without dead ends: 0 [2018-04-13 03:44:58,583 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 03:44:58,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-13 03:44:58,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-13 03:44:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-13 03:44:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-13 03:44:58,584 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-04-13 03:44:58,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:58,584 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-13 03:44:58,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 03:44:58,584 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-13 03:44:58,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-13 03:44:58,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 03:44:58 BoogieIcfgContainer [2018-04-13 03:44:58,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 03:44:58,587 INFO L168 Benchmark]: Toolchain (without parser) took 14187.98 ms. Allocated memory was 402.7 MB in the beginning and 805.8 MB in the end (delta: 403.2 MB). Free memory was 338.8 MB in the beginning and 733.4 MB in the end (delta: -394.5 MB). Peak memory consumption was 8.6 MB. Max. memory is 5.3 GB. [2018-04-13 03:44:58,588 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 402.7 MB. Free memory is still 364.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 03:44:58,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.35 ms. Allocated memory is still 402.7 MB. Free memory was 338.8 MB in the beginning and 313.7 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-13 03:44:58,589 INFO L168 Benchmark]: Boogie Preprocessor took 42.09 ms. Allocated memory is still 402.7 MB. Free memory was 313.7 MB in the beginning and 312.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-13 03:44:58,589 INFO L168 Benchmark]: RCFGBuilder took 373.95 ms. Allocated memory was 402.7 MB in the beginning and 612.9 MB in the end (delta: 210.2 MB). Free memory was 312.4 MB in the beginning and 546.6 MB in the end (delta: -234.2 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-13 03:44:58,589 INFO L168 Benchmark]: TraceAbstraction took 13493.53 ms. Allocated memory was 612.9 MB in the beginning and 805.8 MB in the end (delta: 192.9 MB). Free memory was 546.6 MB in the beginning and 733.4 MB in the end (delta: -186.7 MB). Peak memory consumption was 6.2 MB. Max. memory is 5.3 GB. [2018-04-13 03:44:58,590 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.16 ms. Allocated memory is still 402.7 MB. Free memory is still 364.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 275.35 ms. Allocated memory is still 402.7 MB. Free memory was 338.8 MB in the beginning and 313.7 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.09 ms. Allocated memory is still 402.7 MB. Free memory was 313.7 MB in the beginning and 312.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 373.95 ms. Allocated memory was 402.7 MB in the beginning and 612.9 MB in the end (delta: 210.2 MB). Free memory was 312.4 MB in the beginning and 546.6 MB in the end (delta: -234.2 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 13493.53 ms. Allocated memory was 612.9 MB in the beginning and 805.8 MB in the end (delta: 192.9 MB). Free memory was 546.6 MB in the beginning and 733.4 MB in the end (delta: -186.7 MB). Peak memory consumption was 6.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 562]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 562]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 15 error locations. SAFE Result, 13.4s OverallTime, 19 OverallIterations, 5 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 718 SDtfs, 1596 SDslu, 3522 SDs, 0 SdLazy, 4033 SolverSat, 297 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 602 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 357 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2597 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=14, 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.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 159 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 889 NumberOfCodeBlocks, 888 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 602 ConstructedInterpolants, 106 QuantifiedInterpolants, 294261 SizeOfPredicates, 124 NumberOfNonLiveVariables, 1661 ConjunctsInSsa, 375 ConjunctsInUnsatCore, 22 InterpolantComputations, 12 PerfectInterpolantSequences, 38/242 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_03-44-58-594.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_03-44-58-594.csv Received shutdown request...