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_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 13:02:23,227 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 13:02:23,228 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 13:02:23,241 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 13:02:23,242 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 13:02:23,243 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 13:02:23,243 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 13:02:23,245 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 13:02:23,246 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 13:02:23,247 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 13:02:23,248 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 13:02:23,248 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 13:02:23,249 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 13:02:23,250 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 13:02:23,250 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 13:02:23,252 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 13:02:23,253 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 13:02:23,255 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 13:02:23,256 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 13:02:23,257 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 13:02:23,258 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 13:02:23,259 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 13:02:23,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 13:02:23,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 13:02:23,260 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 13:02:23,261 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 13:02:23,261 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 13:02:23,262 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 13:02:23,263 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 13:02:23,263 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 13:02:23,263 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 13:02:23,263 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_Array.epf [2018-04-11 13:02:23,287 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 13:02:23,287 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 13:02:23,288 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 13:02:23,288 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 13:02:23,288 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 13:02:23,288 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 13:02:23,289 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 13:02:23,289 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 13:02:23,289 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 13:02:23,289 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 13:02:23,289 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 13:02:23,289 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 13:02:23,289 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 13:02:23,290 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 13:02:23,290 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 13:02:23,290 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 13:02:23,290 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 13:02:23,290 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 13:02:23,290 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 13:02:23,290 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 13:02:23,291 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 13:02:23,291 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 13:02:23,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 13:02:23,332 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 13:02:23,336 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 13:02:23,337 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 13:02:23,337 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 13:02:23,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,720 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe0d407c44 [2018-04-11 13:02:23,852 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 13:02:23,852 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 13:02:23,853 INFO L168 CDTParser]: Scanning subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,860 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 13:02:23,860 INFO L215 ultiparseSymbolTable]: [2018-04-11 13:02:23,861 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 13:02:23,861 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,861 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,861 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,861 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ ('') in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,861 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 13:02:23,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____intptr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____ssize_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____timer_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____mode_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__int32_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____u_short in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____socklen_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__key_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__size_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__off_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____int32_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____rlim_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____rlim64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_int in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__register_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_int64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ldiv_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ino_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____time_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__int8_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____u_char in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____suseconds_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____caddr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____dev_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____qaddr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__int16_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__lldiv_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__wchar_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____blksize_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__blksize_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__uid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____uint32_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____int8_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_char in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____u_long in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____int16_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__div_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__caddr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__mode_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__fd_set in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____sigset_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__gid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_short in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ulong in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_long in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____ino_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____ino64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____u_quad_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____pid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____off_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____gid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__clock_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____uint16_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____loff_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__suseconds_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__quad_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_int16_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__daddr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__fsid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____key_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____clockid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____daddr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____clock_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____useconds_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__int64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____quad_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_quad_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ushort in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____uint8_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____off64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__loff_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____int64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_int32_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____id_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fd_mask in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____u_int in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__u_int8_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__time_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____nlink_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__clockid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__timer_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__dev_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__sigset_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__id_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____uint64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__fd_mask in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____fsword_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__ssize_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____uid_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__nlink_t in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i__uint in subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:23,885 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe0d407c44 [2018-04-11 13:02:23,889 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 13:02:23,890 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 13:02:23,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 13:02:23,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 13:02:23,895 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 13:02:23,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 01:02:23" (1/1) ... [2018-04-11 13:02:23,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261be6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:02:23, skipping insertion in model container [2018-04-11 13:02:23,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 01:02:23" (1/1) ... [2018-04-11 13:02:23,908 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 13:02:23,926 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 13:02:24,055 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 13:02:24,087 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 13:02:24,093 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 13:02:24,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:02:24 WrapperNode [2018-04-11 13:02:24,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 13:02:24,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 13:02:24,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 13:02:24,128 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 13:02:24,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:02:24" (1/1) ... [2018-04-11 13:02:24,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:02:24" (1/1) ... [2018-04-11 13:02:24,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:02:24" (1/1) ... [2018-04-11 13:02:24,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:02:24" (1/1) ... [2018-04-11 13:02:24,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:02:24" (1/1) ... [2018-04-11 13:02:24,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:02:24" (1/1) ... [2018-04-11 13:02:24,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:02:24" (1/1) ... [2018-04-11 13:02:24,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 13:02:24,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 13:02:24,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 13:02:24,172 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 13:02:24,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:02:24" (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-11 13:02:24,262 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 13:02:24,262 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 13:02:24,262 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 13:02:24,262 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 13:02:24,262 INFO L136 BoogieDeclarations]: Found implementation of procedure subseq [2018-04-11 13:02:24,262 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 13:02:24,262 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 13:02:24,262 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubseq_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 13:02:24,262 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 13:02:24,263 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 13:02:24,263 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 13:02:24,263 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 13:02:24,263 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 13:02:24,263 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 13:02:24,263 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 13:02:24,263 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 13:02:24,263 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 13:02:24,263 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 13:02:24,264 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 13:02:24,264 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 13:02:24,264 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 13:02:24,264 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 13:02:24,264 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 13:02:24,264 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 13:02:24,264 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 13:02:24,264 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 13:02:24,264 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 13:02:24,264 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 13:02:24,264 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 13:02:24,265 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 13:02:24,265 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 13:02:24,265 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 13:02:24,265 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 13:02:24,265 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 13:02:24,265 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 13:02:24,265 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 13:02:24,265 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 13:02:24,265 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 13:02:24,265 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 13:02:24,266 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 13:02:24,266 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 13:02:24,266 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 13:02:24,266 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 13:02:24,266 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 13:02:24,266 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 13:02:24,266 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 13:02:24,266 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 13:02:24,266 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 13:02:24,267 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 13:02:24,267 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 13:02:24,267 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 13:02:24,267 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 13:02:24,267 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 13:02:24,267 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 13:02:24,267 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 13:02:24,267 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 13:02:24,267 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 13:02:24,267 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 13:02:24,267 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 13:02:24,268 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 13:02:24,268 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 13:02:24,268 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 13:02:24,268 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 13:02:24,268 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 13:02:24,268 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 13:02:24,268 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 13:02:24,268 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 13:02:24,268 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 13:02:24,268 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 13:02:24,269 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 13:02:24,269 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 13:02:24,269 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 13:02:24,269 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 13:02:24,269 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 13:02:24,269 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 13:02:24,269 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 13:02:24,269 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 13:02:24,269 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 13:02:24,269 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 13:02:24,269 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 13:02:24,270 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 13:02:24,270 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 13:02:24,270 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 13:02:24,270 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 13:02:24,270 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 13:02:24,270 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 13:02:24,270 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 13:02:24,270 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 13:02:24,270 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 13:02:24,270 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 13:02:24,270 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 13:02:24,270 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 13:02:24,270 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 13:02:24,270 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 13:02:24,271 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 13:02:24,271 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 13:02:24,271 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 13:02:24,271 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 13:02:24,271 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 13:02:24,271 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 13:02:24,271 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 13:02:24,271 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 13:02:24,271 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 13:02:24,271 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 13:02:24,271 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 13:02:24,272 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 13:02:24,272 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 13:02:24,272 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 13:02:24,272 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 13:02:24,272 INFO L128 BoogieDeclarations]: Found specification of procedure subseq [2018-04-11 13:02:24,272 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 13:02:24,272 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 13:02:24,272 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 13:02:24,272 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 13:02:24,272 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 13:02:24,273 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 13:02:24,273 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 13:02:24,273 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 13:02:24,551 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 13:02:24,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 01:02:24 BoogieIcfgContainer [2018-04-11 13:02:24,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 13:02:24,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 13:02:24,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 13:02:24,555 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 13:02:24,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 01:02:23" (1/3) ... [2018-04-11 13:02:24,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123ab360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 01:02:24, skipping insertion in model container [2018-04-11 13:02:24,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:02:24" (2/3) ... [2018-04-11 13:02:24,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123ab360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 01:02:24, skipping insertion in model container [2018-04-11 13:02:24,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 01:02:24" (3/3) ... [2018-04-11 13:02:24,557 INFO L107 eAbstractionObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2018-04-11 13:02:24,563 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 13:02:24,568 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-11 13:02:24,592 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 13:02:24,592 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 13:02:24,592 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 13:02:24,592 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-11 13:02:24,592 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 13:02:24,592 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 13:02:24,592 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 13:02:24,593 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 13:02:24,593 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 13:02:24,593 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 13:02:24,602 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-04-11 13:02:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 13:02:24,609 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:24,609 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:24,609 INFO L408 AbstractCegarLoop]: === Iteration 1 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:24,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1220202854, now seen corresponding path program 1 times [2018-04-11 13:02:24,642 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:24,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:24,752 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:02:24,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:02:24,752 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:24,753 INFO L182 omatonBuilderFactory]: Interpolants [58#true, 59#false, 60#(= 1 (select |#valid| |main_#t~malloc12.base|)), 61#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-04-11 13:02:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:24,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:02:24,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:02:24,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:02:24,762 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-04-11 13:02:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:24,833 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-04-11 13:02:24,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:02:24,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-11 13:02:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:24,843 INFO L225 Difference]: With dead ends: 54 [2018-04-11 13:02:24,843 INFO L226 Difference]: Without dead ends: 51 [2018-04-11 13:02:24,844 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:02:24,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-11 13:02:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-11 13:02:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 13:02:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-11 13:02:24,875 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-04-11 13:02:24,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:24,875 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-11 13:02:24,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:02:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-11 13:02:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 13:02:24,876 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:24,876 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:24,876 INFO L408 AbstractCegarLoop]: === Iteration 2 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:24,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1220202855, now seen corresponding path program 1 times [2018-04-11 13:02:24,877 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:24,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:24,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:02:24,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:02:24,974 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:24,975 INFO L182 omatonBuilderFactory]: Interpolants [169#true, 170#false, 171#(<= 1 main_~length1~0), 172#(and (= main_~length1~0 (select |#length| |main_#t~malloc12.base|)) (= (select |#valid| |main_#t~malloc12.base|) 1) (= 0 |main_#t~malloc12.offset|) (<= 1 main_~length1~0)), 173#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 174#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-04-11 13:02:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:24,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:02:24,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:02:24,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:02:24,977 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 6 states. [2018-04-11 13:02:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:25,022 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-04-11 13:02:25,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:02:25,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-11 13:02:25,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:25,023 INFO L225 Difference]: With dead ends: 50 [2018-04-11 13:02:25,023 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 13:02:25,024 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-11 13:02:25,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 13:02:25,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-11 13:02:25,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 13:02:25,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-11 13:02:25,029 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2018-04-11 13:02:25,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:25,029 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-11 13:02:25,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:02:25,029 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-11 13:02:25,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 13:02:25,029 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:25,030 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:25,030 INFO L408 AbstractCegarLoop]: === Iteration 3 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:25,030 INFO L82 PathProgramCache]: Analyzing trace with hash -828417196, now seen corresponding path program 1 times [2018-04-11 13:02:25,031 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:25,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:25,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-11 13:02:25,059 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:02:25,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:02:25,060 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,060 INFO L182 omatonBuilderFactory]: Interpolants [277#true, 278#false, 279#(= 1 (select |#valid| |main_#t~malloc13.base|)), 280#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-04-11 13:02:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:02:25,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:02:25,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:02:25,061 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 4 states. [2018-04-11 13:02:25,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:25,108 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-04-11 13:02:25,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:02:25,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 13:02:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:25,109 INFO L225 Difference]: With dead ends: 49 [2018-04-11 13:02:25,109 INFO L226 Difference]: Without dead ends: 49 [2018-04-11 13:02:25,110 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-11 13:02:25,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-11 13:02:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-11 13:02:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-11 13:02:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-04-11 13:02:25,113 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-04-11 13:02:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:25,114 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-04-11 13:02:25,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:02:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-04-11 13:02:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 13:02:25,114 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:25,114 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:25,116 INFO L408 AbstractCegarLoop]: === Iteration 4 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:25,116 INFO L82 PathProgramCache]: Analyzing trace with hash -828417195, now seen corresponding path program 1 times [2018-04-11 13:02:25,117 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:25,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:02:25,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:02:25,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,171 INFO L182 omatonBuilderFactory]: Interpolants [384#(and (= main_~length2~0 (select |#length| |main_#t~malloc13.base|)) (<= 1 main_~length2~0) (= 0 |main_#t~malloc13.offset|)), 385#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 381#true, 382#false, 383#(<= 1 main_~length2~0)] [2018-04-11 13:02:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:02:25,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:02:25,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:02:25,172 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-04-11 13:02:25,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:25,208 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-04-11 13:02:25,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:02:25,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 13:02:25,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:25,209 INFO L225 Difference]: With dead ends: 48 [2018-04-11 13:02:25,209 INFO L226 Difference]: Without dead ends: 48 [2018-04-11 13:02:25,209 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-11 13:02:25,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-11 13:02:25,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-11 13:02:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-11 13:02:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-04-11 13:02:25,211 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 14 [2018-04-11 13:02:25,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:25,212 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-04-11 13:02:25,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:02:25,212 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-04-11 13:02:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 13:02:25,212 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:25,212 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-11 13:02:25,212 INFO L408 AbstractCegarLoop]: === Iteration 5 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:25,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1848934114, now seen corresponding path program 1 times [2018-04-11 13:02:25,213 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:25,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,247 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:02:25,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:02:25,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,247 INFO L182 omatonBuilderFactory]: Interpolants [484#true, 485#false, 486#(= 1 (select |#valid| main_~nondetString1~0.base)), 487#(= 1 (select |#valid| |subseq_#in~s.base|)), 488#(= 1 (select |#valid| subseq_~ps~0.base))] [2018-04-11 13:02:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:02:25,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:02:25,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:02:25,248 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-04-11 13:02:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:25,280 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-04-11 13:02:25,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:02:25,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 13:02:25,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:25,280 INFO L225 Difference]: With dead ends: 46 [2018-04-11 13:02:25,280 INFO L226 Difference]: Without dead ends: 46 [2018-04-11 13:02:25,280 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-11 13:02:25,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-04-11 13:02:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-04-11 13:02:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-11 13:02:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-04-11 13:02:25,283 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 18 [2018-04-11 13:02:25,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:25,283 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-04-11 13:02:25,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:02:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-04-11 13:02:25,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 13:02:25,283 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:25,283 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-11 13:02:25,283 INFO L408 AbstractCegarLoop]: === Iteration 6 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:25,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1848934115, now seen corresponding path program 1 times [2018-04-11 13:02:25,284 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:25,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:25,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:02:25,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 13:02:25,348 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,348 INFO L182 omatonBuilderFactory]: Interpolants [583#true, 584#false, 585#(<= 1 main_~length1~0), 586#(and (= 0 |main_#t~malloc12.offset|) (<= 1 main_~length1~0)), 587#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 588#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 589#(and (<= 1 (select |#length| |subseq_#in~s.base|)) (= 0 |subseq_#in~s.offset|)), 590#(and (<= 1 (select |#length| subseq_~ps~0.base)) (= subseq_~ps~0.offset 0))] [2018-04-11 13:02:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:02:25,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:02:25,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:02:25,349 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 8 states. [2018-04-11 13:02:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:25,446 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-04-11 13:02:25,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 13:02:25,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-11 13:02:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:25,448 INFO L225 Difference]: With dead ends: 67 [2018-04-11 13:02:25,448 INFO L226 Difference]: Without dead ends: 67 [2018-04-11 13:02:25,449 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-11 13:02:25,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-11 13:02:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2018-04-11 13:02:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-11 13:02:25,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-04-11 13:02:25,452 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 18 [2018-04-11 13:02:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:25,452 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-04-11 13:02:25,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:02:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-04-11 13:02:25,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 13:02:25,452 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:25,452 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:25,452 INFO L408 AbstractCegarLoop]: === Iteration 7 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:25,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1359365041, now seen corresponding path program 1 times [2018-04-11 13:02:25,453 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:25,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:02:25,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:02:25,496 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,497 INFO L182 omatonBuilderFactory]: Interpolants [723#true, 724#false, 725#(= 1 (select |#valid| main_~nondetString2~0.base)), 726#(= 1 (select |#valid| |subseq_#in~t.base|)), 727#(= 1 (select |#valid| subseq_~pt~0.base))] [2018-04-11 13:02:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:02:25,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:02:25,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:02:25,497 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 5 states. [2018-04-11 13:02:25,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:25,533 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-04-11 13:02:25,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:02:25,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-04-11 13:02:25,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:25,534 INFO L225 Difference]: With dead ends: 54 [2018-04-11 13:02:25,534 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 13:02:25,534 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-11 13:02:25,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 13:02:25,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-11 13:02:25,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 13:02:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-04-11 13:02:25,536 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 21 [2018-04-11 13:02:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:25,536 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-04-11 13:02:25,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:02:25,536 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-04-11 13:02:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 13:02:25,537 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:25,537 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:25,537 INFO L408 AbstractCegarLoop]: === Iteration 8 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:25,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1359365040, now seen corresponding path program 1 times [2018-04-11 13:02:25,537 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:25,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:02:25,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 13:02:25,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,608 INFO L182 omatonBuilderFactory]: Interpolants [838#true, 839#false, 840#(<= 1 main_~length2~0), 841#(and (= main_~length2~0 (select |#length| |main_#t~malloc13.base|)) (<= 1 main_~length2~0) (= 0 |main_#t~malloc13.offset|)), 842#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 843#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base))), 844#(and (= 0 |subseq_#in~t.offset|) (<= 1 (select |#length| |subseq_#in~t.base|))), 845#(and (= subseq_~pt~0.offset 0) (<= 1 (select |#length| subseq_~pt~0.base)))] [2018-04-11 13:02:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:02:25,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:02:25,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:02:25,609 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 8 states. [2018-04-11 13:02:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:25,677 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2018-04-11 13:02:25,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 13:02:25,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-04-11 13:02:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:25,677 INFO L225 Difference]: With dead ends: 70 [2018-04-11 13:02:25,677 INFO L226 Difference]: Without dead ends: 70 [2018-04-11 13:02:25,678 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-11 13:02:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-11 13:02:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-04-11 13:02:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-11 13:02:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-04-11 13:02:25,683 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 21 [2018-04-11 13:02:25,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:25,683 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-04-11 13:02:25,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:02:25,683 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-04-11 13:02:25,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 13:02:25,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:25,684 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:25,684 INFO L408 AbstractCegarLoop]: === Iteration 9 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:25,684 INFO L82 PathProgramCache]: Analyzing trace with hash 613400062, now seen corresponding path program 1 times [2018-04-11 13:02:25,684 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:25,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:02:25,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:02:25,699 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,699 INFO L182 omatonBuilderFactory]: Interpolants [984#true, 985#false, 986#(not |subseq_#t~short4|)] [2018-04-11 13:02:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:02:25,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:02:25,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:02:25,699 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 3 states. [2018-04-11 13:02:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:25,703 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-04-11 13:02:25,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:02:25,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-04-11 13:02:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:25,705 INFO L225 Difference]: With dead ends: 67 [2018-04-11 13:02:25,705 INFO L226 Difference]: Without dead ends: 67 [2018-04-11 13:02:25,705 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-11 13:02:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-11 13:02:25,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-04-11 13:02:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-04-11 13:02:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-04-11 13:02:25,709 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 27 [2018-04-11 13:02:25,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:25,710 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-04-11 13:02:25,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:02:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-04-11 13:02:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 13:02:25,710 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:25,711 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:25,711 INFO L408 AbstractCegarLoop]: === Iteration 10 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:25,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1638706655, now seen corresponding path program 1 times [2018-04-11 13:02:25,711 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:25,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:02:25,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 13:02:25,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,879 INFO L182 omatonBuilderFactory]: Interpolants [1120#true, 1121#false, 1122#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 1123#(and (= (select |#valid| |main_#t~malloc12.base|) 1) (= 0 |main_#t~malloc12.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1)), 1124#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 1125#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (not (= main_~nondetString1~0.base |main_#t~malloc13.base|)) (= main_~nondetString1~0.offset 0)), 1126#(and (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 1127#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 1128#(= 0 (select (select |#memory_int| |subseq_#in~s.base|) |subseq_#in~s.offset|)), 1129#(= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)), 1130#(and (= |subseq_#t~mem2| (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)) (= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))), 1131#(not |subseq_#t~short4|)] [2018-04-11 13:02:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:25,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 13:02:25,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 13:02:25,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:02:25,880 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 12 states. [2018-04-11 13:02:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:26,067 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-04-11 13:02:26,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 13:02:26,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-04-11 13:02:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:26,067 INFO L225 Difference]: With dead ends: 91 [2018-04-11 13:02:26,067 INFO L226 Difference]: Without dead ends: 91 [2018-04-11 13:02:26,068 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:02:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-11 13:02:26,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2018-04-11 13:02:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-11 13:02:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2018-04-11 13:02:26,071 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 29 [2018-04-11 13:02:26,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:26,071 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2018-04-11 13:02:26,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 13:02:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2018-04-11 13:02:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 13:02:26,071 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:26,071 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:26,073 INFO L408 AbstractCegarLoop]: === Iteration 11 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:26,073 INFO L82 PathProgramCache]: Analyzing trace with hash 850822307, now seen corresponding path program 1 times [2018-04-11 13:02:26,073 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:26,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:26,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:02:26,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 13:02:26,263 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:26,263 INFO L182 omatonBuilderFactory]: Interpolants [1325#true, 1326#false, 1327#(<= 1 main_~length1~0), 1328#(and (= (select |#valid| |main_#t~malloc12.base|) 1) (= 0 |main_#t~malloc12.offset|) (<= 1 main_~length1~0)), 1329#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0)), 1330#(and (= 0 main_~nondetString1~0.offset) (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base |main_#t~malloc13.base|))), 1331#(and (= 0 main_~nondetString1~0.offset) (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 1332#(and (= 0 main_~nondetString1~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (<= 2 (select |#length| main_~nondetString1~0.base))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 1333#(and (or (<= 2 (select |#length| |subseq_#in~s.base|)) (= 0 (select (select |#memory_int| |subseq_#in~s.base|) |subseq_#in~s.offset|))) (= 0 |subseq_#in~s.offset|)), 1334#(and (or (<= 2 (select |#length| subseq_~ps~0.base)) (= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))) (= subseq_~ps~0.offset 0)), 1335#(and (or (<= 2 (select |#length| subseq_~ps~0.base)) (and (= |subseq_#t~mem2| (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)) (= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))) (= subseq_~ps~0.offset 0)), 1336#(and (= subseq_~ps~0.offset 0) (or (not |subseq_#t~short4|) (<= 2 (select |#length| subseq_~ps~0.base)))), 1337#(and (<= 2 (select |#length| subseq_~ps~0.base)) (= subseq_~ps~0.offset 0)), 1338#(and (<= (+ subseq_~ps~0.offset 1) (select |#length| subseq_~ps~0.base)) (<= 1 subseq_~ps~0.offset))] [2018-04-11 13:02:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:26,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 13:02:26,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 13:02:26,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:02:26,264 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand 14 states. [2018-04-11 13:02:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:26,575 INFO L93 Difference]: Finished difference Result 115 states and 133 transitions. [2018-04-11 13:02:26,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 13:02:26,576 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-04-11 13:02:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:26,576 INFO L225 Difference]: With dead ends: 115 [2018-04-11 13:02:26,577 INFO L226 Difference]: Without dead ends: 115 [2018-04-11 13:02:26,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:02:26,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-11 13:02:26,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 95. [2018-04-11 13:02:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-11 13:02:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2018-04-11 13:02:26,581 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 29 [2018-04-11 13:02:26,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:26,582 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2018-04-11 13:02:26,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 13:02:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2018-04-11 13:02:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 13:02:26,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:26,583 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:26,583 INFO L408 AbstractCegarLoop]: === Iteration 12 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:26,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1886060033, now seen corresponding path program 1 times [2018-04-11 13:02:26,584 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:26,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:26,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:26,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:02:26,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:02:26,668 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:26,668 INFO L182 omatonBuilderFactory]: Interpolants [1571#true, 1572#false, 1573#(= |#valid| |old(#valid)|), 1574#(and (= (select |#valid| |main_#t~malloc12.base|) 1) (= (store |#valid| |main_#t~malloc12.base| 0) |old(#valid)|)), 1575#(and (not (= |main_#t~malloc12.base| |main_#t~malloc13.base|)) (= (store (store |#valid| |main_#t~malloc13.base| 0) |main_#t~malloc12.base| 0) |old(#valid)|)), 1576#(= |old(#valid)| (store |#valid| |main_#t~malloc13.base| 0))] [2018-04-11 13:02:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:26,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:02:26,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:02:26,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:02:26,669 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand 6 states. [2018-04-11 13:02:26,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:26,778 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2018-04-11 13:02:26,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 13:02:26,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-11 13:02:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:26,779 INFO L225 Difference]: With dead ends: 94 [2018-04-11 13:02:26,779 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 13:02:26,779 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:02:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 13:02:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-04-11 13:02:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-11 13:02:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2018-04-11 13:02:26,782 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 31 [2018-04-11 13:02:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:26,782 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2018-04-11 13:02:26,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:02:26,782 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2018-04-11 13:02:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 13:02:26,783 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:26,783 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:26,783 INFO L408 AbstractCegarLoop]: === Iteration 13 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:26,783 INFO L82 PathProgramCache]: Analyzing trace with hash -2049646960, now seen corresponding path program 1 times [2018-04-11 13:02:26,784 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:26,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:26,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:26,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:02:26,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-11 13:02:26,905 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:26,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:26,906 INFO L182 omatonBuilderFactory]: Interpolants [1740#true, 1741#false, 1742#(and (<= main_~length2~0 1) (<= 1 main_~length2~0)), 1743#(and (<= main_~length2~0 1) (<= 1 main_~length2~0) (= 0 |main_#t~malloc13.offset|)), 1744#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (<= (+ main_~nondetString2~0.offset main_~length2~0) 1)), 1745#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset))), 1746#(= 0 (select (select |#memory_int| |subseq_#in~t.base|) |subseq_#in~t.offset|)), 1747#(= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)), 1748#(and (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (= |subseq_#t~mem2| (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))), 1749#(or (not |subseq_#t~short4|) (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))), 1750#(not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))), 1751#(not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) |subseq_#t~mem5|)), 1752#(and (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) |subseq_#t~mem5|)) (= |subseq_#t~mem6| (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)))] [2018-04-11 13:02:26,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:26,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 13:02:26,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 13:02:26,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:02:26,907 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 13 states. [2018-04-11 13:02:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:27,055 INFO L93 Difference]: Finished difference Result 124 states and 149 transitions. [2018-04-11 13:02:27,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 13:02:27,056 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-04-11 13:02:27,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:27,056 INFO L225 Difference]: With dead ends: 124 [2018-04-11 13:02:27,057 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 13:02:27,057 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:02:27,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 13:02:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 83. [2018-04-11 13:02:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-11 13:02:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2018-04-11 13:02:27,061 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 32 [2018-04-11 13:02:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:27,061 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2018-04-11 13:02:27,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 13:02:27,061 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2018-04-11 13:02:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 13:02:27,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:27,062 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:27,062 INFO L408 AbstractCegarLoop]: === Iteration 14 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:27,062 INFO L82 PathProgramCache]: Analyzing trace with hash -274639598, now seen corresponding path program 1 times [2018-04-11 13:02:27,063 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:27,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:27,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:02:27,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 13:02:27,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:27,164 INFO L182 omatonBuilderFactory]: Interpolants [1984#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (<= (+ main_~nondetString2~0.offset main_~length2~0) 1)), 1985#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset))), 1986#(= 0 (select (select |#memory_int| |subseq_#in~t.base|) |subseq_#in~t.offset|)), 1987#(= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)), 1988#(and (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (= |subseq_#t~mem3| (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))), 1989#(not |subseq_#t~short4|), 1980#true, 1981#false, 1982#(and (<= main_~length2~0 1) (<= 1 main_~length2~0)), 1983#(and (<= main_~length2~0 1) (<= 1 main_~length2~0) (= 0 |main_#t~malloc13.offset|))] [2018-04-11 13:02:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:27,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:02:27,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:02:27,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:02:27,165 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand 10 states. [2018-04-11 13:02:27,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:27,239 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-04-11 13:02:27,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 13:02:27,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-04-11 13:02:27,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:27,240 INFO L225 Difference]: With dead ends: 80 [2018-04-11 13:02:27,240 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 13:02:27,240 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:02:27,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 13:02:27,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-04-11 13:02:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-11 13:02:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2018-04-11 13:02:27,242 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 32 [2018-04-11 13:02:27,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:27,242 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2018-04-11 13:02:27,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:02:27,242 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2018-04-11 13:02:27,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 13:02:27,242 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:27,242 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:27,242 INFO L408 AbstractCegarLoop]: === Iteration 15 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:27,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1909098350, now seen corresponding path program 1 times [2018-04-11 13:02:27,243 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:27,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:27,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:02:27,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 13:02:27,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:27,406 INFO L182 omatonBuilderFactory]: Interpolants [2145#true, 2146#false, 2147#(<= 1 main_~length2~0), 2148#(and (= main_~length2~0 (select |#length| |main_#t~malloc13.base|)) (<= 1 main_~length2~0) (= 0 |main_#t~malloc13.offset|)), 2149#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2150#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset)) (<= 2 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 2151#(and (= 0 |subseq_#in~t.offset|) (or (<= 2 (select |#length| |subseq_#in~t.base|)) (= 0 (select (select |#memory_int| |subseq_#in~t.base|) |subseq_#in~t.offset|)))), 2152#(and (= subseq_~pt~0.offset 0) (or (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (<= 2 (select |#length| subseq_~pt~0.base)))), 2153#(and (= subseq_~pt~0.offset 0) (or (and (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (= |subseq_#t~mem2| (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))) (<= 2 (select |#length| subseq_~pt~0.base)))), 2154#(and (= subseq_~pt~0.offset 0) (or (not |subseq_#t~short4|) (<= 2 (select |#length| subseq_~pt~0.base)) (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))))), 2155#(and (= subseq_~pt~0.offset 0) (or (<= 2 (select |#length| subseq_~pt~0.base)) (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))))), 2156#(and (= subseq_~pt~0.offset 0) (or (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) |subseq_#t~mem5|)) (<= 2 (select |#length| subseq_~pt~0.base)))), 2157#(and (= subseq_~pt~0.offset 0) (or (<= 2 (select |#length| subseq_~pt~0.base)) (and (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) |subseq_#t~mem5|)) (= |subseq_#t~mem6| (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))))), 2158#(and (= subseq_~pt~0.offset 0) (<= 2 (select |#length| subseq_~pt~0.base))), 2159#(and (<= 1 subseq_~pt~0.offset) (<= (+ subseq_~pt~0.offset 1) (select |#length| subseq_~pt~0.base)))] [2018-04-11 13:02:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:27,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 13:02:27,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 13:02:27,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:02:27,406 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 15 states. [2018-04-11 13:02:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:27,626 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2018-04-11 13:02:27,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 13:02:27,626 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-04-11 13:02:27,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:27,627 INFO L225 Difference]: With dead ends: 82 [2018-04-11 13:02:27,627 INFO L226 Difference]: Without dead ends: 80 [2018-04-11 13:02:27,627 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2018-04-11 13:02:27,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-11 13:02:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-04-11 13:02:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-11 13:02:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2018-04-11 13:02:27,628 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 32 [2018-04-11 13:02:27,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:27,628 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2018-04-11 13:02:27,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 13:02:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2018-04-11 13:02:27,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 13:02:27,629 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:27,629 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:27,629 INFO L408 AbstractCegarLoop]: === Iteration 16 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:27,629 INFO L82 PathProgramCache]: Analyzing trace with hash -134090988, now seen corresponding path program 1 times [2018-04-11 13:02:27,630 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:27,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:27,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:02:27,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 13:02:27,729 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:27,729 INFO L182 omatonBuilderFactory]: Interpolants [2340#true, 2341#false, 2342#(<= 1 main_~length2~0), 2343#(and (= main_~length2~0 (select |#length| |main_#t~malloc13.base|)) (<= 1 main_~length2~0) (= 0 |main_#t~malloc13.offset|)), 2344#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2345#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset)) (<= 2 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 2346#(and (= 0 |subseq_#in~t.offset|) (or (<= 2 (select |#length| |subseq_#in~t.base|)) (= 0 (select (select |#memory_int| |subseq_#in~t.base|) |subseq_#in~t.offset|)))), 2347#(and (= subseq_~pt~0.offset 0) (or (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (<= 2 (select |#length| subseq_~pt~0.base)))), 2348#(and (= subseq_~pt~0.offset 0) (or (<= 2 (select |#length| subseq_~pt~0.base)) (and (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (= |subseq_#t~mem3| (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))))), 2349#(and (= subseq_~pt~0.offset 0) (or (not |subseq_#t~short4|) (<= 2 (select |#length| subseq_~pt~0.base)))), 2350#(and (= subseq_~pt~0.offset 0) (<= 2 (select |#length| subseq_~pt~0.base))), 2351#(and (<= 1 subseq_~pt~0.offset) (<= (+ subseq_~pt~0.offset 1) (select |#length| subseq_~pt~0.base)))] [2018-04-11 13:02:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:27,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 13:02:27,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 13:02:27,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:02:27,730 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand 12 states. [2018-04-11 13:02:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:27,875 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-04-11 13:02:27,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:02:27,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-04-11 13:02:27,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:27,876 INFO L225 Difference]: With dead ends: 93 [2018-04-11 13:02:27,876 INFO L226 Difference]: Without dead ends: 91 [2018-04-11 13:02:27,876 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:02:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-11 13:02:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-04-11 13:02:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-11 13:02:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2018-04-11 13:02:27,879 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 32 [2018-04-11 13:02:27,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:27,879 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2018-04-11 13:02:27,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 13:02:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2018-04-11 13:02:27,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 13:02:27,880 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:27,880 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:27,880 INFO L408 AbstractCegarLoop]: === Iteration 17 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:27,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1917342621, now seen corresponding path program 1 times [2018-04-11 13:02:27,881 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:27,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:28,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:02:28,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 13:02:28,152 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:28,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:28,152 INFO L182 omatonBuilderFactory]: Interpolants [2545#true, 2546#false, 2547#(and (= main_~length1~0 (select |#length| |main_#t~malloc12.base|)) (= (select |#valid| |main_#t~malloc12.base|) 1) (= 0 |main_#t~malloc12.offset|)), 2548#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 2549#(and (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base |main_#t~malloc13.base|))), 2550#(and (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 2551#(and (= 0 main_~nondetString1~0.offset) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (or (= 0 (select (select |#memory_int| main_~nondetString1~0.base) 1)) (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1))), 2552#(and (or (<= 3 (select |#length| |subseq_#in~s.base|)) (<= (select |#length| |subseq_#in~s.base|) 1) (= 0 (select (select |#memory_int| |subseq_#in~s.base|) 1))) (= 0 |subseq_#in~s.offset|)), 2553#(and (or (<= (select |#length| subseq_~ps~0.base) 1) (<= 3 (select |#length| subseq_~ps~0.base)) (= 0 (select (select |#memory_int| subseq_~ps~0.base) 1))) (= subseq_~ps~0.offset 0)), 2554#(and (or (<= (+ subseq_~ps~0.offset 2) (select |#length| subseq_~ps~0.base)) (<= (select |#length| subseq_~ps~0.base) subseq_~ps~0.offset) (= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))) (= 1 subseq_~ps~0.offset)), 2555#(and (or (<= (+ subseq_~ps~0.offset 2) (select |#length| subseq_~ps~0.base)) (and (= |subseq_#t~mem2| (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)) (= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))) (= 1 subseq_~ps~0.offset)), 2556#(and (or (not |subseq_#t~short4|) (<= (+ subseq_~ps~0.offset 2) (select |#length| subseq_~ps~0.base))) (= 1 subseq_~ps~0.offset)), 2557#(and (<= (+ subseq_~ps~0.offset 2) (select |#length| subseq_~ps~0.base)) (= 1 subseq_~ps~0.offset)), 2558#(and (<= (+ subseq_~ps~0.offset 1) (select |#length| subseq_~ps~0.base)) (<= 2 subseq_~ps~0.offset))] [2018-04-11 13:02:28,152 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:28,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 13:02:28,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 13:02:28,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:02:28,153 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 14 states. [2018-04-11 13:02:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:28,458 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-04-11 13:02:28,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 13:02:28,458 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-04-11 13:02:28,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:28,459 INFO L225 Difference]: With dead ends: 120 [2018-04-11 13:02:28,459 INFO L226 Difference]: Without dead ends: 120 [2018-04-11 13:02:28,459 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:02:28,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-04-11 13:02:28,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2018-04-11 13:02:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-04-11 13:02:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2018-04-11 13:02:28,461 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 40 [2018-04-11 13:02:28,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:28,461 INFO L459 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2018-04-11 13:02:28,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 13:02:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2018-04-11 13:02:28,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 13:02:28,462 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:28,462 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:28,462 INFO L408 AbstractCegarLoop]: === Iteration 18 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:28,462 INFO L82 PathProgramCache]: Analyzing trace with hash -783966512, now seen corresponding path program 2 times [2018-04-11 13:02:28,462 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:28,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:28,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:02:28,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 13:02:28,835 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:28,835 INFO L182 omatonBuilderFactory]: Interpolants [2796#true, 2797#false, 2798#(and (= main_~length2~0 (select |#length| |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 2799#(and (= 0 main_~nondetString2~0.offset) (or (= (+ main_~nondetString2~0.offset main_~length2~0) 2) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))), 2800#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) 1)) (<= (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)) 1) (<= 3 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 2801#(and (= 0 |subseq_#in~t.offset|) (or (= 0 (select (select |#memory_int| |subseq_#in~t.base|) 1)) (<= 3 (select |#length| |subseq_#in~t.base|)) (<= (select |#length| |subseq_#in~t.base|) 1))), 2802#(and (= subseq_~pt~0.offset 0) (or (<= (select |#length| subseq_~pt~0.base) 1) (= 0 (select (select |#memory_int| subseq_~pt~0.base) 1)) (<= 3 (select |#length| subseq_~pt~0.base)))), 2803#(or (and (= 1 subseq_~pt~0.offset) (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))) (and (<= 1 subseq_~pt~0.offset) (or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset)))), 2804#(or (and (= 1 subseq_~pt~0.offset) (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (= |subseq_#t~mem2| (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))) (and (<= 1 subseq_~pt~0.offset) (or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset)))), 2805#(or (and (= 1 subseq_~pt~0.offset) (or (not |subseq_#t~short4|) (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))))) (and (<= 1 subseq_~pt~0.offset) (or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset)))), 2806#(or (and (= 1 subseq_~pt~0.offset) (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))) (and (<= 1 subseq_~pt~0.offset) (or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset)))), 2807#(or (and (= 1 subseq_~pt~0.offset) (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))) (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 1 subseq_~pt~0.offset))), 2808#(or (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 1 subseq_~pt~0.offset)) (and (= 1 subseq_~pt~0.offset) (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) |subseq_#t~mem5|)))), 2809#(or (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 1 subseq_~pt~0.offset)) (and (= 1 subseq_~pt~0.offset) (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) |subseq_#t~mem5|)) (= |subseq_#t~mem6| (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)))), 2810#(and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 1 subseq_~pt~0.offset)), 2811#(and (<= (+ subseq_~pt~0.offset 1) (select |#length| subseq_~pt~0.base)) (<= 2 subseq_~pt~0.offset))] [2018-04-11 13:02:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:28,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 13:02:28,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 13:02:28,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:02:28,836 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand 16 states. [2018-04-11 13:02:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:29,319 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2018-04-11 13:02:29,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 13:02:29,320 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-04-11 13:02:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:29,320 INFO L225 Difference]: With dead ends: 128 [2018-04-11 13:02:29,320 INFO L226 Difference]: Without dead ends: 126 [2018-04-11 13:02:29,320 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2018-04-11 13:02:29,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-11 13:02:29,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-04-11 13:02:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-11 13:02:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 139 transitions. [2018-04-11 13:02:29,323 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 139 transitions. Word has length 43 [2018-04-11 13:02:29,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:29,323 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 139 transitions. [2018-04-11 13:02:29,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 13:02:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2018-04-11 13:02:29,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 13:02:29,324 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:29,324 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:29,324 INFO L408 AbstractCegarLoop]: === Iteration 19 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:29,324 INFO L82 PathProgramCache]: Analyzing trace with hash 991040850, now seen corresponding path program 1 times [2018-04-11 13:02:29,325 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:29,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:29,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:02:29,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 13:02:29,533 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:29,533 INFO L182 omatonBuilderFactory]: Interpolants [3088#(and (= 0 main_~nondetString2~0.offset) (or (= (+ main_~nondetString2~0.offset main_~length2~0) 2) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))), 3089#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) 1)) (<= (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)) 1) (<= 3 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 3090#(and (= 0 |subseq_#in~t.offset|) (or (= 0 (select (select |#memory_int| |subseq_#in~t.base|) 1)) (<= 3 (select |#length| |subseq_#in~t.base|)) (<= (select |#length| |subseq_#in~t.base|) 1))), 3091#(and (= subseq_~pt~0.offset 0) (or (<= (select |#length| subseq_~pt~0.base) 1) (= 0 (select (select |#memory_int| subseq_~pt~0.base) 1)) (<= 3 (select |#length| subseq_~pt~0.base)))), 3092#(or (and (= 1 subseq_~pt~0.offset) (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))) (and (<= 1 subseq_~pt~0.offset) (or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset)))), 3093#(or (and (= 1 subseq_~pt~0.offset) (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (= |subseq_#t~mem3| (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))) (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 1 subseq_~pt~0.offset))), 3094#(or (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 1 subseq_~pt~0.offset)) (and (not |subseq_#t~short4|) (= 1 subseq_~pt~0.offset))), 3095#(and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 1 subseq_~pt~0.offset)), 3096#(and (<= (+ subseq_~pt~0.offset 1) (select |#length| subseq_~pt~0.base)) (<= 2 subseq_~pt~0.offset)), 3085#true, 3086#false, 3087#(and (= main_~length2~0 (select |#length| |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|))] [2018-04-11 13:02:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:29,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 13:02:29,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 13:02:29,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:02:29,534 INFO L87 Difference]: Start difference. First operand 119 states and 139 transitions. Second operand 12 states. [2018-04-11 13:02:29,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:29,806 INFO L93 Difference]: Finished difference Result 148 states and 174 transitions. [2018-04-11 13:02:29,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:02:29,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-04-11 13:02:29,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:29,807 INFO L225 Difference]: With dead ends: 148 [2018-04-11 13:02:29,807 INFO L226 Difference]: Without dead ends: 146 [2018-04-11 13:02:29,807 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:02:29,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-11 13:02:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 129. [2018-04-11 13:02:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 13:02:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2018-04-11 13:02:29,809 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 43 [2018-04-11 13:02:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:29,809 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2018-04-11 13:02:29,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 13:02:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2018-04-11 13:02:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 13:02:29,809 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:29,809 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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-11 13:02:29,809 INFO L408 AbstractCegarLoop]: === Iteration 20 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:29,810 INFO L82 PathProgramCache]: Analyzing trace with hash -774589279, now seen corresponding path program 2 times [2018-04-11 13:02:29,810 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:29,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-11 13:02:29,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:02:29,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 13:02:29,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:29,966 INFO L182 omatonBuilderFactory]: Interpolants [3392#(and (= main_~length1~0 (select |#length| |main_#t~malloc12.base|)) (= (select |#valid| |main_#t~malloc12.base|) 1) (= 0 |main_#t~malloc12.offset|)), 3393#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 3394#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base |main_#t~malloc13.base|)) (= main_~nondetString1~0.offset 0)), 3395#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 3396#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (- 1))))) (= main_~nondetString1~0.offset 0)), 3397#(= 0 (select (select |#memory_int| |subseq_#in~s.base|) (+ (select |#length| |subseq_#in~s.base|) (- 1)))), 3398#(= 0 (select (select |#memory_int| subseq_~ps~0.base) (+ (select |#length| subseq_~ps~0.base) (- 1)))), 3399#(or (<= (+ subseq_~ps~0.offset 2) (select |#length| subseq_~ps~0.base)) (<= (select |#length| subseq_~ps~0.base) subseq_~ps~0.offset) (= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))), 3400#(and (or (<= (+ subseq_~ps~0.offset 2) (select |#length| subseq_~ps~0.base)) (and (= |subseq_#t~mem2| (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)) (= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))) (<= 0 subseq_~ps~0.offset)), 3401#(and (or (not |subseq_#t~short4|) (<= (+ subseq_~ps~0.offset 2) (select |#length| subseq_~ps~0.base))) (<= 0 subseq_~ps~0.offset)), 3402#(and (<= (+ subseq_~ps~0.offset 2) (select |#length| subseq_~ps~0.base)) (<= 0 subseq_~ps~0.offset)), 3403#(and (<= (+ subseq_~ps~0.offset 1) (select |#length| subseq_~ps~0.base)) (<= 1 subseq_~ps~0.offset)), 3390#true, 3391#false] [2018-04-11 13:02:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-11 13:02:29,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 13:02:29,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 13:02:29,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:02:29,967 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 14 states. [2018-04-11 13:02:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:30,231 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2018-04-11 13:02:30,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 13:02:30,231 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2018-04-11 13:02:30,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:30,232 INFO L225 Difference]: With dead ends: 155 [2018-04-11 13:02:30,232 INFO L226 Difference]: Without dead ends: 155 [2018-04-11 13:02:30,232 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2018-04-11 13:02:30,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-11 13:02:30,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 63. [2018-04-11 13:02:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-11 13:02:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-04-11 13:02:30,235 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 51 [2018-04-11 13:02:30,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:30,235 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-04-11 13:02:30,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 13:02:30,235 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-04-11 13:02:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 13:02:30,236 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:30,236 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 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-11 13:02:30,236 INFO L408 AbstractCegarLoop]: === Iteration 21 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:30,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1070056914, now seen corresponding path program 3 times [2018-04-11 13:02:30,237 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:30,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-04-11 13:02:30,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:02:30,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 13:02:30,412 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:30,412 INFO L182 omatonBuilderFactory]: Interpolants [3648#(and (= main_~length2~0 (select |#length| |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 3649#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 3650#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) (+ (select |#length| main_~nondetString2~0.base) (+ main_~nondetString2~0.offset (- 1)))))), 3651#(= 0 (select (select |#memory_int| |subseq_#in~t.base|) (+ (select |#length| |subseq_#in~t.base|) (- 1)))), 3652#(= 0 (select (select |#memory_int| subseq_~pt~0.base) (+ (select |#length| subseq_~pt~0.base) (- 1)))), 3653#(or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset) (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))), 3654#(or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset) (and (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (= |subseq_#t~mem2| (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))), 3655#(or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (not |subseq_#t~short4|) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset) (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))), 3656#(or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset) (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))), 3657#(or (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))) (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 0 subseq_~pt~0.offset))), 3658#(or (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) |subseq_#t~mem5|)) (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 0 subseq_~pt~0.offset))), 3659#(or (and (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) |subseq_#t~mem5|)) (= |subseq_#t~mem6| (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))) (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 0 subseq_~pt~0.offset))), 3660#(and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 0 subseq_~pt~0.offset)), 3661#(and (<= 1 subseq_~pt~0.offset) (<= (+ subseq_~pt~0.offset 1) (select |#length| subseq_~pt~0.base))), 3646#true, 3647#false] [2018-04-11 13:02:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-04-11 13:02:30,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 13:02:30,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 13:02:30,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:02:30,413 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 16 states. [2018-04-11 13:02:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:30,866 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-04-11 13:02:30,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 13:02:30,866 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-04-11 13:02:30,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:30,867 INFO L225 Difference]: With dead ends: 104 [2018-04-11 13:02:30,867 INFO L226 Difference]: Without dead ends: 101 [2018-04-11 13:02:30,867 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=915, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 13:02:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-11 13:02:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 63. [2018-04-11 13:02:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-11 13:02:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-04-11 13:02:30,869 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 54 [2018-04-11 13:02:30,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:30,869 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-04-11 13:02:30,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 13:02:30,869 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-04-11 13:02:30,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 13:02:30,869 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:02:30,869 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:02:30,869 INFO L408 AbstractCegarLoop]: === Iteration 22 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 13:02:30,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1449903020, now seen corresponding path program 2 times [2018-04-11 13:02:30,870 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:02:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:02:30,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:02:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-04-11 13:02:30,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:02:30,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 13:02:30,974 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:02:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:02:30,974 INFO L182 omatonBuilderFactory]: Interpolants [3872#(= 0 (select (select |#memory_int| |subseq_#in~t.base|) (+ (select |#length| |subseq_#in~t.base|) (- 1)))), 3873#(= 0 (select (select |#memory_int| subseq_~pt~0.base) (+ (select |#length| subseq_~pt~0.base) (- 1)))), 3874#(or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset) (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))), 3875#(or (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 0 subseq_~pt~0.offset)) (and (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (= |subseq_#t~mem3| (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)))), 3876#(or (not |subseq_#t~short4|) (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 0 subseq_~pt~0.offset))), 3877#(and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 0 subseq_~pt~0.offset)), 3878#(and (<= 1 subseq_~pt~0.offset) (<= (+ subseq_~pt~0.offset 1) (select |#length| subseq_~pt~0.base))), 3867#true, 3868#false, 3869#(and (= main_~length2~0 (select |#length| |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 3870#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 3871#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) (+ (select |#length| main_~nondetString2~0.base) (+ main_~nondetString2~0.offset (- 1))))))] [2018-04-11 13:02:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-04-11 13:02:30,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 13:02:30,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 13:02:30,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:02:30,975 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 12 states. [2018-04-11 13:02:31,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:02:31,166 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-04-11 13:02:31,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 13:02:31,211 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-04-11 13:02:31,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:02:31,212 INFO L225 Difference]: With dead ends: 60 [2018-04-11 13:02:31,212 INFO L226 Difference]: Without dead ends: 0 [2018-04-11 13:02:31,212 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:02:31,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-11 13:02:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-11 13:02:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-11 13:02:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-11 13:02:31,212 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-04-11 13:02:31,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:02:31,213 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-11 13:02:31,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 13:02:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-11 13:02:31,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-11 13:02:31,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 01:02:31 BoogieIcfgContainer [2018-04-11 13:02:31,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 13:02:31,216 INFO L168 Benchmark]: Toolchain (without parser) took 7327.19 ms. Allocated memory was 401.1 MB in the beginning and 783.8 MB in the end (delta: 382.7 MB). Free memory was 333.9 MB in the beginning and 547.9 MB in the end (delta: -214.0 MB). Peak memory consumption was 168.7 MB. Max. memory is 5.3 GB. [2018-04-11 13:02:31,217 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 401.1 MB. Free memory is still 361.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 13:02:31,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.37 ms. Allocated memory is still 401.1 MB. Free memory was 332.6 MB in the beginning and 308.8 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-11 13:02:31,218 INFO L168 Benchmark]: Boogie Preprocessor took 43.46 ms. Allocated memory is still 401.1 MB. Free memory was 308.8 MB in the beginning and 307.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-11 13:02:31,218 INFO L168 Benchmark]: RCFGBuilder took 380.24 ms. Allocated memory was 401.1 MB in the beginning and 611.3 MB in the end (delta: 210.2 MB). Free memory was 307.5 MB in the beginning and 545.6 MB in the end (delta: -238.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-11 13:02:31,218 INFO L168 Benchmark]: TraceAbstraction took 6662.96 ms. Allocated memory was 611.3 MB in the beginning and 783.8 MB in the end (delta: 172.5 MB). Free memory was 545.6 MB in the beginning and 547.9 MB in the end (delta: -2.3 MB). Peak memory consumption was 170.2 MB. Max. memory is 5.3 GB. [2018-04-11 13:02:31,220 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 401.1 MB. Free memory is still 361.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 237.37 ms. Allocated memory is still 401.1 MB. Free memory was 332.6 MB in the beginning and 308.8 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.46 ms. Allocated memory is still 401.1 MB. Free memory was 308.8 MB in the beginning and 307.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 380.24 ms. Allocated memory was 401.1 MB in the beginning and 611.3 MB in the end (delta: 210.2 MB). Free memory was 307.5 MB in the beginning and 545.6 MB in the end (delta: -238.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6662.96 ms. Allocated memory was 611.3 MB in the beginning and 783.8 MB in the end (delta: 172.5 MB). Free memory was 545.6 MB in the beginning and 547.9 MB in the end (delta: -2.3 MB). Peak memory consumption was 170.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 564]: 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, 61 locations, 15 error locations. SAFE Result, 6.6s OverallTime, 22 OverallIterations, 4 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 765 SDtfs, 1388 SDslu, 2730 SDs, 0 SdLazy, 2974 SolverSat, 232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 46/218 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, 22 MinimizatonAttempts, 271 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 661 NumberOfCodeBlocks, 661 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 639 ConstructedInterpolants, 0 QuantifiedInterpolants, 224448 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 46/218 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/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_13-02-31-224.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_13-02-31-224.csv Received shutdown request...