java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 05:20:37,466 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 05:20:37,468 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 05:20:37,479 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 05:20:37,480 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 05:20:37,480 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 05:20:37,481 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 05:20:37,482 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 05:20:37,483 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 05:20:37,484 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 05:20:37,485 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 05:20:37,485 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 05:20:37,486 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 05:20:37,487 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 05:20:37,487 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 05:20:37,489 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 05:20:37,491 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 05:20:37,492 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 05:20:37,493 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 05:20:37,494 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 05:20:37,495 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 05:20:37,496 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 05:20:37,496 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 05:20:37,497 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 05:20:37,497 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 05:20:37,498 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 05:20:37,498 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 05:20:37,499 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 05:20:37,499 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 05:20:37,500 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 05:20:37,500 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 05:20:37,500 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-13 05:20:37,510 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 05:20:37,510 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 05:20:37,511 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 05:20:37,511 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 05:20:37,512 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 05:20:37,512 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 05:20:37,512 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 05:20:37,512 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 05:20:37,512 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 05:20:37,512 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 05:20:37,512 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 05:20:37,513 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 05:20:37,513 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 05:20:37,513 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 05:20:37,513 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 05:20:37,513 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 05:20:37,513 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 05:20:37,513 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 05:20:37,514 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 05:20:37,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 05:20:37,514 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 05:20:37,514 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 05:20:37,514 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 05:20:37,514 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 05:20:37,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 05:20:37,551 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 05:20:37,554 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 05:20:37,555 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 05:20:37,556 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 05:20:37,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i [2018-04-13 05:20:37,836 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG061926457 [2018-04-13 05:20:37,963 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 05:20:37,964 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 05:20:37,964 INFO L168 CDTParser]: Scanning 960521-1_false-valid-free.i [2018-04-13 05:20:37,973 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 05:20:37,973 INFO L215 ultiparseSymbolTable]: [2018-04-13 05:20:37,973 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 05:20:37,973 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_f_________false_valid_free_i__foo ('foo') in 960521-1_false-valid-free.i [2018-04-13 05:20:37,973 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in 960521-1_false-valid-free.i [2018-04-13 05:20:37,974 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 05:20:37,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__caddr_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____rlim_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__mode_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_int in 960521-1_false-valid-free.i [2018-04-13 05:20:37,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__div_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_mutex_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____int32_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__fsblkcnt_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fsfilcnt_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_mutexattr_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____rlim64_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____suseconds_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____time_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____ssize_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____dev_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____blksize_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__int32_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____qaddr_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____caddr_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__fd_set in 960521-1_false-valid-free.i [2018-04-13 05:20:37,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____timer_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____id_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____blkcnt64_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pid_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__fsfilcnt_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____u_short in 960521-1_false-valid-free.i [2018-04-13 05:20:37,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__key_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_int32_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____nlink_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__blkcnt_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____pthread_list_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_char in 960521-1_false-valid-free.i [2018-04-13 05:20:37,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__ulong in 960521-1_false-valid-free.i [2018-04-13 05:20:37,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____int16_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_once_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____u_long in 960521-1_false-valid-free.i [2018-04-13 05:20:37,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__gid_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fsblkcnt64_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____off64_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_short in 960521-1_false-valid-free.i [2018-04-13 05:20:37,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____quad_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__int16_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__lldiv_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____u_char in 960521-1_false-valid-free.i [2018-04-13 05:20:37,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____mode_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__blksize_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____u_quad_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__wchar_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____intptr_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____uint32_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_barrier_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__size_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__off_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_attr_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__uid_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____socklen_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____clockid_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__quad_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____daddr_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_spinlock_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__fsid_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_int16_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_cond_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__int64_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____key_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____blkcnt_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____clock_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__fd_mask in 960521-1_false-valid-free.i [2018-04-13 05:20:37,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__dev_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____WAIT_STATUS in 960521-1_false-valid-free.i [2018-04-13 05:20:37,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__ushort in 960521-1_false-valid-free.i [2018-04-13 05:20:37,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__id_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____uint8_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__uint in 960521-1_false-valid-free.i [2018-04-13 05:20:37,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____sigset_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__loff_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____ino_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____ino64_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____pid_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____off_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fd_mask in 960521-1_false-valid-free.i [2018-04-13 05:20:37,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____uint16_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____gid_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fsid_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__nlink_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__clock_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_condattr_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_rwlockattr_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_long in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__suseconds_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_int8_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____loff_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__daddr_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____sig_atomic_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__clockid_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__timer_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____int8_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_barrierattr_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__register_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__sigset_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____uint64_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____swblk_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_quad_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__ldiv_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____uid_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__ssize_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__u_int64_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fsblkcnt_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____int64_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__int8_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__n in 960521-1_false-valid-free.i [2018-04-13 05:20:37,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____fsfilcnt64_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__ino_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____u_int in 960521-1_false-valid-free.i [2018-04-13 05:20:37,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i____useconds_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__a in 960521-1_false-valid-free.i [2018-04-13 05:20:37,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__b in 960521-1_false-valid-free.i [2018-04-13 05:20:37,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__time_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_rwlock_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_f_________false_valid_free_i__pthread_key_t in 960521-1_false-valid-free.i [2018-04-13 05:20:37,996 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG061926457 [2018-04-13 05:20:38,000 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 05:20:38,001 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 05:20:38,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 05:20:38,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 05:20:38,005 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 05:20:38,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:20:37" (1/1) ... [2018-04-13 05:20:38,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e2a22aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:20:38, skipping insertion in model container [2018-04-13 05:20:38,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:20:37" (1/1) ... [2018-04-13 05:20:38,019 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 05:20:38,042 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 05:20:38,161 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 05:20:38,193 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 05:20:38,199 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 111 non ball SCCs. Number of states in SCCs 111. [2018-04-13 05:20:38,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:20:38 WrapperNode [2018-04-13 05:20:38,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 05:20:38,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 05:20:38,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 05:20:38,228 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 05:20:38,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:20:38" (1/1) ... [2018-04-13 05:20:38,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:20:38" (1/1) ... [2018-04-13 05:20:38,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:20:38" (1/1) ... [2018-04-13 05:20:38,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:20:38" (1/1) ... [2018-04-13 05:20:38,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:20:38" (1/1) ... [2018-04-13 05:20:38,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:20:38" (1/1) ... [2018-04-13 05:20:38,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:20:38" (1/1) ... [2018-04-13 05:20:38,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 05:20:38,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 05:20:38,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 05:20:38,263 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 05:20:38,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:20:38" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 05:20:38,348 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 05:20:38,348 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 05:20:38,348 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_________false_valid_free_i__foo [2018-04-13 05:20:38,348 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 05:20:38,349 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-13 05:20:38,349 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 05:20:38,349 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 05:20:38,349 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 05:20:38,349 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 05:20:38,349 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 05:20:38,349 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 05:20:38,349 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 05:20:38,349 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 05:20:38,349 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 05:20:38,349 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 05:20:38,349 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 05:20:38,350 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 05:20:38,350 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 05:20:38,350 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 05:20:38,350 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 05:20:38,350 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 05:20:38,350 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 05:20:38,350 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 05:20:38,350 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 05:20:38,350 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 05:20:38,351 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 05:20:38,351 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 05:20:38,351 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 05:20:38,351 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 05:20:38,351 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 05:20:38,351 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 05:20:38,351 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 05:20:38,351 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 05:20:38,351 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 05:20:38,352 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 05:20:38,352 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 05:20:38,352 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 05:20:38,352 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 05:20:38,352 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 05:20:38,352 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 05:20:38,352 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 05:20:38,352 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 05:20:38,352 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 05:20:38,353 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 05:20:38,353 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 05:20:38,353 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 05:20:38,353 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 05:20:38,353 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 05:20:38,353 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 05:20:38,353 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 05:20:38,353 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 05:20:38,353 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 05:20:38,353 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 05:20:38,354 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 05:20:38,354 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 05:20:38,354 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 05:20:38,354 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 05:20:38,354 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 05:20:38,354 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 05:20:38,354 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 05:20:38,354 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 05:20:38,354 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 05:20:38,354 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 05:20:38,355 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 05:20:38,355 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 05:20:38,355 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 05:20:38,355 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 05:20:38,355 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 05:20:38,355 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 05:20:38,355 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-13 05:20:38,355 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 05:20:38,355 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 05:20:38,356 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 05:20:38,356 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 05:20:38,356 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 05:20:38,356 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 05:20:38,356 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 05:20:38,356 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 05:20:38,356 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 05:20:38,356 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 05:20:38,356 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 05:20:38,356 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 05:20:38,356 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 05:20:38,357 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 05:20:38,357 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 05:20:38,357 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 05:20:38,357 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 05:20:38,357 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 05:20:38,357 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 05:20:38,357 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 05:20:38,357 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 05:20:38,357 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 05:20:38,357 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 05:20:38,358 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 05:20:38,358 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 05:20:38,358 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 05:20:38,358 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 05:20:38,358 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 05:20:38,358 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 05:20:38,358 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 05:20:38,358 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 05:20:38,358 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 05:20:38,358 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 05:20:38,359 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 05:20:38,359 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 05:20:38,359 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 05:20:38,359 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_________false_valid_free_i__foo [2018-04-13 05:20:38,359 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 05:20:38,359 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 05:20:38,359 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 05:20:38,359 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 05:20:38,359 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 05:20:38,359 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 05:20:38,360 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 05:20:38,360 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 05:20:38,639 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 05:20:38,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:20:38 BoogieIcfgContainer [2018-04-13 05:20:38,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 05:20:38,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 05:20:38,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 05:20:38,641 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 05:20:38,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:20:37" (1/3) ... [2018-04-13 05:20:38,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67407b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:20:38, skipping insertion in model container [2018-04-13 05:20:38,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:20:38" (2/3) ... [2018-04-13 05:20:38,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67407b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:20:38, skipping insertion in model container [2018-04-13 05:20:38,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:20:38" (3/3) ... [2018-04-13 05:20:38,643 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-free.i [2018-04-13 05:20:38,649 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 05:20:38,654 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-04-13 05:20:38,686 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 05:20:38,686 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 05:20:38,686 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 05:20:38,686 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 05:20:38,686 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 05:20:38,686 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 05:20:38,686 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 05:20:38,687 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 05:20:38,687 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 05:20:38,687 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 05:20:38,695 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-04-13 05:20:38,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-13 05:20:38,700 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:38,701 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:38,701 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash 516560539, now seen corresponding path program 1 times [2018-04-13 05:20:38,704 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:38,705 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:38,733 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:38,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:38,733 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:38,775 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:20:38,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:20:38,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:20:38,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 05:20:38,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 05:20:38,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 05:20:38,822 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2018-04-13 05:20:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:38,896 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-04-13 05:20:38,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 05:20:38,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-04-13 05:20:38,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:38,902 INFO L225 Difference]: With dead ends: 60 [2018-04-13 05:20:38,903 INFO L226 Difference]: Without dead ends: 57 [2018-04-13 05:20:38,904 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:20:38,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-13 05:20:38,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-04-13 05:20:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-13 05:20:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-04-13 05:20:38,934 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 11 [2018-04-13 05:20:38,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:38,935 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-04-13 05:20:38,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 05:20:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-04-13 05:20:38,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-13 05:20:38,935 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:38,935 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:38,936 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:38,936 INFO L82 PathProgramCache]: Analyzing trace with hash 516560540, now seen corresponding path program 1 times [2018-04-13 05:20:38,936 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:38,936 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:38,937 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:38,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:38,937 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:38,952 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:39,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:20:39,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:20:39,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 05:20:39,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 05:20:39,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 05:20:39,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:20:39,003 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2018-04-13 05:20:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:39,067 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-04-13 05:20:39,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 05:20:39,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-04-13 05:20:39,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:39,069 INFO L225 Difference]: With dead ends: 56 [2018-04-13 05:20:39,069 INFO L226 Difference]: Without dead ends: 56 [2018-04-13 05:20:39,069 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 05:20:39,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-04-13 05:20:39,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-04-13 05:20:39,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-13 05:20:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-04-13 05:20:39,072 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 11 [2018-04-13 05:20:39,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:39,072 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-04-13 05:20:39,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 05:20:39,072 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-04-13 05:20:39,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-13 05:20:39,073 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:39,073 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:39,073 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:39,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1337247429, now seen corresponding path program 1 times [2018-04-13 05:20:39,073 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:39,073 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:39,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:39,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:39,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:39,088 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:39,093 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:20:39,093 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:39,093 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:39,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:39,136 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:39,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 05:20:39,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:39,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:20:39,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 05:20:39,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:20:39,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:20:39,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 05:20:39,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:39,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 05:20:39,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-13 05:20:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:20:39,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:20:39,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 05:20:39,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 05:20:39,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 05:20:39,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:20:39,201 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 5 states. [2018-04-13 05:20:39,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:39,276 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-04-13 05:20:39,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 05:20:39,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-13 05:20:39,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:39,277 INFO L225 Difference]: With dead ends: 53 [2018-04-13 05:20:39,277 INFO L226 Difference]: Without dead ends: 53 [2018-04-13 05:20:39,278 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-13 05:20:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-13 05:20:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-04-13 05:20:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-13 05:20:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-04-13 05:20:39,282 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 17 [2018-04-13 05:20:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:39,282 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-04-13 05:20:39,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 05:20:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-04-13 05:20:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-13 05:20:39,283 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:39,283 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:39,283 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:39,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1337247430, now seen corresponding path program 1 times [2018-04-13 05:20:39,283 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:39,283 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:39,284 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:39,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:39,284 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:39,297 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:39,300 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:20:39,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:39,300 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:39,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:39,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:39,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 05:20:39,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:39,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:20:39,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:39,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:20:39,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-13 05:20:39,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:20:39,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-04-13 05:20:39,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:39,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:20:39,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:20:39,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 05:20:39,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:39,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 05:20:39,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-04-13 05:20:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:20:39,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:20:39,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 05:20:39,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 05:20:39,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 05:20:39,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-13 05:20:39,466 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 7 states. [2018-04-13 05:20:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:39,731 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-04-13 05:20:39,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 05:20:39,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-04-13 05:20:39,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:39,732 INFO L225 Difference]: With dead ends: 61 [2018-04-13 05:20:39,732 INFO L226 Difference]: Without dead ends: 61 [2018-04-13 05:20:39,732 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-13 05:20:39,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-04-13 05:20:39,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2018-04-13 05:20:39,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-13 05:20:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-04-13 05:20:39,735 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 17 [2018-04-13 05:20:39,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:39,736 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-04-13 05:20:39,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 05:20:39,736 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-04-13 05:20:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-13 05:20:39,736 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:39,736 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:39,736 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1186083357, now seen corresponding path program 1 times [2018-04-13 05:20:39,737 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:39,737 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:39,738 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:39,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:39,738 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:39,749 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:39,753 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:20:39,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:39,753 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:39,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:39,782 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:39,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:20:39,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:39,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 05:20:39,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:39,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:20:39,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-13 05:20:39,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:20:39,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-04-13 05:20:39,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:39,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:20:39,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:20:39,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 05:20:39,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:39,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 05:20:39,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-04-13 05:20:39,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:20:39,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:20:39,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-13 05:20:39,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 05:20:39,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 05:20:39,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-13 05:20:39,929 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 9 states. [2018-04-13 05:20:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:40,219 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-04-13 05:20:40,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 05:20:40,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-13 05:20:40,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:40,220 INFO L225 Difference]: With dead ends: 65 [2018-04-13 05:20:40,220 INFO L226 Difference]: Without dead ends: 65 [2018-04-13 05:20:40,221 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-04-13 05:20:40,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-13 05:20:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-04-13 05:20:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-13 05:20:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-04-13 05:20:40,223 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 21 [2018-04-13 05:20:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:40,223 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-04-13 05:20:40,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 05:20:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-04-13 05:20:40,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-13 05:20:40,224 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:40,224 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:40,224 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:40,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1607211508, now seen corresponding path program 2 times [2018-04-13 05:20:40,224 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:40,224 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:40,225 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:40,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:40,225 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:40,236 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:40,240 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:20:40,241 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:40,241 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:40,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:20:40,269 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:20:40,269 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:40,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:40,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:20:40,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:40,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 05:20:40,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:40,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:20:40,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-13 05:20:40,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:20:40,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-04-13 05:20:40,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:40,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:20:40,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:20:40,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 05:20:40,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:40,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 05:20:40,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-04-13 05:20:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:20:40,411 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:20:40,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-13 05:20:40,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 05:20:40,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 05:20:40,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-13 05:20:40,412 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 9 states. [2018-04-13 05:20:40,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:40,692 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-04-13 05:20:40,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 05:20:40,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-04-13 05:20:40,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:40,694 INFO L225 Difference]: With dead ends: 81 [2018-04-13 05:20:40,694 INFO L226 Difference]: Without dead ends: 81 [2018-04-13 05:20:40,694 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-04-13 05:20:40,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-13 05:20:40,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-04-13 05:20:40,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-13 05:20:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-04-13 05:20:40,697 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 25 [2018-04-13 05:20:40,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:40,697 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-04-13 05:20:40,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 05:20:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-04-13 05:20:40,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 05:20:40,697 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:40,697 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:40,697 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:40,698 INFO L82 PathProgramCache]: Analyzing trace with hash 124796491, now seen corresponding path program 3 times [2018-04-13 05:20:40,698 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:40,698 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:40,698 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:40,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:40,698 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:40,709 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:40,722 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:20:40,722 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:40,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:40,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:20:40,743 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-04-13 05:20:40,743 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:40,746 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:40,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:20:40,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:40,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 05:20:40,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:40,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:20:40,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-13 05:20:40,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:20:40,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-04-13 05:20:40,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:40,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:20:40,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:20:40,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 05:20:40,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:40,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 05:20:40,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-13 05:20:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-13 05:20:40,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:20:40,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-13 05:20:40,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 05:20:40,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 05:20:40,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-13 05:20:40,857 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 9 states. [2018-04-13 05:20:41,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:41,105 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-04-13 05:20:41,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 05:20:41,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-04-13 05:20:41,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:41,106 INFO L225 Difference]: With dead ends: 73 [2018-04-13 05:20:41,106 INFO L226 Difference]: Without dead ends: 73 [2018-04-13 05:20:41,106 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-04-13 05:20:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-13 05:20:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2018-04-13 05:20:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-13 05:20:41,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-04-13 05:20:41,110 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 29 [2018-04-13 05:20:41,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:41,110 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-04-13 05:20:41,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 05:20:41,110 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-04-13 05:20:41,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 05:20:41,111 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:41,111 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:41,111 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:41,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1631061243, now seen corresponding path program 1 times [2018-04-13 05:20:41,111 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:41,111 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:41,112 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:41,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:41,112 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:41,118 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-04-13 05:20:41,135 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:20:41,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:20:41,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 05:20:41,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 05:20:41,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 05:20:41,136 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 4 states. [2018-04-13 05:20:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:41,157 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-04-13 05:20:41,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 05:20:41,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-04-13 05:20:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:41,157 INFO L225 Difference]: With dead ends: 68 [2018-04-13 05:20:41,157 INFO L226 Difference]: Without dead ends: 68 [2018-04-13 05:20:41,158 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:20:41,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-13 05:20:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-04-13 05:20:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-13 05:20:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-04-13 05:20:41,160 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 32 [2018-04-13 05:20:41,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:41,160 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-04-13 05:20:41,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 05:20:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-04-13 05:20:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 05:20:41,161 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:41,161 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:41,161 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1631061242, now seen corresponding path program 1 times [2018-04-13 05:20:41,161 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:41,161 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:41,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:41,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:41,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:41,169 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:20:41,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:41,205 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:41,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:41,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:20:41,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:41,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-04-13 05:20:41,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 05:20:41,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 05:20:41,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:20:41,245 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 11 states. [2018-04-13 05:20:41,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:41,286 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-04-13 05:20:41,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 05:20:41,287 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-04-13 05:20:41,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:41,287 INFO L225 Difference]: With dead ends: 84 [2018-04-13 05:20:41,287 INFO L226 Difference]: Without dead ends: 84 [2018-04-13 05:20:41,287 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:20:41,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-13 05:20:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2018-04-13 05:20:41,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-13 05:20:41,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-04-13 05:20:41,294 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 32 [2018-04-13 05:20:41,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:41,294 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-04-13 05:20:41,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 05:20:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-04-13 05:20:41,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 05:20:41,295 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:41,295 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:41,295 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:41,295 INFO L82 PathProgramCache]: Analyzing trace with hash -830892337, now seen corresponding path program 2 times [2018-04-13 05:20:41,296 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:41,296 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:41,296 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:41,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:41,296 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:41,304 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:20:41,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:41,348 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:41,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:20:41,359 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-13 05:20:41,359 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:41,362 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:41,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:20:41,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:41,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 05:20:41,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-13 05:20:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-04-13 05:20:41,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:20:41,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-04-13 05:20:41,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 05:20:41,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 05:20:41,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-04-13 05:20:41,435 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 12 states. [2018-04-13 05:20:41,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:41,716 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-04-13 05:20:41,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 05:20:41,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-04-13 05:20:41,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:41,718 INFO L225 Difference]: With dead ends: 84 [2018-04-13 05:20:41,718 INFO L226 Difference]: Without dead ends: 84 [2018-04-13 05:20:41,719 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2018-04-13 05:20:41,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-13 05:20:41,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2018-04-13 05:20:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-13 05:20:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-04-13 05:20:41,721 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 36 [2018-04-13 05:20:41,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:41,722 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-04-13 05:20:41,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 05:20:41,722 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-04-13 05:20:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 05:20:41,722 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:41,722 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:41,722 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:41,723 INFO L82 PathProgramCache]: Analyzing trace with hash -21492497, now seen corresponding path program 1 times [2018-04-13 05:20:41,723 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:41,723 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:41,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:41,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:41,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:41,731 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:41,808 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 05:20:41,809 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:41,809 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:41,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:41,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:41,883 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 05:20:41,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:41,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-04-13 05:20:41,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 05:20:41,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 05:20:41,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-04-13 05:20:41,884 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 15 states. [2018-04-13 05:20:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:41,956 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-04-13 05:20:41,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 05:20:41,957 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-04-13 05:20:41,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:41,957 INFO L225 Difference]: With dead ends: 91 [2018-04-13 05:20:41,957 INFO L226 Difference]: Without dead ends: 91 [2018-04-13 05:20:41,957 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-04-13 05:20:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-13 05:20:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2018-04-13 05:20:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-13 05:20:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-04-13 05:20:41,959 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 44 [2018-04-13 05:20:41,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:41,959 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-04-13 05:20:41,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 05:20:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-04-13 05:20:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 05:20:41,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:41,960 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:41,960 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:41,960 INFO L82 PathProgramCache]: Analyzing trace with hash -960937160, now seen corresponding path program 2 times [2018-04-13 05:20:41,960 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:41,960 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:41,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:41,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:41,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:41,966 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 05:20:42,012 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:42,012 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:42,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:20:42,035 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:20:42,035 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:42,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:42,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:20:42,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:42,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 05:20:42,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-13 05:20:42,191 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-04-13 05:20:42,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:20:42,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-04-13 05:20:42,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 05:20:42,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 05:20:42,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-04-13 05:20:42,192 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 15 states. [2018-04-13 05:20:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:42,624 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-04-13 05:20:42,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 05:20:42,624 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-04-13 05:20:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:42,625 INFO L225 Difference]: With dead ends: 95 [2018-04-13 05:20:42,625 INFO L226 Difference]: Without dead ends: 95 [2018-04-13 05:20:42,626 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=280, Invalid=712, Unknown=0, NotChecked=0, Total=992 [2018-04-13 05:20:42,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-13 05:20:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2018-04-13 05:20:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-13 05:20:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-04-13 05:20:42,628 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 48 [2018-04-13 05:20:42,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:42,629 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-04-13 05:20:42,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 05:20:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-04-13 05:20:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-13 05:20:42,630 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:42,630 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:42,631 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:42,631 INFO L82 PathProgramCache]: Analyzing trace with hash 568412717, now seen corresponding path program 1 times [2018-04-13 05:20:42,631 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:42,631 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:42,631 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:42,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:42,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:42,644 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:42,725 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-04-13 05:20:42,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:42,725 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:42,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:42,742 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:42,826 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-04-13 05:20:42,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:42,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-04-13 05:20:42,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 05:20:42,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 05:20:42,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2018-04-13 05:20:42,827 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 20 states. [2018-04-13 05:20:42,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:42,904 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-04-13 05:20:42,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 05:20:42,905 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-04-13 05:20:42,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:42,905 INFO L225 Difference]: With dead ends: 101 [2018-04-13 05:20:42,905 INFO L226 Difference]: Without dead ends: 101 [2018-04-13 05:20:42,906 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=265, Unknown=0, NotChecked=0, Total=420 [2018-04-13 05:20:42,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-13 05:20:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-04-13 05:20:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-04-13 05:20:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-04-13 05:20:42,907 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 79 [2018-04-13 05:20:42,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:42,908 INFO L459 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-04-13 05:20:42,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 05:20:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-04-13 05:20:42,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-04-13 05:20:42,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:42,909 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:42,909 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:42,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1423474090, now seen corresponding path program 2 times [2018-04-13 05:20:42,909 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:42,909 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:42,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:42,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:42,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:42,919 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-04-13 05:20:42,987 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:42,987 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:42,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:20:43,001 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:20:43,001 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:43,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-04-13 05:20:43,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:43,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2018-04-13 05:20:43,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 05:20:43,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 05:20:43,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-04-13 05:20:43,021 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 14 states. [2018-04-13 05:20:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:43,124 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2018-04-13 05:20:43,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 05:20:43,125 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 91 [2018-04-13 05:20:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:43,126 INFO L225 Difference]: With dead ends: 109 [2018-04-13 05:20:43,126 INFO L226 Difference]: Without dead ends: 109 [2018-04-13 05:20:43,126 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=179, Invalid=327, Unknown=0, NotChecked=0, Total=506 [2018-04-13 05:20:43,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-13 05:20:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-04-13 05:20:43,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-13 05:20:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-04-13 05:20:43,129 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 91 [2018-04-13 05:20:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:43,129 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-04-13 05:20:43,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 05:20:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-04-13 05:20:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 05:20:43,131 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:43,131 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:43,131 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:43,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1022800842, now seen corresponding path program 3 times [2018-04-13 05:20:43,131 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:43,131 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:43,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:43,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:43,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:43,145 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-04-13 05:20:43,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:43,232 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:43,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:20:43,267 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-13 05:20:43,267 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:43,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-04-13 05:20:43,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:43,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2018-04-13 05:20:43,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 05:20:43,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 05:20:43,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2018-04-13 05:20:43,292 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 15 states. [2018-04-13 05:20:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:43,452 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-04-13 05:20:43,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 05:20:43,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 99 [2018-04-13 05:20:43,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:43,453 INFO L225 Difference]: With dead ends: 117 [2018-04-13 05:20:43,453 INFO L226 Difference]: Without dead ends: 117 [2018-04-13 05:20:43,454 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=213, Invalid=387, Unknown=0, NotChecked=0, Total=600 [2018-04-13 05:20:43,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-13 05:20:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-04-13 05:20:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-13 05:20:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-04-13 05:20:43,457 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 99 [2018-04-13 05:20:43,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:43,457 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-04-13 05:20:43,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 05:20:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-04-13 05:20:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-04-13 05:20:43,458 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:43,459 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:43,459 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:43,459 INFO L82 PathProgramCache]: Analyzing trace with hash 282730262, now seen corresponding path program 4 times [2018-04-13 05:20:43,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:43,459 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:43,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:43,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:43,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:43,472 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-04-13 05:20:43,561 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:43,562 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:43,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:20:43,608 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:20:43,609 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:43,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:43,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:20:43,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:43,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:20:43,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:20:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 200 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:20:43,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:43,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26] total 39 [2018-04-13 05:20:43,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 05:20:43,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 05:20:43,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1144, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 05:20:43,940 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 39 states. [2018-04-13 05:20:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:44,199 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2018-04-13 05:20:44,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 05:20:44,199 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 107 [2018-04-13 05:20:44,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:44,200 INFO L225 Difference]: With dead ends: 125 [2018-04-13 05:20:44,200 INFO L226 Difference]: Without dead ends: 125 [2018-04-13 05:20:44,200 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=2161, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 05:20:44,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-13 05:20:44,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2018-04-13 05:20:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-13 05:20:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-04-13 05:20:44,202 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 107 [2018-04-13 05:20:44,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:44,202 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-04-13 05:20:44,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 05:20:44,202 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-04-13 05:20:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-04-13 05:20:44,203 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:44,203 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:44,203 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:44,203 INFO L82 PathProgramCache]: Analyzing trace with hash 233077494, now seen corresponding path program 5 times [2018-04-13 05:20:44,204 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:44,204 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:44,204 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:44,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:44,204 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:44,213 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-04-13 05:20:44,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:44,311 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:44,312 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:20:44,339 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-13 05:20:44,339 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:44,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-04-13 05:20:44,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:44,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 17 [2018-04-13 05:20:44,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 05:20:44,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 05:20:44,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2018-04-13 05:20:44,371 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 17 states. [2018-04-13 05:20:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:44,552 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-04-13 05:20:44,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 05:20:44,555 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 115 [2018-04-13 05:20:44,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:44,556 INFO L225 Difference]: With dead ends: 133 [2018-04-13 05:20:44,556 INFO L226 Difference]: Without dead ends: 133 [2018-04-13 05:20:44,556 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=290, Invalid=522, Unknown=0, NotChecked=0, Total=812 [2018-04-13 05:20:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-13 05:20:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-04-13 05:20:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-13 05:20:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-04-13 05:20:44,560 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 115 [2018-04-13 05:20:44,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:44,560 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-04-13 05:20:44,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 05:20:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-04-13 05:20:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-04-13 05:20:44,562 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:44,562 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:44,562 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:44,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1556946986, now seen corresponding path program 6 times [2018-04-13 05:20:44,562 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:44,562 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:44,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:44,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:44,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:44,580 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:44,706 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-04-13 05:20:44,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:44,706 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:44,707 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:20:44,746 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-13 05:20:44,746 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:44,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-04-13 05:20:44,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:44,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 18 [2018-04-13 05:20:44,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 05:20:44,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 05:20:44,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2018-04-13 05:20:44,788 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 18 states. [2018-04-13 05:20:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:44,923 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2018-04-13 05:20:44,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 05:20:44,923 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 123 [2018-04-13 05:20:44,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:44,923 INFO L225 Difference]: With dead ends: 141 [2018-04-13 05:20:44,923 INFO L226 Difference]: Without dead ends: 141 [2018-04-13 05:20:44,924 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=333, Invalid=597, Unknown=0, NotChecked=0, Total=930 [2018-04-13 05:20:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-13 05:20:44,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2018-04-13 05:20:44,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-13 05:20:44,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-04-13 05:20:44,925 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 123 [2018-04-13 05:20:44,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:44,925 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-04-13 05:20:44,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 05:20:44,926 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-04-13 05:20:44,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-04-13 05:20:44,926 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:44,926 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:44,926 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:44,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1234161078, now seen corresponding path program 7 times [2018-04-13 05:20:44,927 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:44,927 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:44,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:44,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:44,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:44,947 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-04-13 05:20:45,082 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:45,082 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:45,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:45,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-04-13 05:20:45,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:45,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2018-04-13 05:20:45,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 05:20:45,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 05:20:45,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=631, Unknown=0, NotChecked=0, Total=992 [2018-04-13 05:20:45,281 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 32 states. [2018-04-13 05:20:45,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:45,417 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-04-13 05:20:45,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 05:20:45,417 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 131 [2018-04-13 05:20:45,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:45,417 INFO L225 Difference]: With dead ends: 149 [2018-04-13 05:20:45,417 INFO L226 Difference]: Without dead ends: 149 [2018-04-13 05:20:45,418 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=392, Invalid=664, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 05:20:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-04-13 05:20:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2018-04-13 05:20:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-13 05:20:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-04-13 05:20:45,420 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 131 [2018-04-13 05:20:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:45,420 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-04-13 05:20:45,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 05:20:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-04-13 05:20:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-04-13 05:20:45,420 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:45,421 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:45,421 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:45,421 INFO L82 PathProgramCache]: Analyzing trace with hash 696632470, now seen corresponding path program 8 times [2018-04-13 05:20:45,421 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:45,421 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:45,421 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:45,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:45,422 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:45,431 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-04-13 05:20:45,559 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:45,560 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:45,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:20:45,582 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:20:45,583 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:45,586 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-04-13 05:20:45,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:45,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 20 [2018-04-13 05:20:45,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 05:20:45,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 05:20:45,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2018-04-13 05:20:45,615 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 20 states. [2018-04-13 05:20:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:45,849 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-04-13 05:20:45,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 05:20:45,850 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 139 [2018-04-13 05:20:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:45,850 INFO L225 Difference]: With dead ends: 157 [2018-04-13 05:20:45,850 INFO L226 Difference]: Without dead ends: 157 [2018-04-13 05:20:45,851 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=428, Invalid=762, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 05:20:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-04-13 05:20:45,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2018-04-13 05:20:45,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-13 05:20:45,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-04-13 05:20:45,854 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 139 [2018-04-13 05:20:45,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:45,854 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-04-13 05:20:45,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 05:20:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-04-13 05:20:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-04-13 05:20:45,855 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:45,855 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:45,855 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:45,855 INFO L82 PathProgramCache]: Analyzing trace with hash 996099190, now seen corresponding path program 9 times [2018-04-13 05:20:45,855 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:45,855 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:45,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:45,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:45,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:45,871 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-04-13 05:20:46,044 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:46,044 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:46,045 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:20:46,085 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-13 05:20:46,086 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:46,091 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-04-13 05:20:46,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:46,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2018-04-13 05:20:46,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 05:20:46,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 05:20:46,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=800, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 05:20:46,309 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 36 states. [2018-04-13 05:20:46,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:46,451 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-04-13 05:20:46,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 05:20:46,451 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 147 [2018-04-13 05:20:46,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:46,452 INFO L225 Difference]: With dead ends: 165 [2018-04-13 05:20:46,452 INFO L226 Difference]: Without dead ends: 165 [2018-04-13 05:20:46,452 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=495, Invalid=837, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 05:20:46,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-04-13 05:20:46,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2018-04-13 05:20:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-13 05:20:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-04-13 05:20:46,455 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 147 [2018-04-13 05:20:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:46,456 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-04-13 05:20:46,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 05:20:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-04-13 05:20:46,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-04-13 05:20:46,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:46,457 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:46,457 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:46,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1730596182, now seen corresponding path program 10 times [2018-04-13 05:20:46,457 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:46,457 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:46,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:46,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:46,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:46,473 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-04-13 05:20:46,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:46,646 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:46,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:20:46,675 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:20:46,675 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:46,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:46,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:20:46,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:46,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:20:46,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:20:47,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 512 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:20:47,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:47,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 38] total 57 [2018-04-13 05:20:47,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-13 05:20:47,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-13 05:20:47,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=2470, Unknown=0, NotChecked=0, Total=3192 [2018-04-13 05:20:47,415 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 57 states. [2018-04-13 05:20:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:47,837 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2018-04-13 05:20:47,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 05:20:47,838 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 155 [2018-04-13 05:20:47,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:47,838 INFO L225 Difference]: With dead ends: 173 [2018-04-13 05:20:47,838 INFO L226 Difference]: Without dead ends: 173 [2018-04-13 05:20:47,839 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1264, Invalid=4588, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 05:20:47,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-13 05:20:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2018-04-13 05:20:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-13 05:20:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-04-13 05:20:47,843 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 155 [2018-04-13 05:20:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:47,843 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-04-13 05:20:47,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-13 05:20:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-04-13 05:20:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-04-13 05:20:47,844 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:47,844 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:47,844 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:47,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1532567754, now seen corresponding path program 11 times [2018-04-13 05:20:47,844 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:47,844 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:47,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:47,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:47,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:47,859 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-04-13 05:20:48,034 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:48,034 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:48,034 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:20:48,066 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-13 05:20:48,066 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:48,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-04-13 05:20:48,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:48,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 23 [2018-04-13 05:20:48,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 05:20:48,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 05:20:48,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2018-04-13 05:20:48,102 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 23 states. [2018-04-13 05:20:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:48,329 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2018-04-13 05:20:48,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 05:20:48,329 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 163 [2018-04-13 05:20:48,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:48,330 INFO L225 Difference]: With dead ends: 181 [2018-04-13 05:20:48,330 INFO L226 Difference]: Without dead ends: 181 [2018-04-13 05:20:48,330 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=593, Invalid=1047, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 05:20:48,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-04-13 05:20:48,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2018-04-13 05:20:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-13 05:20:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-04-13 05:20:48,332 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 163 [2018-04-13 05:20:48,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:48,333 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-04-13 05:20:48,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 05:20:48,333 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-04-13 05:20:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-04-13 05:20:48,333 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:48,334 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:48,334 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:48,334 INFO L82 PathProgramCache]: Analyzing trace with hash 459930134, now seen corresponding path program 12 times [2018-04-13 05:20:48,334 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:48,334 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:48,335 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:48,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:48,335 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:48,350 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-04-13 05:20:48,551 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:48,551 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:48,552 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:20:48,596 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-04-13 05:20:48,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:48,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-04-13 05:20:48,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:48,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2018-04-13 05:20:48,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-13 05:20:48,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-13 05:20:48,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=631, Invalid=1091, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 05:20:48,806 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 42 states. [2018-04-13 05:20:48,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:48,926 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2018-04-13 05:20:48,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 05:20:48,927 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 171 [2018-04-13 05:20:48,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:48,927 INFO L225 Difference]: With dead ends: 189 [2018-04-13 05:20:48,927 INFO L226 Difference]: Without dead ends: 189 [2018-04-13 05:20:48,928 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=672, Invalid=1134, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 05:20:48,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-13 05:20:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2018-04-13 05:20:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-13 05:20:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-04-13 05:20:48,931 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 171 [2018-04-13 05:20:48,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:48,931 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-04-13 05:20:48,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-13 05:20:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-04-13 05:20:48,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-04-13 05:20:48,932 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:48,932 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:48,933 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:48,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1119526390, now seen corresponding path program 13 times [2018-04-13 05:20:48,933 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:48,933 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:48,933 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:48,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:48,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:48,947 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-04-13 05:20:49,112 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:49,112 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:49,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:49,134 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-04-13 05:20:49,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:49,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2018-04-13 05:20:49,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 05:20:49,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 05:20:49,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=1198, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 05:20:49,371 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 44 states. [2018-04-13 05:20:49,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:49,519 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-04-13 05:20:49,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 05:20:49,520 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 179 [2018-04-13 05:20:49,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:49,520 INFO L225 Difference]: With dead ends: 197 [2018-04-13 05:20:49,520 INFO L226 Difference]: Without dead ends: 197 [2018-04-13 05:20:49,521 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=737, Invalid=1243, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 05:20:49,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-13 05:20:49,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2018-04-13 05:20:49,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-13 05:20:49,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-04-13 05:20:49,523 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 179 [2018-04-13 05:20:49,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:49,523 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-04-13 05:20:49,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 05:20:49,523 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-04-13 05:20:49,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-04-13 05:20:49,523 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:49,524 INFO L355 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:49,524 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:49,524 INFO L82 PathProgramCache]: Analyzing trace with hash 27478742, now seen corresponding path program 14 times [2018-04-13 05:20:49,524 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:49,524 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:49,524 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:49,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:49,524 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:49,534 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-04-13 05:20:49,738 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:49,738 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:49,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:20:49,752 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:20:49,752 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:49,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-04-13 05:20:49,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:49,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 26 [2018-04-13 05:20:49,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 05:20:49,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 05:20:49,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2018-04-13 05:20:49,788 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 26 states. [2018-04-13 05:20:50,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:50,118 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2018-04-13 05:20:50,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 05:20:50,119 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 187 [2018-04-13 05:20:50,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:50,119 INFO L225 Difference]: With dead ends: 205 [2018-04-13 05:20:50,119 INFO L226 Difference]: Without dead ends: 205 [2018-04-13 05:20:50,120 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=785, Invalid=1377, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 05:20:50,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-13 05:20:50,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2018-04-13 05:20:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-13 05:20:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-04-13 05:20:50,123 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 187 [2018-04-13 05:20:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:50,123 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-04-13 05:20:50,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 05:20:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-04-13 05:20:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-04-13 05:20:50,124 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:50,124 INFO L355 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:50,124 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:50,125 INFO L82 PathProgramCache]: Analyzing trace with hash -823230282, now seen corresponding path program 15 times [2018-04-13 05:20:50,125 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:50,125 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:50,125 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:50,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:50,125 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:50,142 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-04-13 05:20:50,441 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:50,441 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:50,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:20:50,482 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-13 05:20:50,483 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:50,490 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-04-13 05:20:50,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:50,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-04-13 05:20:50,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-13 05:20:50,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-13 05:20:50,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=829, Invalid=1427, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 05:20:50,829 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 48 states. [2018-04-13 05:20:51,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:51,014 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2018-04-13 05:20:51,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 05:20:51,014 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 195 [2018-04-13 05:20:51,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:51,015 INFO L225 Difference]: With dead ends: 213 [2018-04-13 05:20:51,015 INFO L226 Difference]: Without dead ends: 213 [2018-04-13 05:20:51,015 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=876, Invalid=1476, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 05:20:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-13 05:20:51,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2018-04-13 05:20:51,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-13 05:20:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-04-13 05:20:51,017 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 195 [2018-04-13 05:20:51,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:51,017 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-04-13 05:20:51,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-13 05:20:51,017 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-04-13 05:20:51,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-04-13 05:20:51,018 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:51,018 INFO L355 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:51,018 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:51,018 INFO L82 PathProgramCache]: Analyzing trace with hash -785989738, now seen corresponding path program 16 times [2018-04-13 05:20:51,018 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:51,018 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:51,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:51,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:51,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:51,028 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-04-13 05:20:51,308 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:51,308 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:51,309 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:20:51,346 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:20:51,346 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:51,354 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:51,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:20:51,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:51,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:20:51,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:20:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 968 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:20:52,430 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:52,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 50] total 75 [2018-04-13 05:20:52,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-13 05:20:52,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-13 05:20:52,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=4300, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 05:20:52,431 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 75 states. [2018-04-13 05:20:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:53,207 INFO L93 Difference]: Finished difference Result 221 states and 222 transitions. [2018-04-13 05:20:53,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 05:20:53,208 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 203 [2018-04-13 05:20:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:53,208 INFO L225 Difference]: With dead ends: 221 [2018-04-13 05:20:53,208 INFO L226 Difference]: Without dead ends: 221 [2018-04-13 05:20:53,211 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3837 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2185, Invalid=7915, Unknown=0, NotChecked=0, Total=10100 [2018-04-13 05:20:53,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-13 05:20:53,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2018-04-13 05:20:53,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-13 05:20:53,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-04-13 05:20:53,214 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 203 [2018-04-13 05:20:53,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:53,214 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-04-13 05:20:53,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-13 05:20:53,214 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-04-13 05:20:53,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-04-13 05:20:53,216 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:53,216 INFO L355 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:53,216 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:53,217 INFO L82 PathProgramCache]: Analyzing trace with hash -23689354, now seen corresponding path program 17 times [2018-04-13 05:20:53,217 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:53,217 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:53,217 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:53,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:53,218 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:53,234 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:53,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2018-04-13 05:20:53,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:53,463 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:53,463 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:20:53,508 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-04-13 05:20:53,508 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:53,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2018-04-13 05:20:53,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:53,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 29 [2018-04-13 05:20:53,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 05:20:53,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 05:20:53,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2018-04-13 05:20:53,556 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 29 states. [2018-04-13 05:20:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:53,961 INFO L93 Difference]: Finished difference Result 229 states and 230 transitions. [2018-04-13 05:20:53,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 05:20:53,961 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 211 [2018-04-13 05:20:53,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:53,962 INFO L225 Difference]: With dead ends: 229 [2018-04-13 05:20:53,962 INFO L226 Difference]: Without dead ends: 229 [2018-04-13 05:20:53,962 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1004, Invalid=1752, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 05:20:53,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-04-13 05:20:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2018-04-13 05:20:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-13 05:20:53,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-04-13 05:20:53,966 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 211 [2018-04-13 05:20:53,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:53,966 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-04-13 05:20:53,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 05:20:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-04-13 05:20:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-04-13 05:20:53,967 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:53,967 INFO L355 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:53,967 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:53,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1028151382, now seen corresponding path program 18 times [2018-04-13 05:20:53,968 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:53,968 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:53,968 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:53,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:53,968 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:53,985 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:54,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2018-04-13 05:20:54,305 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:54,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:54,306 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:20:54,343 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-04-13 05:20:54,343 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:54,348 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2018-04-13 05:20:54,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:54,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 54 [2018-04-13 05:20:54,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-13 05:20:54,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-13 05:20:54,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1054, Invalid=1808, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 05:20:54,667 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 54 states. [2018-04-13 05:20:54,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:54,873 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-04-13 05:20:54,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 05:20:54,874 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 219 [2018-04-13 05:20:54,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:54,875 INFO L225 Difference]: With dead ends: 237 [2018-04-13 05:20:54,875 INFO L226 Difference]: Without dead ends: 237 [2018-04-13 05:20:54,875 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1107, Invalid=1863, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 05:20:54,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-13 05:20:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2018-04-13 05:20:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-13 05:20:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-04-13 05:20:54,879 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 219 [2018-04-13 05:20:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:54,879 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-04-13 05:20:54,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-13 05:20:54,879 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-04-13 05:20:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-04-13 05:20:54,880 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:54,880 INFO L355 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:54,880 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:54,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2096713162, now seen corresponding path program 19 times [2018-04-13 05:20:54,881 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:54,881 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:54,881 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:54,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:54,881 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:54,901 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2018-04-13 05:20:55,125 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:55,125 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:55,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:55,140 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2018-04-13 05:20:55,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:55,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 56 [2018-04-13 05:20:55,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-13 05:20:55,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-13 05:20:55,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=1945, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 05:20:55,446 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 56 states. [2018-04-13 05:20:55,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:55,642 INFO L93 Difference]: Finished difference Result 245 states and 246 transitions. [2018-04-13 05:20:55,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 05:20:55,643 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 227 [2018-04-13 05:20:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:55,644 INFO L225 Difference]: With dead ends: 245 [2018-04-13 05:20:55,644 INFO L226 Difference]: Without dead ends: 245 [2018-04-13 05:20:55,644 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1190, Invalid=2002, Unknown=0, NotChecked=0, Total=3192 [2018-04-13 05:20:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-04-13 05:20:55,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 241. [2018-04-13 05:20:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-04-13 05:20:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-04-13 05:20:55,648 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 227 [2018-04-13 05:20:55,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:55,648 INFO L459 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-04-13 05:20:55,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-13 05:20:55,648 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-04-13 05:20:55,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-04-13 05:20:55,649 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:55,650 INFO L355 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:55,650 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:55,650 INFO L82 PathProgramCache]: Analyzing trace with hash -178514666, now seen corresponding path program 20 times [2018-04-13 05:20:55,650 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:55,650 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:55,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:55,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:20:55,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:55,665 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:55,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2018-04-13 05:20:55,937 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:55,937 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:55,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:20:55,954 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:20:55,955 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:55,958 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2018-04-13 05:20:55,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:55,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 32 [2018-04-13 05:20:55,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 05:20:55,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 05:20:55,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=553, Unknown=0, NotChecked=0, Total=992 [2018-04-13 05:20:55,984 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 32 states. [2018-04-13 05:20:56,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:56,354 INFO L93 Difference]: Finished difference Result 253 states and 254 transitions. [2018-04-13 05:20:56,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 05:20:56,354 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 235 [2018-04-13 05:20:56,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:56,354 INFO L225 Difference]: With dead ends: 253 [2018-04-13 05:20:56,354 INFO L226 Difference]: Without dead ends: 253 [2018-04-13 05:20:56,355 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1250, Invalid=2172, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 05:20:56,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-13 05:20:56,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2018-04-13 05:20:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-04-13 05:20:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-04-13 05:20:56,357 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 235 [2018-04-13 05:20:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:56,357 INFO L459 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-04-13 05:20:56,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 05:20:56,358 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-04-13 05:20:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-04-13 05:20:56,358 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:56,358 INFO L355 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:56,358 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:56,359 INFO L82 PathProgramCache]: Analyzing trace with hash 160628982, now seen corresponding path program 21 times [2018-04-13 05:20:56,359 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:56,359 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:56,359 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:56,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:56,359 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:56,371 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2018-04-13 05:20:56,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:56,617 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:56,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:20:56,650 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-04-13 05:20:56,650 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:56,655 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2018-04-13 05:20:57,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:57,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 60 [2018-04-13 05:20:57,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-13 05:20:57,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-13 05:20:57,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1306, Invalid=2234, Unknown=0, NotChecked=0, Total=3540 [2018-04-13 05:20:57,145 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 60 states. [2018-04-13 05:20:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:57,352 INFO L93 Difference]: Finished difference Result 261 states and 262 transitions. [2018-04-13 05:20:57,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 05:20:57,352 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 243 [2018-04-13 05:20:57,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:57,353 INFO L225 Difference]: With dead ends: 261 [2018-04-13 05:20:57,353 INFO L226 Difference]: Without dead ends: 261 [2018-04-13 05:20:57,353 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1365, Invalid=2295, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 05:20:57,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-04-13 05:20:57,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 257. [2018-04-13 05:20:57,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-04-13 05:20:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-04-13 05:20:57,356 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 243 [2018-04-13 05:20:57,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:57,356 INFO L459 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-04-13 05:20:57,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-13 05:20:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-04-13 05:20:57,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-04-13 05:20:57,357 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:57,357 INFO L355 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:57,357 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:57,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1531578922, now seen corresponding path program 22 times [2018-04-13 05:20:57,357 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:57,357 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:57,357 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:57,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:57,358 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:57,371 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-04-13 05:20:57,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:57,610 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:57,611 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:20:57,642 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:20:57,642 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:57,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:57,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:20:57,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:20:57,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:20:57,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:20:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1568 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:20:58,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:58,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 62] total 93 [2018-04-13 05:20:58,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-13 05:20:58,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-13 05:20:58,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1922, Invalid=6634, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 05:20:58,987 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 93 states. [2018-04-13 05:20:59,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:59,813 INFO L93 Difference]: Finished difference Result 269 states and 270 transitions. [2018-04-13 05:20:59,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 05:20:59,813 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 251 [2018-04-13 05:20:59,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:59,814 INFO L225 Difference]: With dead ends: 269 [2018-04-13 05:20:59,814 INFO L226 Difference]: Without dead ends: 269 [2018-04-13 05:20:59,815 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6057 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3358, Invalid=12142, Unknown=0, NotChecked=0, Total=15500 [2018-04-13 05:20:59,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-13 05:20:59,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 265. [2018-04-13 05:20:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-13 05:20:59,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-04-13 05:20:59,817 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 251 [2018-04-13 05:20:59,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:59,818 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-04-13 05:20:59,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-13 05:20:59,818 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-04-13 05:20:59,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-04-13 05:20:59,818 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:59,818 INFO L355 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:59,818 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:20:59,819 INFO L82 PathProgramCache]: Analyzing trace with hash 999257014, now seen corresponding path program 23 times [2018-04-13 05:20:59,819 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:59,819 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:59,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:59,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:59,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:59,831 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2018-04-13 05:21:00,115 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:00,115 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:00,116 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:21:00,152 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-04-13 05:21:00,152 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:00,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2018-04-13 05:21:00,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:00,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32] total 35 [2018-04-13 05:21:00,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 05:21:00,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 05:21:00,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=658, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 05:21:00,185 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 35 states. [2018-04-13 05:21:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:00,637 INFO L93 Difference]: Finished difference Result 277 states and 278 transitions. [2018-04-13 05:21:00,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 05:21:00,638 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 259 [2018-04-13 05:21:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:00,638 INFO L225 Difference]: With dead ends: 277 [2018-04-13 05:21:00,638 INFO L226 Difference]: Without dead ends: 277 [2018-04-13 05:21:00,639 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1523, Invalid=2637, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 05:21:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-13 05:21:00,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2018-04-13 05:21:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-13 05:21:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-04-13 05:21:00,640 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 259 [2018-04-13 05:21:00,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:00,641 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-04-13 05:21:00,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 05:21:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-04-13 05:21:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-04-13 05:21:00,641 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:00,641 INFO L355 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:00,642 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:00,642 INFO L82 PathProgramCache]: Analyzing trace with hash -223741290, now seen corresponding path program 24 times [2018-04-13 05:21:00,642 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:00,642 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:00,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:00,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:00,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:00,655 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2018-04-13 05:21:00,934 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:00,934 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:00,934 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:21:00,971 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-04-13 05:21:00,971 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:00,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:01,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2018-04-13 05:21:01,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:01,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 66 [2018-04-13 05:21:01,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-13 05:21:01,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-13 05:21:01,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1585, Invalid=2705, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 05:21:01,470 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 66 states. [2018-04-13 05:21:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:01,708 INFO L93 Difference]: Finished difference Result 285 states and 286 transitions. [2018-04-13 05:21:01,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 05:21:01,709 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 267 [2018-04-13 05:21:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:01,710 INFO L225 Difference]: With dead ends: 285 [2018-04-13 05:21:01,710 INFO L226 Difference]: Without dead ends: 285 [2018-04-13 05:21:01,710 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1888 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1650, Invalid=2772, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 05:21:01,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-04-13 05:21:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2018-04-13 05:21:01,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-04-13 05:21:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2018-04-13 05:21:01,714 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 267 [2018-04-13 05:21:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:01,714 INFO L459 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2018-04-13 05:21:01,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-13 05:21:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2018-04-13 05:21:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-04-13 05:21:01,715 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:01,715 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:01,716 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:01,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1102050698, now seen corresponding path program 25 times [2018-04-13 05:21:01,716 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:01,716 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:01,716 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:01,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:01,717 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:01,737 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2018-04-13 05:21:02,369 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:02,370 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:02,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:21:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:02,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2018-04-13 05:21:02,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:02,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 68 [2018-04-13 05:21:02,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-13 05:21:02,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-13 05:21:02,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1684, Invalid=2872, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 05:21:02,817 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 68 states. [2018-04-13 05:21:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:03,059 INFO L93 Difference]: Finished difference Result 293 states and 294 transitions. [2018-04-13 05:21:03,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 05:21:03,059 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 275 [2018-04-13 05:21:03,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:03,060 INFO L225 Difference]: With dead ends: 293 [2018-04-13 05:21:03,060 INFO L226 Difference]: Without dead ends: 293 [2018-04-13 05:21:03,061 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2013 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1751, Invalid=2941, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 05:21:03,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-13 05:21:03,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 289. [2018-04-13 05:21:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-04-13 05:21:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-04-13 05:21:03,064 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 275 [2018-04-13 05:21:03,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:03,065 INFO L459 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-04-13 05:21:03,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-13 05:21:03,065 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-04-13 05:21:03,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-04-13 05:21:03,066 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:03,066 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:03,066 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:03,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2104745130, now seen corresponding path program 26 times [2018-04-13 05:21:03,067 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:03,067 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:03,067 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:03,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:21:03,067 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:03,092 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2018-04-13 05:21:03,458 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:03,458 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:03,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:21:03,478 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:21:03,478 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:03,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2018-04-13 05:21:03,531 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:03,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 38 [2018-04-13 05:21:03,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 05:21:03,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 05:21:03,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=772, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 05:21:03,532 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 38 states. [2018-04-13 05:21:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:04,032 INFO L93 Difference]: Finished difference Result 301 states and 302 transitions. [2018-04-13 05:21:04,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 05:21:04,032 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 283 [2018-04-13 05:21:04,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:04,033 INFO L225 Difference]: With dead ends: 301 [2018-04-13 05:21:04,033 INFO L226 Difference]: Without dead ends: 301 [2018-04-13 05:21:04,033 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1823, Invalid=3147, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 05:21:04,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-04-13 05:21:04,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2018-04-13 05:21:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-13 05:21:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-04-13 05:21:04,036 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 283 [2018-04-13 05:21:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:04,037 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-04-13 05:21:04,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 05:21:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-04-13 05:21:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-04-13 05:21:04,038 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:04,038 INFO L355 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:04,039 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:04,039 INFO L82 PathProgramCache]: Analyzing trace with hash 858309942, now seen corresponding path program 27 times [2018-04-13 05:21:04,039 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:04,039 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:04,039 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:04,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:04,040 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:04,064 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2018-04-13 05:21:04,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:04,429 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:04,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:21:04,463 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-04-13 05:21:04,464 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:04,473 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2018-04-13 05:21:04,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:04,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 39 [2018-04-13 05:21:04,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 05:21:04,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 05:21:04,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=812, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 05:21:04,539 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 39 states. [2018-04-13 05:21:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:05,076 INFO L93 Difference]: Finished difference Result 309 states and 310 transitions. [2018-04-13 05:21:05,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 05:21:05,076 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 291 [2018-04-13 05:21:05,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:05,076 INFO L225 Difference]: With dead ends: 309 [2018-04-13 05:21:05,077 INFO L226 Difference]: Without dead ends: 309 [2018-04-13 05:21:05,077 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1929, Invalid=3327, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 05:21:05,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-04-13 05:21:05,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 305. [2018-04-13 05:21:05,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-04-13 05:21:05,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2018-04-13 05:21:05,079 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 291 [2018-04-13 05:21:05,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:05,079 INFO L459 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2018-04-13 05:21:05,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 05:21:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2018-04-13 05:21:05,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-04-13 05:21:05,080 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:05,080 INFO L355 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:05,080 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:05,080 INFO L82 PathProgramCache]: Analyzing trace with hash -206540778, now seen corresponding path program 28 times [2018-04-13 05:21:05,080 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:05,080 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:05,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:05,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:05,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:05,097 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2018-04-13 05:21:05,462 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:05,462 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:05,462 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:21:05,502 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:21:05,502 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:05,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:05,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:21:05,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:21:05,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:21:05,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:21:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2312 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:21:07,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:07,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 74] total 111 [2018-04-13 05:21:07,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-04-13 05:21:07,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-04-13 05:21:07,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2738, Invalid=9472, Unknown=0, NotChecked=0, Total=12210 [2018-04-13 05:21:07,413 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 111 states. [2018-04-13 05:21:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:08,515 INFO L93 Difference]: Finished difference Result 317 states and 318 transitions. [2018-04-13 05:21:08,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-13 05:21:08,515 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 299 [2018-04-13 05:21:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:08,516 INFO L225 Difference]: With dead ends: 317 [2018-04-13 05:21:08,516 INFO L226 Difference]: Without dead ends: 317 [2018-04-13 05:21:08,517 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8781 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4783, Invalid=17269, Unknown=0, NotChecked=0, Total=22052 [2018-04-13 05:21:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-04-13 05:21:08,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 313. [2018-04-13 05:21:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-04-13 05:21:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2018-04-13 05:21:08,519 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 299 [2018-04-13 05:21:08,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:08,519 INFO L459 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2018-04-13 05:21:08,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-04-13 05:21:08,519 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2018-04-13 05:21:08,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-04-13 05:21:08,520 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:08,520 INFO L355 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:08,520 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:08,520 INFO L82 PathProgramCache]: Analyzing trace with hash 929932278, now seen corresponding path program 29 times [2018-04-13 05:21:08,521 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:08,521 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:08,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:08,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:08,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:08,539 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-04-13 05:21:08,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:08,926 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:08,927 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:21:08,973 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-04-13 05:21:08,973 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:08,977 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-04-13 05:21:09,018 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:09,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38] total 41 [2018-04-13 05:21:09,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 05:21:09,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 05:21:09,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=745, Invalid=895, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 05:21:09,019 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 41 states. [2018-04-13 05:21:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:09,555 INFO L93 Difference]: Finished difference Result 325 states and 326 transitions. [2018-04-13 05:21:09,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 05:21:09,555 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 307 [2018-04-13 05:21:09,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:09,556 INFO L225 Difference]: With dead ends: 325 [2018-04-13 05:21:09,556 INFO L226 Difference]: Without dead ends: 325 [2018-04-13 05:21:09,556 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2150, Invalid=3702, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 05:21:09,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-04-13 05:21:09,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 321. [2018-04-13 05:21:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-04-13 05:21:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 322 transitions. [2018-04-13 05:21:09,559 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 322 transitions. Word has length 307 [2018-04-13 05:21:09,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:09,559 INFO L459 AbstractCegarLoop]: Abstraction has 321 states and 322 transitions. [2018-04-13 05:21:09,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 05:21:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 322 transitions. [2018-04-13 05:21:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-04-13 05:21:09,560 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:09,560 INFO L355 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:09,560 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:09,560 INFO L82 PathProgramCache]: Analyzing trace with hash -513089322, now seen corresponding path program 30 times [2018-04-13 05:21:09,560 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:09,560 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:09,561 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:09,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:09,561 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:09,577 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2018-04-13 05:21:09,938 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:09,938 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:09,938 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:21:09,978 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-04-13 05:21:09,979 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:09,987 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2018-04-13 05:21:10,509 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:10,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40] total 78 [2018-04-13 05:21:10,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-13 05:21:10,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-13 05:21:10,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2224, Invalid=3782, Unknown=0, NotChecked=0, Total=6006 [2018-04-13 05:21:10,510 INFO L87 Difference]: Start difference. First operand 321 states and 322 transitions. Second operand 78 states. [2018-04-13 05:21:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:10,823 INFO L93 Difference]: Finished difference Result 333 states and 334 transitions. [2018-04-13 05:21:10,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 05:21:10,824 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 315 [2018-04-13 05:21:10,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:10,825 INFO L225 Difference]: With dead ends: 333 [2018-04-13 05:21:10,825 INFO L226 Difference]: Without dead ends: 333 [2018-04-13 05:21:10,826 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 278 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2698 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2301, Invalid=3861, Unknown=0, NotChecked=0, Total=6162 [2018-04-13 05:21:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-13 05:21:10,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2018-04-13 05:21:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-04-13 05:21:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-04-13 05:21:10,829 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 315 [2018-04-13 05:21:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:10,829 INFO L459 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-04-13 05:21:10,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-13 05:21:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-04-13 05:21:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-04-13 05:21:10,830 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:10,830 INFO L355 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:10,831 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:10,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1685235382, now seen corresponding path program 31 times [2018-04-13 05:21:10,831 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:10,831 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:10,831 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:10,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:10,832 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:10,861 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2018-04-13 05:21:11,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:11,258 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:11,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:21:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:11,279 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2018-04-13 05:21:11,790 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:11,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41] total 80 [2018-04-13 05:21:11,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-13 05:21:11,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-13 05:21:11,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2341, Invalid=3979, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 05:21:11,792 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 80 states. [2018-04-13 05:21:12,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:12,195 INFO L93 Difference]: Finished difference Result 341 states and 342 transitions. [2018-04-13 05:21:12,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-13 05:21:12,195 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 323 [2018-04-13 05:21:12,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:12,196 INFO L225 Difference]: With dead ends: 341 [2018-04-13 05:21:12,196 INFO L226 Difference]: Without dead ends: 341 [2018-04-13 05:21:12,197 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2847 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2420, Invalid=4060, Unknown=0, NotChecked=0, Total=6480 [2018-04-13 05:21:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-04-13 05:21:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 337. [2018-04-13 05:21:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-04-13 05:21:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-04-13 05:21:12,200 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 323 [2018-04-13 05:21:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:12,200 INFO L459 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-04-13 05:21:12,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-13 05:21:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-04-13 05:21:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-04-13 05:21:12,202 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:12,202 INFO L355 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:12,202 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:12,202 INFO L82 PathProgramCache]: Analyzing trace with hash -485526122, now seen corresponding path program 32 times [2018-04-13 05:21:12,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:12,203 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:12,203 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:12,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:21:12,203 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:12,260 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2018-04-13 05:21:12,752 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:12,752 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:12,753 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:21:12,793 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:21:12,794 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:12,810 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2018-04-13 05:21:12,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:12,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 41] total 44 [2018-04-13 05:21:12,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 05:21:12,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 05:21:12,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=1027, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 05:21:12,852 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 44 states. [2018-04-13 05:21:13,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:13,524 INFO L93 Difference]: Finished difference Result 349 states and 350 transitions. [2018-04-13 05:21:13,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-13 05:21:13,524 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 331 [2018-04-13 05:21:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:13,525 INFO L225 Difference]: With dead ends: 349 [2018-04-13 05:21:13,525 INFO L226 Difference]: Without dead ends: 349 [2018-04-13 05:21:13,525 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2504, Invalid=4302, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 05:21:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-13 05:21:13,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2018-04-13 05:21:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-04-13 05:21:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 346 transitions. [2018-04-13 05:21:13,528 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 346 transitions. Word has length 331 [2018-04-13 05:21:13,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:13,528 INFO L459 AbstractCegarLoop]: Abstraction has 345 states and 346 transitions. [2018-04-13 05:21:13,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 05:21:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 346 transitions. [2018-04-13 05:21:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-04-13 05:21:13,529 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:13,529 INFO L355 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:13,529 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:13,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1334562166, now seen corresponding path program 33 times [2018-04-13 05:21:13,529 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:13,529 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:13,530 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:13,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:13,530 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:13,550 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2018-04-13 05:21:14,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:14,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:14,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:21:14,046 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-04-13 05:21:14,046 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:14,054 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2018-04-13 05:21:14,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:14,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 84 [2018-04-13 05:21:14,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-13 05:21:14,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-13 05:21:14,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2584, Invalid=4388, Unknown=0, NotChecked=0, Total=6972 [2018-04-13 05:21:14,652 INFO L87 Difference]: Start difference. First operand 345 states and 346 transitions. Second operand 84 states. [2018-04-13 05:21:14,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:14,991 INFO L93 Difference]: Finished difference Result 357 states and 358 transitions. [2018-04-13 05:21:14,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 05:21:14,991 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 339 [2018-04-13 05:21:14,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:14,992 INFO L225 Difference]: With dead ends: 357 [2018-04-13 05:21:14,992 INFO L226 Difference]: Without dead ends: 357 [2018-04-13 05:21:14,992 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3157 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2667, Invalid=4473, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 05:21:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-04-13 05:21:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 353. [2018-04-13 05:21:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-04-13 05:21:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 354 transitions. [2018-04-13 05:21:14,994 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 354 transitions. Word has length 339 [2018-04-13 05:21:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:14,994 INFO L459 AbstractCegarLoop]: Abstraction has 353 states and 354 transitions. [2018-04-13 05:21:14,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-13 05:21:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 354 transitions. [2018-04-13 05:21:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-04-13 05:21:14,995 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:14,996 INFO L355 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:14,996 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:14,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1947062698, now seen corresponding path program 34 times [2018-04-13 05:21:14,996 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:14,996 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:14,996 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:14,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:14,996 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:15,015 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 3200 trivial. 0 not checked. [2018-04-13 05:21:15,458 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:15,458 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:15,458 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:21:15,514 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:21:15,514 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:15,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:15,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:21:15,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:21:15,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:21:15,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:21:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3200 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:21:17,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:17,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 86] total 129 [2018-04-13 05:21:17,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-04-13 05:21:17,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-04-13 05:21:17,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3698, Invalid=12814, Unknown=0, NotChecked=0, Total=16512 [2018-04-13 05:21:17,837 INFO L87 Difference]: Start difference. First operand 353 states and 354 transitions. Second operand 129 states. [2018-04-13 05:21:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:19,157 INFO L93 Difference]: Finished difference Result 365 states and 366 transitions. [2018-04-13 05:21:19,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 05:21:19,157 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 347 [2018-04-13 05:21:19,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:19,158 INFO L225 Difference]: With dead ends: 365 [2018-04-13 05:21:19,158 INFO L226 Difference]: Without dead ends: 365 [2018-04-13 05:21:19,159 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12009 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=6460, Invalid=23296, Unknown=0, NotChecked=0, Total=29756 [2018-04-13 05:21:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-04-13 05:21:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 361. [2018-04-13 05:21:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-04-13 05:21:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 362 transitions. [2018-04-13 05:21:19,161 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 362 transitions. Word has length 347 [2018-04-13 05:21:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:19,161 INFO L459 AbstractCegarLoop]: Abstraction has 361 states and 362 transitions. [2018-04-13 05:21:19,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-04-13 05:21:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 362 transitions. [2018-04-13 05:21:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-04-13 05:21:19,162 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:19,162 INFO L355 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:19,162 INFO L408 AbstractCegarLoop]: === Iteration 47 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:19,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1978853322, now seen corresponding path program 35 times [2018-04-13 05:21:19,163 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:19,163 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:19,163 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:19,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:19,163 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:19,183 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2018-04-13 05:21:19,645 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:19,645 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:19,646 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:21:19,702 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-04-13 05:21:19,702 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:19,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2018-04-13 05:21:19,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:19,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44] total 47 [2018-04-13 05:21:19,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-13 05:21:19,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-13 05:21:19,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=1168, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 05:21:19,753 INFO L87 Difference]: Start difference. First operand 361 states and 362 transitions. Second operand 47 states. [2018-04-13 05:21:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:20,452 INFO L93 Difference]: Finished difference Result 373 states and 374 transitions. [2018-04-13 05:21:20,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-13 05:21:20,452 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 355 [2018-04-13 05:21:20,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:20,453 INFO L225 Difference]: With dead ends: 373 [2018-04-13 05:21:20,453 INFO L226 Difference]: Without dead ends: 373 [2018-04-13 05:21:20,453 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2885, Invalid=4947, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 05:21:20,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-04-13 05:21:20,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 369. [2018-04-13 05:21:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-04-13 05:21:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2018-04-13 05:21:20,456 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 355 [2018-04-13 05:21:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:20,456 INFO L459 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2018-04-13 05:21:20,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-13 05:21:20,456 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2018-04-13 05:21:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-04-13 05:21:20,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:20,457 INFO L355 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:20,457 INFO L408 AbstractCegarLoop]: === Iteration 48 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:20,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1801915158, now seen corresponding path program 36 times [2018-04-13 05:21:20,457 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:20,457 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:20,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:20,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:20,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:20,507 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2018-04-13 05:21:20,987 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:20,987 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:20,988 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:21:21,043 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-04-13 05:21:21,043 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:21,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2018-04-13 05:21:21,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:21,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46] total 90 [2018-04-13 05:21:21,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-04-13 05:21:21,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-04-13 05:21:21,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2971, Invalid=5039, Unknown=0, NotChecked=0, Total=8010 [2018-04-13 05:21:21,680 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 90 states. [2018-04-13 05:21:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:22,088 INFO L93 Difference]: Finished difference Result 381 states and 382 transitions. [2018-04-13 05:21:22,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-13 05:21:22,088 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 363 [2018-04-13 05:21:22,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:22,089 INFO L225 Difference]: With dead ends: 381 [2018-04-13 05:21:22,089 INFO L226 Difference]: Without dead ends: 381 [2018-04-13 05:21:22,090 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3652 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3060, Invalid=5130, Unknown=0, NotChecked=0, Total=8190 [2018-04-13 05:21:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-04-13 05:21:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2018-04-13 05:21:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-04-13 05:21:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 378 transitions. [2018-04-13 05:21:22,092 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 378 transitions. Word has length 363 [2018-04-13 05:21:22,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:22,092 INFO L459 AbstractCegarLoop]: Abstraction has 377 states and 378 transitions. [2018-04-13 05:21:22,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-04-13 05:21:22,092 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 378 transitions. [2018-04-13 05:21:22,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-04-13 05:21:22,093 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:22,093 INFO L355 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:22,094 INFO L408 AbstractCegarLoop]: === Iteration 49 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:22,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1588951306, now seen corresponding path program 37 times [2018-04-13 05:21:22,094 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:22,094 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:22,094 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:22,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:22,094 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:22,114 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2018-04-13 05:21:22,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:22,635 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:22,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:21:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:22,659 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2018-04-13 05:21:23,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:23,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47] total 92 [2018-04-13 05:21:23,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-13 05:21:23,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-13 05:21:23,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3106, Invalid=5266, Unknown=0, NotChecked=0, Total=8372 [2018-04-13 05:21:23,313 INFO L87 Difference]: Start difference. First operand 377 states and 378 transitions. Second operand 92 states. [2018-04-13 05:21:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:23,719 INFO L93 Difference]: Finished difference Result 389 states and 390 transitions. [2018-04-13 05:21:23,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 05:21:23,719 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 371 [2018-04-13 05:21:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:23,720 INFO L225 Difference]: With dead ends: 389 [2018-04-13 05:21:23,720 INFO L226 Difference]: Without dead ends: 389 [2018-04-13 05:21:23,721 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3825 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3197, Invalid=5359, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 05:21:23,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-04-13 05:21:23,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2018-04-13 05:21:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-13 05:21:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-04-13 05:21:23,723 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 371 [2018-04-13 05:21:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:23,724 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-04-13 05:21:23,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-13 05:21:23,724 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-04-13 05:21:23,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-04-13 05:21:23,725 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:23,725 INFO L355 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:23,725 INFO L408 AbstractCegarLoop]: === Iteration 50 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:23,725 INFO L82 PathProgramCache]: Analyzing trace with hash 214043606, now seen corresponding path program 38 times [2018-04-13 05:21:23,725 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:23,725 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:23,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:23,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:21:23,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:23,749 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2018-04-13 05:21:24,293 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:24,293 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:24,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:21:24,323 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:21:24,323 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:24,329 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2018-04-13 05:21:24,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:24,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 47] total 50 [2018-04-13 05:21:24,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-13 05:21:24,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-13 05:21:24,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1132, Invalid=1318, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 05:21:24,446 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 50 states. [2018-04-13 05:21:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:25,194 INFO L93 Difference]: Finished difference Result 397 states and 398 transitions. [2018-04-13 05:21:25,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-13 05:21:25,195 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 379 [2018-04-13 05:21:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:25,195 INFO L225 Difference]: With dead ends: 397 [2018-04-13 05:21:25,196 INFO L226 Difference]: Without dead ends: 397 [2018-04-13 05:21:25,196 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3293, Invalid=5637, Unknown=0, NotChecked=0, Total=8930 [2018-04-13 05:21:25,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-04-13 05:21:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 393. [2018-04-13 05:21:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-04-13 05:21:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 394 transitions. [2018-04-13 05:21:25,199 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 394 transitions. Word has length 379 [2018-04-13 05:21:25,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:25,199 INFO L459 AbstractCegarLoop]: Abstraction has 393 states and 394 transitions. [2018-04-13 05:21:25,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-13 05:21:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 394 transitions. [2018-04-13 05:21:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-04-13 05:21:25,200 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:25,200 INFO L355 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:25,200 INFO L408 AbstractCegarLoop]: === Iteration 51 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:25,200 INFO L82 PathProgramCache]: Analyzing trace with hash 513284534, now seen corresponding path program 39 times [2018-04-13 05:21:25,200 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:25,200 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:25,201 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:25,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:25,201 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:25,224 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2018-04-13 05:21:25,757 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:25,757 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:25,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:21:25,814 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-04-13 05:21:25,814 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:25,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2018-04-13 05:21:25,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:25,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 48] total 51 [2018-04-13 05:21:25,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-13 05:21:25,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-13 05:21:25,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1180, Invalid=1370, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 05:21:25,881 INFO L87 Difference]: Start difference. First operand 393 states and 394 transitions. Second operand 51 states. [2018-04-13 05:21:26,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:26,697 INFO L93 Difference]: Finished difference Result 405 states and 406 transitions. [2018-04-13 05:21:26,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-13 05:21:26,697 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 387 [2018-04-13 05:21:26,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:26,697 INFO L225 Difference]: With dead ends: 405 [2018-04-13 05:21:26,698 INFO L226 Difference]: Without dead ends: 405 [2018-04-13 05:21:26,698 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3435, Invalid=5877, Unknown=0, NotChecked=0, Total=9312 [2018-04-13 05:21:26,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-04-13 05:21:26,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 401. [2018-04-13 05:21:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-04-13 05:21:26,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 402 transitions. [2018-04-13 05:21:26,700 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 402 transitions. Word has length 387 [2018-04-13 05:21:26,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:26,700 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 402 transitions. [2018-04-13 05:21:26,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-13 05:21:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 402 transitions. [2018-04-13 05:21:26,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-04-13 05:21:26,701 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:26,701 INFO L355 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:26,701 INFO L408 AbstractCegarLoop]: === Iteration 52 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:26,702 INFO L82 PathProgramCache]: Analyzing trace with hash -145280874, now seen corresponding path program 40 times [2018-04-13 05:21:26,702 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:26,702 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:26,702 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:26,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:26,702 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:26,726 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2018-04-13 05:21:27,296 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:27,296 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:27,297 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:21:27,365 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:21:27,365 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:27,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:27,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:21:27,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:21:27,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:21:27,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:21:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4232 proven. 4232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:21:30,408 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:30,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 98] total 147 [2018-04-13 05:21:30,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-04-13 05:21:30,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-04-13 05:21:30,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4802, Invalid=16660, Unknown=0, NotChecked=0, Total=21462 [2018-04-13 05:21:30,410 INFO L87 Difference]: Start difference. First operand 401 states and 402 transitions. Second operand 147 states. [2018-04-13 05:21:32,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:32,024 INFO L93 Difference]: Finished difference Result 413 states and 414 transitions. [2018-04-13 05:21:32,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-13 05:21:32,024 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 395 [2018-04-13 05:21:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:32,025 INFO L225 Difference]: With dead ends: 413 [2018-04-13 05:21:32,025 INFO L226 Difference]: Without dead ends: 413 [2018-04-13 05:21:32,027 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15741 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=8389, Invalid=30223, Unknown=0, NotChecked=0, Total=38612 [2018-04-13 05:21:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-13 05:21:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 409. [2018-04-13 05:21:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-04-13 05:21:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 410 transitions. [2018-04-13 05:21:32,029 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 410 transitions. Word has length 395 [2018-04-13 05:21:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:32,029 INFO L459 AbstractCegarLoop]: Abstraction has 409 states and 410 transitions. [2018-04-13 05:21:32,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-04-13 05:21:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 410 transitions. [2018-04-13 05:21:32,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-04-13 05:21:32,030 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:32,030 INFO L355 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:32,030 INFO L408 AbstractCegarLoop]: === Iteration 53 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:32,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2025205642, now seen corresponding path program 41 times [2018-04-13 05:21:32,031 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:32,031 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:32,031 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:32,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:32,032 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:32,067 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2018-04-13 05:21:32,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:32,747 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:32,747 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:21:32,830 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-04-13 05:21:32,831 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:32,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2018-04-13 05:21:32,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:32,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 50] total 53 [2018-04-13 05:21:32,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-13 05:21:32,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-13 05:21:32,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=1477, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 05:21:32,905 INFO L87 Difference]: Start difference. First operand 409 states and 410 transitions. Second operand 53 states. [2018-04-13 05:21:33,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:33,770 INFO L93 Difference]: Finished difference Result 421 states and 422 transitions. [2018-04-13 05:21:33,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-13 05:21:33,770 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 403 [2018-04-13 05:21:33,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:33,771 INFO L225 Difference]: With dead ends: 421 [2018-04-13 05:21:33,771 INFO L226 Difference]: Without dead ends: 421 [2018-04-13 05:21:33,772 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3728, Invalid=6372, Unknown=0, NotChecked=0, Total=10100 [2018-04-13 05:21:33,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-04-13 05:21:33,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 417. [2018-04-13 05:21:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-04-13 05:21:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2018-04-13 05:21:33,776 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 403 [2018-04-13 05:21:33,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:33,777 INFO L459 AbstractCegarLoop]: Abstraction has 417 states and 418 transitions. [2018-04-13 05:21:33,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-13 05:21:33,777 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 418 transitions. [2018-04-13 05:21:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-04-13 05:21:33,779 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:33,780 INFO L355 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:33,780 INFO L408 AbstractCegarLoop]: === Iteration 54 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:33,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1367705258, now seen corresponding path program 42 times [2018-04-13 05:21:33,780 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:33,781 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:33,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:33,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:33,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:33,819 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:34,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2018-04-13 05:21:34,522 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:34,522 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:34,523 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:21:34,648 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-04-13 05:21:34,648 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:34,663 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2018-04-13 05:21:35,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:35,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52] total 102 [2018-04-13 05:21:35,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-04-13 05:21:35,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-04-13 05:21:35,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3826, Invalid=6476, Unknown=0, NotChecked=0, Total=10302 [2018-04-13 05:21:35,479 INFO L87 Difference]: Start difference. First operand 417 states and 418 transitions. Second operand 102 states. [2018-04-13 05:21:35,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:35,941 INFO L93 Difference]: Finished difference Result 429 states and 430 transitions. [2018-04-13 05:21:35,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-13 05:21:35,941 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 411 [2018-04-13 05:21:35,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:35,942 INFO L225 Difference]: With dead ends: 429 [2018-04-13 05:21:35,942 INFO L226 Difference]: Without dead ends: 429 [2018-04-13 05:21:35,942 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 362 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4750 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3927, Invalid=6579, Unknown=0, NotChecked=0, Total=10506 [2018-04-13 05:21:35,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-04-13 05:21:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 425. [2018-04-13 05:21:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-04-13 05:21:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 426 transitions. [2018-04-13 05:21:35,945 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 426 transitions. Word has length 411 [2018-04-13 05:21:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:35,945 INFO L459 AbstractCegarLoop]: Abstraction has 425 states and 426 transitions. [2018-04-13 05:21:35,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-04-13 05:21:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 426 transitions. [2018-04-13 05:21:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-04-13 05:21:35,946 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:35,946 INFO L355 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:35,946 INFO L408 AbstractCegarLoop]: === Iteration 55 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:35,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1555278646, now seen corresponding path program 43 times [2018-04-13 05:21:35,946 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:35,947 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:35,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:35,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:35,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:35,975 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2018-04-13 05:21:36,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:36,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:36,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:21:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:36,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2018-04-13 05:21:37,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:37,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53] total 104 [2018-04-13 05:21:37,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-04-13 05:21:37,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-04-13 05:21:37,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3979, Invalid=6733, Unknown=0, NotChecked=0, Total=10712 [2018-04-13 05:21:37,569 INFO L87 Difference]: Start difference. First operand 425 states and 426 transitions. Second operand 104 states. [2018-04-13 05:21:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:38,120 INFO L93 Difference]: Finished difference Result 437 states and 438 transitions. [2018-04-13 05:21:38,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-13 05:21:38,120 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 419 [2018-04-13 05:21:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:38,121 INFO L225 Difference]: With dead ends: 437 [2018-04-13 05:21:38,121 INFO L226 Difference]: Without dead ends: 437 [2018-04-13 05:21:38,121 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 369 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4947 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4082, Invalid=6838, Unknown=0, NotChecked=0, Total=10920 [2018-04-13 05:21:38,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-04-13 05:21:38,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2018-04-13 05:21:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-13 05:21:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 434 transitions. [2018-04-13 05:21:38,124 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 434 transitions. Word has length 419 [2018-04-13 05:21:38,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:38,124 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 434 transitions. [2018-04-13 05:21:38,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-04-13 05:21:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 434 transitions. [2018-04-13 05:21:38,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-04-13 05:21:38,125 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:38,125 INFO L355 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:38,125 INFO L408 AbstractCegarLoop]: === Iteration 56 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:38,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1317018090, now seen corresponding path program 44 times [2018-04-13 05:21:38,125 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:38,125 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:38,126 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:38,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:21:38,126 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:38,152 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2018-04-13 05:21:38,933 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:38,933 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:38,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:21:38,969 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:21:38,970 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:38,976 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2018-04-13 05:21:39,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:39,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 53] total 56 [2018-04-13 05:21:39,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-13 05:21:39,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-13 05:21:39,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1435, Invalid=1645, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 05:21:39,041 INFO L87 Difference]: Start difference. First operand 433 states and 434 transitions. Second operand 56 states. [2018-04-13 05:21:40,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:40,081 INFO L93 Difference]: Finished difference Result 445 states and 446 transitions. [2018-04-13 05:21:40,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-13 05:21:40,081 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 427 [2018-04-13 05:21:40,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:40,082 INFO L225 Difference]: With dead ends: 445 [2018-04-13 05:21:40,082 INFO L226 Difference]: Without dead ends: 445 [2018-04-13 05:21:40,083 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4190, Invalid=7152, Unknown=0, NotChecked=0, Total=11342 [2018-04-13 05:21:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-04-13 05:21:40,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 441. [2018-04-13 05:21:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-04-13 05:21:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 442 transitions. [2018-04-13 05:21:40,085 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 442 transitions. Word has length 427 [2018-04-13 05:21:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:40,085 INFO L459 AbstractCegarLoop]: Abstraction has 441 states and 442 transitions. [2018-04-13 05:21:40,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-13 05:21:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 442 transitions. [2018-04-13 05:21:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-04-13 05:21:40,087 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:40,087 INFO L355 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:40,087 INFO L408 AbstractCegarLoop]: === Iteration 57 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:40,087 INFO L82 PathProgramCache]: Analyzing trace with hash 472492534, now seen corresponding path program 45 times [2018-04-13 05:21:40,087 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:40,087 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:40,088 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:40,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:40,088 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:40,117 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2018-04-13 05:21:40,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:40,873 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:40,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:21:40,942 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-04-13 05:21:40,942 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:40,969 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2018-04-13 05:21:41,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:41,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55] total 108 [2018-04-13 05:21:41,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-04-13 05:21:41,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-04-13 05:21:41,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4294, Invalid=7262, Unknown=0, NotChecked=0, Total=11556 [2018-04-13 05:21:41,861 INFO L87 Difference]: Start difference. First operand 441 states and 442 transitions. Second operand 108 states. [2018-04-13 05:21:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:42,555 INFO L93 Difference]: Finished difference Result 453 states and 454 transitions. [2018-04-13 05:21:42,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-13 05:21:42,555 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 435 [2018-04-13 05:21:42,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:42,556 INFO L225 Difference]: With dead ends: 453 [2018-04-13 05:21:42,556 INFO L226 Difference]: Without dead ends: 453 [2018-04-13 05:21:42,556 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 383 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5353 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4401, Invalid=7371, Unknown=0, NotChecked=0, Total=11772 [2018-04-13 05:21:42,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-04-13 05:21:42,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2018-04-13 05:21:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-04-13 05:21:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 450 transitions. [2018-04-13 05:21:42,559 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 450 transitions. Word has length 435 [2018-04-13 05:21:42,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:42,559 INFO L459 AbstractCegarLoop]: Abstraction has 449 states and 450 transitions. [2018-04-13 05:21:42,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-04-13 05:21:42,559 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 450 transitions. [2018-04-13 05:21:42,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-04-13 05:21:42,560 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:42,560 INFO L355 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:42,560 INFO L408 AbstractCegarLoop]: === Iteration 58 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:42,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2075883222, now seen corresponding path program 46 times [2018-04-13 05:21:42,560 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:42,560 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:42,561 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:42,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:42,561 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:42,588 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 5408 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2018-04-13 05:21:43,299 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:43,299 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:43,299 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:21:43,392 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:21:43,392 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:43,407 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:43,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:21:43,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:21:43,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:21:43,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:21:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 5408 proven. 5408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:21:47,149 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:47,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 110] total 165 [2018-04-13 05:21:47,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-04-13 05:21:47,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-04-13 05:21:47,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6050, Invalid=21010, Unknown=0, NotChecked=0, Total=27060 [2018-04-13 05:21:47,151 INFO L87 Difference]: Start difference. First operand 449 states and 450 transitions. Second operand 165 states. [2018-04-13 05:21:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:48,982 INFO L93 Difference]: Finished difference Result 461 states and 462 transitions. [2018-04-13 05:21:48,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-13 05:21:48,982 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 443 [2018-04-13 05:21:48,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:48,983 INFO L225 Difference]: With dead ends: 461 [2018-04-13 05:21:48,983 INFO L226 Difference]: Without dead ends: 461 [2018-04-13 05:21:48,985 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19977 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=10570, Invalid=38050, Unknown=0, NotChecked=0, Total=48620 [2018-04-13 05:21:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-04-13 05:21:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 457. [2018-04-13 05:21:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-04-13 05:21:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 458 transitions. [2018-04-13 05:21:48,987 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 458 transitions. Word has length 443 [2018-04-13 05:21:48,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:48,987 INFO L459 AbstractCegarLoop]: Abstraction has 457 states and 458 transitions. [2018-04-13 05:21:48,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-04-13 05:21:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 458 transitions. [2018-04-13 05:21:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-04-13 05:21:48,989 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:48,989 INFO L355 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:48,989 INFO L408 AbstractCegarLoop]: === Iteration 59 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:48,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1056951478, now seen corresponding path program 47 times [2018-04-13 05:21:48,989 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:48,989 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:48,990 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:48,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:48,990 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:49,021 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2018-04-13 05:21:49,942 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:49,942 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:49,942 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:21:50,048 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-04-13 05:21:50,048 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:50,054 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2018-04-13 05:21:50,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:50,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 56] total 59 [2018-04-13 05:21:50,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-13 05:21:50,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-13 05:21:50,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1600, Invalid=1822, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 05:21:50,126 INFO L87 Difference]: Start difference. First operand 457 states and 458 transitions. Second operand 59 states. [2018-04-13 05:21:51,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:51,152 INFO L93 Difference]: Finished difference Result 469 states and 470 transitions. [2018-04-13 05:21:51,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-13 05:21:51,153 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 451 [2018-04-13 05:21:51,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:51,154 INFO L225 Difference]: With dead ends: 469 [2018-04-13 05:21:51,154 INFO L226 Difference]: Without dead ends: 469 [2018-04-13 05:21:51,154 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4679, Invalid=7977, Unknown=0, NotChecked=0, Total=12656 [2018-04-13 05:21:51,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-04-13 05:21:51,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 465. [2018-04-13 05:21:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-04-13 05:21:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 466 transitions. [2018-04-13 05:21:51,157 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 466 transitions. Word has length 451 [2018-04-13 05:21:51,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:51,157 INFO L459 AbstractCegarLoop]: Abstraction has 465 states and 466 transitions. [2018-04-13 05:21:51,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-13 05:21:51,157 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 466 transitions. [2018-04-13 05:21:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-04-13 05:21:51,158 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:51,159 INFO L355 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:51,159 INFO L408 AbstractCegarLoop]: === Iteration 60 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:51,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2071909482, now seen corresponding path program 48 times [2018-04-13 05:21:51,159 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:51,159 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:51,159 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:51,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:51,159 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:51,190 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2018-04-13 05:21:51,961 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:51,961 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:51,961 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:21:52,139 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-04-13 05:21:52,139 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:52,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2018-04-13 05:21:53,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:53,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58] total 114 [2018-04-13 05:21:53,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-04-13 05:21:53,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-04-13 05:21:53,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4789, Invalid=8093, Unknown=0, NotChecked=0, Total=12882 [2018-04-13 05:21:53,167 INFO L87 Difference]: Start difference. First operand 465 states and 466 transitions. Second operand 114 states. [2018-04-13 05:21:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:53,758 INFO L93 Difference]: Finished difference Result 477 states and 478 transitions. [2018-04-13 05:21:53,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-13 05:21:53,758 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 459 [2018-04-13 05:21:53,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:53,759 INFO L225 Difference]: With dead ends: 477 [2018-04-13 05:21:53,759 INFO L226 Difference]: Without dead ends: 477 [2018-04-13 05:21:53,760 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 404 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5992 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4902, Invalid=8208, Unknown=0, NotChecked=0, Total=13110 [2018-04-13 05:21:53,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-04-13 05:21:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 473. [2018-04-13 05:21:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-04-13 05:21:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 474 transitions. [2018-04-13 05:21:53,762 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 474 transitions. Word has length 459 [2018-04-13 05:21:53,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:53,762 INFO L459 AbstractCegarLoop]: Abstraction has 473 states and 474 transitions. [2018-04-13 05:21:53,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-04-13 05:21:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 474 transitions. [2018-04-13 05:21:53,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-04-13 05:21:53,764 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:53,764 INFO L355 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:53,764 INFO L408 AbstractCegarLoop]: === Iteration 61 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:53,764 INFO L82 PathProgramCache]: Analyzing trace with hash 982127478, now seen corresponding path program 49 times [2018-04-13 05:21:53,764 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:53,764 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:53,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:53,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:53,765 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:53,796 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2018-04-13 05:21:54,594 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:54,594 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:54,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:21:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:54,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:55,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2018-04-13 05:21:55,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:55,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59] total 116 [2018-04-13 05:21:55,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-04-13 05:21:55,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-04-13 05:21:55,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4960, Invalid=8380, Unknown=0, NotChecked=0, Total=13340 [2018-04-13 05:21:55,646 INFO L87 Difference]: Start difference. First operand 473 states and 474 transitions. Second operand 116 states. [2018-04-13 05:21:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:56,193 INFO L93 Difference]: Finished difference Result 485 states and 486 transitions. [2018-04-13 05:21:56,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-13 05:21:56,194 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 467 [2018-04-13 05:21:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:56,195 INFO L225 Difference]: With dead ends: 485 [2018-04-13 05:21:56,195 INFO L226 Difference]: Without dead ends: 485 [2018-04-13 05:21:56,195 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6213 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=5075, Invalid=8497, Unknown=0, NotChecked=0, Total=13572 [2018-04-13 05:21:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-04-13 05:21:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 481. [2018-04-13 05:21:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-04-13 05:21:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 482 transitions. [2018-04-13 05:21:56,198 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 482 transitions. Word has length 467 [2018-04-13 05:21:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:56,198 INFO L459 AbstractCegarLoop]: Abstraction has 481 states and 482 transitions. [2018-04-13 05:21:56,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-04-13 05:21:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 482 transitions. [2018-04-13 05:21:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2018-04-13 05:21:56,199 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:56,199 INFO L355 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:56,199 INFO L408 AbstractCegarLoop]: === Iteration 62 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:56,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1059390550, now seen corresponding path program 50 times [2018-04-13 05:21:56,200 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:56,200 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:56,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:56,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:21:56,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:56,231 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2018-04-13 05:21:57,062 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:57,062 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:57,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:21:57,104 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:21:57,104 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:57,112 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2018-04-13 05:21:57,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:57,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 59] total 62 [2018-04-13 05:21:57,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-13 05:21:57,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-13 05:21:57,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1774, Invalid=2008, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 05:21:57,190 INFO L87 Difference]: Start difference. First operand 481 states and 482 transitions. Second operand 62 states. [2018-04-13 05:21:58,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:21:58,311 INFO L93 Difference]: Finished difference Result 493 states and 494 transitions. [2018-04-13 05:21:58,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-13 05:21:58,311 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 475 [2018-04-13 05:21:58,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:21:58,312 INFO L225 Difference]: With dead ends: 493 [2018-04-13 05:21:58,312 INFO L226 Difference]: Without dead ends: 493 [2018-04-13 05:21:58,313 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=5195, Invalid=8847, Unknown=0, NotChecked=0, Total=14042 [2018-04-13 05:21:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-04-13 05:21:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 489. [2018-04-13 05:21:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-04-13 05:21:58,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 490 transitions. [2018-04-13 05:21:58,316 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 490 transitions. Word has length 475 [2018-04-13 05:21:58,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:21:58,316 INFO L459 AbstractCegarLoop]: Abstraction has 489 states and 490 transitions. [2018-04-13 05:21:58,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-13 05:21:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 490 transitions. [2018-04-13 05:21:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-04-13 05:21:58,317 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:21:58,317 INFO L355 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:21:58,317 INFO L408 AbstractCegarLoop]: === Iteration 63 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:21:58,318 INFO L82 PathProgramCache]: Analyzing trace with hash -2145616330, now seen corresponding path program 51 times [2018-04-13 05:21:58,318 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:21:58,318 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:21:58,318 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:58,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:21:58,319 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:21:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:21:58,357 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:21:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2018-04-13 05:21:59,207 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:21:59,207 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:21:59,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:21:59,297 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-04-13 05:21:59,297 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:21:59,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:21:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2018-04-13 05:21:59,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:21:59,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 60] total 63 [2018-04-13 05:21:59,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-13 05:21:59,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-13 05:21:59,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2018-04-13 05:21:59,469 INFO L87 Difference]: Start difference. First operand 489 states and 490 transitions. Second operand 63 states. [2018-04-13 05:22:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:22:00,627 INFO L93 Difference]: Finished difference Result 501 states and 502 transitions. [2018-04-13 05:22:00,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-13 05:22:00,627 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 483 [2018-04-13 05:22:00,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:22:00,628 INFO L225 Difference]: With dead ends: 501 [2018-04-13 05:22:00,628 INFO L226 Difference]: Without dead ends: 501 [2018-04-13 05:22:00,629 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1878 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=5373, Invalid=9147, Unknown=0, NotChecked=0, Total=14520 [2018-04-13 05:22:00,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-04-13 05:22:00,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 497. [2018-04-13 05:22:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-04-13 05:22:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 498 transitions. [2018-04-13 05:22:00,632 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 498 transitions. Word has length 483 [2018-04-13 05:22:00,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:22:00,632 INFO L459 AbstractCegarLoop]: Abstraction has 497 states and 498 transitions. [2018-04-13 05:22:00,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-13 05:22:00,632 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 498 transitions. [2018-04-13 05:22:00,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2018-04-13 05:22:00,633 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:22:00,634 INFO L355 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:22:00,634 INFO L408 AbstractCegarLoop]: === Iteration 64 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:22:00,634 INFO L82 PathProgramCache]: Analyzing trace with hash 452657430, now seen corresponding path program 52 times [2018-04-13 05:22:00,634 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:22:00,634 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:22:00,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:00,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:22:00,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:22:00,701 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:22:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 6728 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked. [2018-04-13 05:22:01,575 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:22:01,575 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:22:01,575 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:22:01,691 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:22:01,691 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:22:01,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:22:01,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:22:01,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:22:01,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:22:01,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:22:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 6728 proven. 6728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:22:06,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:22:06,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 122] total 183 [2018-04-13 05:22:06,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-04-13 05:22:06,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-04-13 05:22:06,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7442, Invalid=25864, Unknown=0, NotChecked=0, Total=33306 [2018-04-13 05:22:06,460 INFO L87 Difference]: Start difference. First operand 497 states and 498 transitions. Second operand 183 states. [2018-04-13 05:22:08,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:22:08,806 INFO L93 Difference]: Finished difference Result 509 states and 510 transitions. [2018-04-13 05:22:08,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-13 05:22:08,806 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 491 [2018-04-13 05:22:08,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:22:08,807 INFO L225 Difference]: With dead ends: 509 [2018-04-13 05:22:08,807 INFO L226 Difference]: Without dead ends: 509 [2018-04-13 05:22:08,808 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24717 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=13003, Invalid=46777, Unknown=0, NotChecked=0, Total=59780 [2018-04-13 05:22:08,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-04-13 05:22:08,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 505. [2018-04-13 05:22:08,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-04-13 05:22:08,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 506 transitions. [2018-04-13 05:22:08,811 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 506 transitions. Word has length 491 [2018-04-13 05:22:08,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:22:08,811 INFO L459 AbstractCegarLoop]: Abstraction has 505 states and 506 transitions. [2018-04-13 05:22:08,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-04-13 05:22:08,811 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 506 transitions. [2018-04-13 05:22:08,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-04-13 05:22:08,812 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:22:08,813 INFO L355 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:22:08,813 INFO L408 AbstractCegarLoop]: === Iteration 65 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:22:08,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2097876214, now seen corresponding path program 53 times [2018-04-13 05:22:08,813 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:22:08,813 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:22:08,813 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:08,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:22:08,813 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:22:08,848 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:22:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2018-04-13 05:22:09,769 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:22:09,769 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:22:09,769 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:22:09,890 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-04-13 05:22:09,890 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:22:09,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:22:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2018-04-13 05:22:09,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:22:09,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 62] total 65 [2018-04-13 05:22:09,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-13 05:22:09,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-13 05:22:09,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 05:22:09,984 INFO L87 Difference]: Start difference. First operand 505 states and 506 transitions. Second operand 65 states. [2018-04-13 05:22:11,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:22:11,200 INFO L93 Difference]: Finished difference Result 517 states and 518 transitions. [2018-04-13 05:22:11,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-13 05:22:11,200 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 499 [2018-04-13 05:22:11,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:22:11,201 INFO L225 Difference]: With dead ends: 517 [2018-04-13 05:22:11,201 INFO L226 Difference]: Without dead ends: 517 [2018-04-13 05:22:11,202 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 559 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2003 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5738, Invalid=9762, Unknown=0, NotChecked=0, Total=15500 [2018-04-13 05:22:11,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-04-13 05:22:11,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 513. [2018-04-13 05:22:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-04-13 05:22:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 514 transitions. [2018-04-13 05:22:11,205 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 514 transitions. Word has length 499 [2018-04-13 05:22:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:22:11,205 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 514 transitions. [2018-04-13 05:22:11,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-13 05:22:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 514 transitions. [2018-04-13 05:22:11,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-04-13 05:22:11,207 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:22:11,207 INFO L355 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:22:11,207 INFO L408 AbstractCegarLoop]: === Iteration 66 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:22:11,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2091441706, now seen corresponding path program 54 times [2018-04-13 05:22:11,207 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:22:11,207 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:22:11,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:11,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:22:11,208 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:22:11,248 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:22:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2018-04-13 05:22:12,186 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:22:12,186 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:22:12,186 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:22:12,291 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-04-13 05:22:12,291 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:22:12,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:22:12,396 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2018-04-13 05:22:12,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:22:12,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 63] total 66 [2018-04-13 05:22:12,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-13 05:22:12,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-13 05:22:12,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2020, Invalid=2270, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 05:22:12,398 INFO L87 Difference]: Start difference. First operand 513 states and 514 transitions. Second operand 66 states. [2018-04-13 05:22:13,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:22:13,631 INFO L93 Difference]: Finished difference Result 525 states and 526 transitions. [2018-04-13 05:22:13,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-13 05:22:13,631 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 507 [2018-04-13 05:22:13,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:22:13,632 INFO L225 Difference]: With dead ends: 525 [2018-04-13 05:22:13,632 INFO L226 Difference]: Without dead ends: 525 [2018-04-13 05:22:13,633 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5925, Invalid=10077, Unknown=0, NotChecked=0, Total=16002 [2018-04-13 05:22:13,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-04-13 05:22:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 521. [2018-04-13 05:22:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-04-13 05:22:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 522 transitions. [2018-04-13 05:22:13,635 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 522 transitions. Word has length 507 [2018-04-13 05:22:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:22:13,635 INFO L459 AbstractCegarLoop]: Abstraction has 521 states and 522 transitions. [2018-04-13 05:22:13,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-13 05:22:13,635 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 522 transitions. [2018-04-13 05:22:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-04-13 05:22:13,637 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:22:13,637 INFO L355 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:22:13,637 INFO L408 AbstractCegarLoop]: === Iteration 67 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:22:13,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1700151370, now seen corresponding path program 55 times [2018-04-13 05:22:13,637 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:22:13,637 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:22:13,638 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:13,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:22:13,638 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:22:13,677 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:22:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 7442 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2018-04-13 05:22:14,659 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:22:14,659 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:22:14,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:22:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:22:14,695 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:22:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 7442 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2018-04-13 05:22:15,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:22:15,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65] total 128 [2018-04-13 05:22:15,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-04-13 05:22:15,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-04-13 05:22:15,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6049, Invalid=10207, Unknown=0, NotChecked=0, Total=16256 [2018-04-13 05:22:15,853 INFO L87 Difference]: Start difference. First operand 521 states and 522 transitions. Second operand 128 states. [2018-04-13 05:22:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:22:16,565 INFO L93 Difference]: Finished difference Result 533 states and 534 transitions. [2018-04-13 05:22:16,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-13 05:22:16,565 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 515 [2018-04-13 05:22:16,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:22:16,566 INFO L225 Difference]: With dead ends: 533 [2018-04-13 05:22:16,566 INFO L226 Difference]: Without dead ends: 533 [2018-04-13 05:22:16,567 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 453 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7623 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=6176, Invalid=10336, Unknown=0, NotChecked=0, Total=16512 [2018-04-13 05:22:16,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-04-13 05:22:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 529. [2018-04-13 05:22:16,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-04-13 05:22:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 530 transitions. [2018-04-13 05:22:16,569 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 530 transitions. Word has length 515 [2018-04-13 05:22:16,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:22:16,569 INFO L459 AbstractCegarLoop]: Abstraction has 529 states and 530 transitions. [2018-04-13 05:22:16,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-04-13 05:22:16,570 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 530 transitions. [2018-04-13 05:22:16,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-04-13 05:22:16,571 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:22:16,571 INFO L355 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:22:16,571 INFO L408 AbstractCegarLoop]: === Iteration 68 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:22:16,571 INFO L82 PathProgramCache]: Analyzing trace with hash -544381290, now seen corresponding path program 56 times [2018-04-13 05:22:16,571 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:22:16,572 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:22:16,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:16,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:22:16,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:22:16,612 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:22:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2018-04-13 05:22:17,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:22:17,627 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:22:17,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:22:17,677 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:22:17,678 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:22:17,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:22:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2018-04-13 05:22:17,781 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:22:17,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 65] total 68 [2018-04-13 05:22:17,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-13 05:22:17,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-13 05:22:17,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2149, Invalid=2407, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 05:22:17,783 INFO L87 Difference]: Start difference. First operand 529 states and 530 transitions. Second operand 68 states. [2018-04-13 05:22:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:22:19,117 INFO L93 Difference]: Finished difference Result 541 states and 542 transitions. [2018-04-13 05:22:19,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-13 05:22:19,117 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 523 [2018-04-13 05:22:19,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:22:19,118 INFO L225 Difference]: With dead ends: 541 [2018-04-13 05:22:19,118 INFO L226 Difference]: Without dead ends: 541 [2018-04-13 05:22:19,119 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 715 GetRequests, 586 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2198 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=6308, Invalid=10722, Unknown=0, NotChecked=0, Total=17030 [2018-04-13 05:22:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-04-13 05:22:19,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 537. [2018-04-13 05:22:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-04-13 05:22:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 538 transitions. [2018-04-13 05:22:19,121 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 538 transitions. Word has length 523 [2018-04-13 05:22:19,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:22:19,122 INFO L459 AbstractCegarLoop]: Abstraction has 537 states and 538 transitions. [2018-04-13 05:22:19,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-13 05:22:19,122 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 538 transitions. [2018-04-13 05:22:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-04-13 05:22:19,124 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:22:19,124 INFO L355 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:22:19,124 INFO L408 AbstractCegarLoop]: === Iteration 69 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:22:19,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1045206646, now seen corresponding path program 57 times [2018-04-13 05:22:19,124 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:22:19,124 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:22:19,125 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:19,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:22:19,125 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:22:19,167 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:22:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 7938 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2018-04-13 05:22:20,214 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:22:20,214 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:22:20,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:22:20,319 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-04-13 05:22:20,320 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:22:20,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:22:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 7938 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2018-04-13 05:22:21,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:22:21,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67] total 132 [2018-04-13 05:22:21,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-04-13 05:22:21,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-04-13 05:22:21,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6436, Invalid=10856, Unknown=0, NotChecked=0, Total=17292 [2018-04-13 05:22:21,619 INFO L87 Difference]: Start difference. First operand 537 states and 538 transitions. Second operand 132 states. [2018-04-13 05:22:22,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:22:22,452 INFO L93 Difference]: Finished difference Result 549 states and 550 transitions. [2018-04-13 05:22:22,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-13 05:22:22,452 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 531 [2018-04-13 05:22:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:22:22,453 INFO L225 Difference]: With dead ends: 549 [2018-04-13 05:22:22,454 INFO L226 Difference]: Without dead ends: 549 [2018-04-13 05:22:22,454 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 467 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8125 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=6567, Invalid=10989, Unknown=0, NotChecked=0, Total=17556 [2018-04-13 05:22:22,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-04-13 05:22:22,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 545. [2018-04-13 05:22:22,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-04-13 05:22:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 546 transitions. [2018-04-13 05:22:22,457 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 546 transitions. Word has length 531 [2018-04-13 05:22:22,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:22:22,457 INFO L459 AbstractCegarLoop]: Abstraction has 545 states and 546 transitions. [2018-04-13 05:22:22,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-04-13 05:22:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 546 transitions. [2018-04-13 05:22:22,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2018-04-13 05:22:22,459 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:22:22,459 INFO L355 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:22:22,459 INFO L408 AbstractCegarLoop]: === Iteration 70 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:22:22,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1829646506, now seen corresponding path program 58 times [2018-04-13 05:22:22,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:22:22,459 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:22:22,459 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:22,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:22:22,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:22:22,502 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:22:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 0 proven. 8192 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2018-04-13 05:22:23,579 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:22:23,580 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:22:23,580 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:22:23,715 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:22:23,716 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:22:23,737 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:22:23,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:22:23,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:22:23,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:22:23,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:22:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 8192 proven. 8192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:22:29,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:22:29,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 134] total 201 [2018-04-13 05:22:29,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-04-13 05:22:29,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-04-13 05:22:29,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8978, Invalid=31222, Unknown=0, NotChecked=0, Total=40200 [2018-04-13 05:22:29,102 INFO L87 Difference]: Start difference. First operand 545 states and 546 transitions. Second operand 201 states. [2018-04-13 05:22:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:22:31,845 INFO L93 Difference]: Finished difference Result 557 states and 558 transitions. [2018-04-13 05:22:31,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-13 05:22:31,845 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 539 [2018-04-13 05:22:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:22:31,846 INFO L225 Difference]: With dead ends: 557 [2018-04-13 05:22:31,847 INFO L226 Difference]: Without dead ends: 557 [2018-04-13 05:22:31,849 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 676 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29961 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=15688, Invalid=56404, Unknown=0, NotChecked=0, Total=72092 [2018-04-13 05:22:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-04-13 05:22:31,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 553. [2018-04-13 05:22:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-04-13 05:22:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 554 transitions. [2018-04-13 05:22:31,852 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 554 transitions. Word has length 539 [2018-04-13 05:22:31,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:22:31,852 INFO L459 AbstractCegarLoop]: Abstraction has 553 states and 554 transitions. [2018-04-13 05:22:31,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-04-13 05:22:31,852 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 554 transitions. [2018-04-13 05:22:31,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2018-04-13 05:22:31,854 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:22:31,854 INFO L355 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:22:31,854 INFO L408 AbstractCegarLoop]: === Iteration 71 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:22:31,854 INFO L82 PathProgramCache]: Analyzing trace with hash -918056650, now seen corresponding path program 59 times [2018-04-13 05:22:31,854 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:22:31,854 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:22:31,854 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:31,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:22:31,855 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:22:31,897 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:22:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2018-04-13 05:22:32,960 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:22:32,960 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:22:32,960 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:22:33,155 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-04-13 05:22:33,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:22:33,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:22:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2018-04-13 05:22:33,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:22:33,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 68] total 71 [2018-04-13 05:22:33,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-13 05:22:33,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-13 05:22:33,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2350, Invalid=2620, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 05:22:33,266 INFO L87 Difference]: Start difference. First operand 553 states and 554 transitions. Second operand 71 states. [2018-04-13 05:22:34,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:22:34,652 INFO L93 Difference]: Finished difference Result 565 states and 566 transitions. [2018-04-13 05:22:34,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-13 05:22:34,652 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 547 [2018-04-13 05:22:34,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:22:34,653 INFO L225 Difference]: With dead ends: 565 [2018-04-13 05:22:34,653 INFO L226 Difference]: Without dead ends: 565 [2018-04-13 05:22:34,654 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=6905, Invalid=11727, Unknown=0, NotChecked=0, Total=18632 [2018-04-13 05:22:34,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-04-13 05:22:34,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 561. [2018-04-13 05:22:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-04-13 05:22:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 562 transitions. [2018-04-13 05:22:34,656 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 562 transitions. Word has length 547 [2018-04-13 05:22:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:22:34,656 INFO L459 AbstractCegarLoop]: Abstraction has 561 states and 562 transitions. [2018-04-13 05:22:34,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-13 05:22:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 562 transitions. [2018-04-13 05:22:34,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2018-04-13 05:22:34,658 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:22:34,658 INFO L355 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:22:34,658 INFO L408 AbstractCegarLoop]: === Iteration 72 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:22:34,658 INFO L82 PathProgramCache]: Analyzing trace with hash -52929514, now seen corresponding path program 60 times [2018-04-13 05:22:34,658 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:22:34,658 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:22:34,659 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:34,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:22:34,659 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:22:34,701 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:22:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 0 proven. 8712 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2018-04-13 05:22:35,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:22:35,856 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:22:35,856 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:22:36,021 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-04-13 05:22:36,021 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:22:36,062 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:22:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 0 proven. 8712 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2018-04-13 05:22:36,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:22:36,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 69] total 72 [2018-04-13 05:22:36,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-13 05:22:36,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-13 05:22:36,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=2693, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 05:22:36,168 INFO L87 Difference]: Start difference. First operand 561 states and 562 transitions. Second operand 72 states. [2018-04-13 05:22:37,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:22:37,634 INFO L93 Difference]: Finished difference Result 573 states and 574 transitions. [2018-04-13 05:22:37,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-13 05:22:37,635 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 555 [2018-04-13 05:22:37,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:22:37,636 INFO L225 Difference]: With dead ends: 573 [2018-04-13 05:22:37,636 INFO L226 Difference]: Without dead ends: 573 [2018-04-13 05:22:37,637 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2472 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=7110, Invalid=12072, Unknown=0, NotChecked=0, Total=19182 [2018-04-13 05:22:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-04-13 05:22:37,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 569. [2018-04-13 05:22:37,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-04-13 05:22:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 570 transitions. [2018-04-13 05:22:37,639 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 570 transitions. Word has length 555 [2018-04-13 05:22:37,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:22:37,640 INFO L459 AbstractCegarLoop]: Abstraction has 569 states and 570 transitions. [2018-04-13 05:22:37,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-13 05:22:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 570 transitions. [2018-04-13 05:22:37,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2018-04-13 05:22:37,641 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:22:37,641 INFO L355 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:22:37,642 INFO L408 AbstractCegarLoop]: === Iteration 73 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:22:37,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1729187850, now seen corresponding path program 61 times [2018-04-13 05:22:37,642 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:22:37,642 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:22:37,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:37,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:22:37,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:22:37,689 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:22:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 8978 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2018-04-13 05:22:38,903 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:22:38,903 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:22:38,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:22:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:22:38,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:22:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 8978 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2018-04-13 05:22:40,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:22:40,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 71] total 140 [2018-04-13 05:22:40,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-04-13 05:22:40,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-04-13 05:22:40,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7246, Invalid=12214, Unknown=0, NotChecked=0, Total=19460 [2018-04-13 05:22:40,340 INFO L87 Difference]: Start difference. First operand 569 states and 570 transitions. Second operand 140 states. [2018-04-13 05:22:41,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:22:41,346 INFO L93 Difference]: Finished difference Result 581 states and 582 transitions. [2018-04-13 05:22:41,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-13 05:22:41,346 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 563 [2018-04-13 05:22:41,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:22:41,347 INFO L225 Difference]: With dead ends: 581 [2018-04-13 05:22:41,347 INFO L226 Difference]: Without dead ends: 581 [2018-04-13 05:22:41,348 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 495 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9177 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=7385, Invalid=12355, Unknown=0, NotChecked=0, Total=19740 [2018-04-13 05:22:41,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-04-13 05:22:41,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 577. [2018-04-13 05:22:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-04-13 05:22:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 578 transitions. [2018-04-13 05:22:41,351 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 578 transitions. Word has length 563 [2018-04-13 05:22:41,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:22:41,351 INFO L459 AbstractCegarLoop]: Abstraction has 577 states and 578 transitions. [2018-04-13 05:22:41,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-04-13 05:22:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 578 transitions. [2018-04-13 05:22:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-04-13 05:22:41,353 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:22:41,353 INFO L355 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:22:41,353 INFO L408 AbstractCegarLoop]: === Iteration 74 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:22:41,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2023034070, now seen corresponding path program 62 times [2018-04-13 05:22:41,353 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:22:41,353 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:22:41,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:41,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:22:41,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:22:41,401 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:22:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2018-04-13 05:22:42,606 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:22:42,606 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:22:42,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:22:42,668 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:22:42,668 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:22:42,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:22:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2018-04-13 05:22:42,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:22:42,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 71] total 74 [2018-04-13 05:22:42,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-13 05:22:42,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-13 05:22:42,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2560, Invalid=2842, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 05:22:42,790 INFO L87 Difference]: Start difference. First operand 577 states and 578 transitions. Second operand 74 states. [2018-04-13 05:22:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:22:44,406 INFO L93 Difference]: Finished difference Result 589 states and 590 transitions. [2018-04-13 05:22:44,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-13 05:22:44,406 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 571 [2018-04-13 05:22:44,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:22:44,407 INFO L225 Difference]: With dead ends: 589 [2018-04-13 05:22:44,407 INFO L226 Difference]: Without dead ends: 589 [2018-04-13 05:22:44,407 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 640 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2615 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=7529, Invalid=12777, Unknown=0, NotChecked=0, Total=20306 [2018-04-13 05:22:44,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-04-13 05:22:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 585. [2018-04-13 05:22:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-04-13 05:22:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 586 transitions. [2018-04-13 05:22:44,410 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 586 transitions. Word has length 571 [2018-04-13 05:22:44,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:22:44,410 INFO L459 AbstractCegarLoop]: Abstraction has 585 states and 586 transitions. [2018-04-13 05:22:44,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-13 05:22:44,410 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 586 transitions. [2018-04-13 05:22:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-04-13 05:22:44,412 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:22:44,412 INFO L355 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:22:44,412 INFO L408 AbstractCegarLoop]: === Iteration 75 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:22:44,413 INFO L82 PathProgramCache]: Analyzing trace with hash 110490294, now seen corresponding path program 63 times [2018-04-13 05:22:44,413 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:22:44,413 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:22:44,413 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:44,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:22:44,413 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:22:44,462 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:22:45,670 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 9522 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2018-04-13 05:22:45,670 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:22:45,670 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:22:45,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:22:45,775 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-04-13 05:22:45,775 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:22:45,797 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:22:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 9522 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2018-04-13 05:22:45,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:22:45,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 72] total 75 [2018-04-13 05:22:45,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-13 05:22:45,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-13 05:22:45,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2632, Invalid=2918, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 05:22:45,908 INFO L87 Difference]: Start difference. First operand 585 states and 586 transitions. Second operand 75 states. [2018-04-13 05:22:47,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:22:47,496 INFO L93 Difference]: Finished difference Result 597 states and 598 transitions. [2018-04-13 05:22:47,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-13 05:22:47,496 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 579 [2018-04-13 05:22:47,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:22:47,497 INFO L225 Difference]: With dead ends: 597 [2018-04-13 05:22:47,497 INFO L226 Difference]: Without dead ends: 597 [2018-04-13 05:22:47,498 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2688 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=7743, Invalid=13137, Unknown=0, NotChecked=0, Total=20880 [2018-04-13 05:22:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-04-13 05:22:47,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 593. [2018-04-13 05:22:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-04-13 05:22:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 594 transitions. [2018-04-13 05:22:47,500 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 594 transitions. Word has length 579 [2018-04-13 05:22:47,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:22:47,501 INFO L459 AbstractCegarLoop]: Abstraction has 593 states and 594 transitions. [2018-04-13 05:22:47,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-13 05:22:47,501 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 594 transitions. [2018-04-13 05:22:47,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2018-04-13 05:22:47,503 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:22:47,503 INFO L355 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:22:47,503 INFO L408 AbstractCegarLoop]: === Iteration 76 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:22:47,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1568399766, now seen corresponding path program 64 times [2018-04-13 05:22:47,503 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:22:47,503 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:22:47,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:47,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:22:47,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:22:47,569 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:22:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 0 proven. 9800 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2018-04-13 05:22:48,819 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:22:48,819 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:22:48,820 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:22:49,012 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:22:49,013 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:22:49,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:22:49,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:22:49,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:22:49,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:22:49,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:22:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 9800 proven. 9800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:22:55,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:22:55,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 146] total 219 [2018-04-13 05:22:55,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-04-13 05:22:55,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-04-13 05:22:55,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10658, Invalid=37084, Unknown=0, NotChecked=0, Total=47742 [2018-04-13 05:22:55,349 INFO L87 Difference]: Start difference. First operand 593 states and 594 transitions. Second operand 219 states. [2018-04-13 05:22:58,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:22:58,752 INFO L93 Difference]: Finished difference Result 605 states and 606 transitions. [2018-04-13 05:22:58,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-13 05:22:58,752 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 587 [2018-04-13 05:22:58,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:22:58,753 INFO L225 Difference]: With dead ends: 605 [2018-04-13 05:22:58,753 INFO L226 Difference]: Without dead ends: 605 [2018-04-13 05:22:58,754 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 444 SyntacticMatches, 1 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35709 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=18625, Invalid=66931, Unknown=0, NotChecked=0, Total=85556 [2018-04-13 05:22:58,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-04-13 05:22:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 601. [2018-04-13 05:22:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-04-13 05:22:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 602 transitions. [2018-04-13 05:22:58,757 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 602 transitions. Word has length 587 [2018-04-13 05:22:58,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:22:58,757 INFO L459 AbstractCegarLoop]: Abstraction has 601 states and 602 transitions. [2018-04-13 05:22:58,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 219 states. [2018-04-13 05:22:58,757 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 602 transitions. [2018-04-13 05:22:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2018-04-13 05:22:58,759 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:22:58,759 INFO L355 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:22:58,760 INFO L408 AbstractCegarLoop]: === Iteration 77 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:22:58,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1737578870, now seen corresponding path program 65 times [2018-04-13 05:22:58,760 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:22:58,760 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:22:58,760 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:58,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:22:58,760 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:22:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:22:58,810 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:23:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 10082 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2018-04-13 05:23:00,046 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:23:00,046 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:23:00,046 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:23:00,255 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-04-13 05:23:00,255 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:23:00,266 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:23:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 10082 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2018-04-13 05:23:00,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:23:00,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 74] total 77 [2018-04-13 05:23:00,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-13 05:23:00,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-13 05:23:00,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2779, Invalid=3073, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 05:23:00,418 INFO L87 Difference]: Start difference. First operand 601 states and 602 transitions. Second operand 77 states. [2018-04-13 05:23:02,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:23:02,330 INFO L93 Difference]: Finished difference Result 613 states and 614 transitions. [2018-04-13 05:23:02,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-13 05:23:02,331 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 595 [2018-04-13 05:23:02,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:23:02,332 INFO L225 Difference]: With dead ends: 613 [2018-04-13 05:23:02,332 INFO L226 Difference]: Without dead ends: 613 [2018-04-13 05:23:02,333 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 667 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2837 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=8180, Invalid=13872, Unknown=0, NotChecked=0, Total=22052 [2018-04-13 05:23:02,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-04-13 05:23:02,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 609. [2018-04-13 05:23:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-04-13 05:23:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 610 transitions. [2018-04-13 05:23:02,336 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 610 transitions. Word has length 595 [2018-04-13 05:23:02,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:23:02,336 INFO L459 AbstractCegarLoop]: Abstraction has 609 states and 610 transitions. [2018-04-13 05:23:02,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-13 05:23:02,336 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 610 transitions. [2018-04-13 05:23:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-04-13 05:23:02,338 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:23:02,338 INFO L355 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:23:02,338 INFO L408 AbstractCegarLoop]: === Iteration 78 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:23:02,338 INFO L82 PathProgramCache]: Analyzing trace with hash -18818474, now seen corresponding path program 66 times [2018-04-13 05:23:02,338 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:23:02,338 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:23:02,339 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:02,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:23:02,339 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:23:02,391 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:23:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 0 proven. 10368 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2018-04-13 05:23:03,710 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:23:03,710 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:23:03,710 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:23:03,887 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-04-13 05:23:03,887 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:23:03,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:23:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 0 proven. 10368 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2018-04-13 05:23:04,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:23:04,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 75] total 78 [2018-04-13 05:23:04,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-13 05:23:04,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-13 05:23:04,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2854, Invalid=3152, Unknown=0, NotChecked=0, Total=6006 [2018-04-13 05:23:04,038 INFO L87 Difference]: Start difference. First operand 609 states and 610 transitions. Second operand 78 states. [2018-04-13 05:23:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:23:05,726 INFO L93 Difference]: Finished difference Result 621 states and 622 transitions. [2018-04-13 05:23:05,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-13 05:23:05,726 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 603 [2018-04-13 05:23:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:23:05,727 INFO L225 Difference]: With dead ends: 621 [2018-04-13 05:23:05,727 INFO L226 Difference]: Without dead ends: 621 [2018-04-13 05:23:05,728 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 676 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2913 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=8403, Invalid=14247, Unknown=0, NotChecked=0, Total=22650 [2018-04-13 05:23:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-04-13 05:23:05,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 617. [2018-04-13 05:23:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-04-13 05:23:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 618 transitions. [2018-04-13 05:23:05,731 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 618 transitions. Word has length 603 [2018-04-13 05:23:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:23:05,731 INFO L459 AbstractCegarLoop]: Abstraction has 617 states and 618 transitions. [2018-04-13 05:23:05,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-13 05:23:05,731 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 618 transitions. [2018-04-13 05:23:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2018-04-13 05:23:05,733 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:23:05,733 INFO L355 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:23:05,733 INFO L408 AbstractCegarLoop]: === Iteration 79 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:23:05,734 INFO L82 PathProgramCache]: Analyzing trace with hash 221570102, now seen corresponding path program 67 times [2018-04-13 05:23:05,734 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:23:05,734 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:23:05,734 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:05,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:23:05,734 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:23:05,788 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:23:07,183 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 10658 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2018-04-13 05:23:07,184 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:23:07,184 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:23:07,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:23:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:23:07,233 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:23:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 10658 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2018-04-13 05:23:08,866 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:23:08,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 77] total 152 [2018-04-13 05:23:08,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-04-13 05:23:08,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-04-13 05:23:08,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8551, Invalid=14401, Unknown=0, NotChecked=0, Total=22952 [2018-04-13 05:23:08,868 INFO L87 Difference]: Start difference. First operand 617 states and 618 transitions. Second operand 152 states. [2018-04-13 05:23:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:23:09,978 INFO L93 Difference]: Finished difference Result 629 states and 630 transitions. [2018-04-13 05:23:09,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-13 05:23:09,978 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 611 [2018-04-13 05:23:09,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:23:09,979 INFO L225 Difference]: With dead ends: 629 [2018-04-13 05:23:09,979 INFO L226 Difference]: Without dead ends: 629 [2018-04-13 05:23:09,980 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 537 SyntacticMatches, 1 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10875 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=8702, Invalid=14554, Unknown=0, NotChecked=0, Total=23256 [2018-04-13 05:23:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-04-13 05:23:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 625. [2018-04-13 05:23:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-04-13 05:23:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 626 transitions. [2018-04-13 05:23:09,983 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 626 transitions. Word has length 611 [2018-04-13 05:23:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:23:09,983 INFO L459 AbstractCegarLoop]: Abstraction has 625 states and 626 transitions. [2018-04-13 05:23:09,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-04-13 05:23:09,983 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 626 transitions. [2018-04-13 05:23:09,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2018-04-13 05:23:09,985 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:23:09,985 INFO L355 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:23:09,985 INFO L408 AbstractCegarLoop]: === Iteration 80 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:23:09,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1407715562, now seen corresponding path program 68 times [2018-04-13 05:23:09,985 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:23:09,986 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:23:09,986 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:09,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:23:09,986 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:23:10,041 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:23:11,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 0 proven. 10952 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2018-04-13 05:23:11,406 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:23:11,406 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:23:11,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:23:11,481 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:23:11,482 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:23:11,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:23:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 0 proven. 10952 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2018-04-13 05:23:11,659 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:23:11,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 77] total 80 [2018-04-13 05:23:11,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-13 05:23:11,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-13 05:23:11,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3007, Invalid=3313, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 05:23:11,661 INFO L87 Difference]: Start difference. First operand 625 states and 626 transitions. Second operand 80 states. [2018-04-13 05:23:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:23:13,398 INFO L93 Difference]: Finished difference Result 637 states and 638 transitions. [2018-04-13 05:23:13,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-13 05:23:13,398 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 619 [2018-04-13 05:23:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:23:13,399 INFO L225 Difference]: With dead ends: 637 [2018-04-13 05:23:13,399 INFO L226 Difference]: Without dead ends: 637 [2018-04-13 05:23:13,400 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3068 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=8858, Invalid=15012, Unknown=0, NotChecked=0, Total=23870 [2018-04-13 05:23:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-04-13 05:23:13,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 633. [2018-04-13 05:23:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-04-13 05:23:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 634 transitions. [2018-04-13 05:23:13,403 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 634 transitions. Word has length 619 [2018-04-13 05:23:13,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:23:13,403 INFO L459 AbstractCegarLoop]: Abstraction has 633 states and 634 transitions. [2018-04-13 05:23:13,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-13 05:23:13,403 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 634 transitions. [2018-04-13 05:23:13,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-04-13 05:23:13,405 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:23:13,405 INFO L355 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:23:13,405 INFO L408 AbstractCegarLoop]: === Iteration 81 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:23:13,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1154781942, now seen corresponding path program 69 times [2018-04-13 05:23:13,406 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:23:13,406 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:23:13,406 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:13,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:23:13,406 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:23:13,461 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:23:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 22500 backedges. 0 proven. 11250 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2018-04-13 05:23:14,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:23:14,899 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:23:14,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:23:15,029 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-04-13 05:23:15,029 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:23:15,059 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:23:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 22500 backedges. 0 proven. 11250 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2018-04-13 05:23:16,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:23:16,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 79] total 156 [2018-04-13 05:23:16,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-04-13 05:23:16,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-04-13 05:23:16,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9010, Invalid=15170, Unknown=0, NotChecked=0, Total=24180 [2018-04-13 05:23:16,756 INFO L87 Difference]: Start difference. First operand 633 states and 634 transitions. Second operand 156 states. [2018-04-13 05:23:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:23:18,147 INFO L93 Difference]: Finished difference Result 645 states and 646 transitions. [2018-04-13 05:23:18,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-13 05:23:18,148 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 627 [2018-04-13 05:23:18,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:23:18,149 INFO L225 Difference]: With dead ends: 645 [2018-04-13 05:23:18,149 INFO L226 Difference]: Without dead ends: 645 [2018-04-13 05:23:18,149 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 551 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11473 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=9165, Invalid=15327, Unknown=0, NotChecked=0, Total=24492 [2018-04-13 05:23:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-04-13 05:23:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 641. [2018-04-13 05:23:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-04-13 05:23:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 642 transitions. [2018-04-13 05:23:18,152 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 642 transitions. Word has length 627 [2018-04-13 05:23:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:23:18,152 INFO L459 AbstractCegarLoop]: Abstraction has 641 states and 642 transitions. [2018-04-13 05:23:18,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-04-13 05:23:18,152 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 642 transitions. [2018-04-13 05:23:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2018-04-13 05:23:18,154 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:23:18,154 INFO L355 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:23:18,154 INFO L408 AbstractCegarLoop]: === Iteration 82 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:23:18,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1334495274, now seen corresponding path program 70 times [2018-04-13 05:23:18,155 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:23:18,155 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:23:18,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:18,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:23:18,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:23:18,211 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:23:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 23104 backedges. 0 proven. 11552 refuted. 0 times theorem prover too weak. 11552 trivial. 0 not checked. [2018-04-13 05:23:19,622 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:23:19,623 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:23:19,623 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:23:19,835 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:23:19,835 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:23:19,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:23:19,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:23:19,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:23:19,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:23:19,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:23:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 23104 backedges. 11552 proven. 11552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:23:27,193 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:23:27,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 158] total 237 [2018-04-13 05:23:27,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 237 states [2018-04-13 05:23:27,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 237 interpolants. [2018-04-13 05:23:27,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12482, Invalid=43450, Unknown=0, NotChecked=0, Total=55932 [2018-04-13 05:23:27,195 INFO L87 Difference]: Start difference. First operand 641 states and 642 transitions. Second operand 237 states. [2018-04-13 05:23:31,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:23:31,260 INFO L93 Difference]: Finished difference Result 653 states and 654 transitions. [2018-04-13 05:23:31,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-13 05:23:31,274 INFO L78 Accepts]: Start accepts. Automaton has 237 states. Word has length 635 [2018-04-13 05:23:31,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:23:31,275 INFO L225 Difference]: With dead ends: 653 [2018-04-13 05:23:31,275 INFO L226 Difference]: Without dead ends: 653 [2018-04-13 05:23:31,278 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 796 GetRequests, 480 SyntacticMatches, 1 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41961 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=21814, Invalid=78358, Unknown=0, NotChecked=0, Total=100172 [2018-04-13 05:23:31,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-04-13 05:23:31,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 649. [2018-04-13 05:23:31,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-04-13 05:23:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 650 transitions. [2018-04-13 05:23:31,280 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 650 transitions. Word has length 635 [2018-04-13 05:23:31,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:23:31,281 INFO L459 AbstractCegarLoop]: Abstraction has 649 states and 650 transitions. [2018-04-13 05:23:31,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 237 states. [2018-04-13 05:23:31,281 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 650 transitions. [2018-04-13 05:23:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2018-04-13 05:23:31,283 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:23:31,283 INFO L355 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:23:31,283 INFO L408 AbstractCegarLoop]: === Iteration 83 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:23:31,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1472488886, now seen corresponding path program 71 times [2018-04-13 05:23:31,283 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:23:31,283 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:23:31,284 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:31,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:23:31,284 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:23:31,339 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:23:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 23716 backedges. 0 proven. 11858 refuted. 0 times theorem prover too weak. 11858 trivial. 0 not checked. [2018-04-13 05:23:32,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:23:32,866 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:23:32,867 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:23:33,085 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-04-13 05:23:33,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:23:33,096 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:23:33,228 INFO L134 CoverageAnalysis]: Checked inductivity of 23716 backedges. 0 proven. 11858 refuted. 0 times theorem prover too weak. 11858 trivial. 0 not checked. [2018-04-13 05:23:33,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:23:33,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 80] total 83 [2018-04-13 05:23:33,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-13 05:23:33,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-13 05:23:33,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3244, Invalid=3562, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 05:23:33,229 INFO L87 Difference]: Start difference. First operand 649 states and 650 transitions. Second operand 83 states. [2018-04-13 05:23:35,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:23:35,130 INFO L93 Difference]: Finished difference Result 661 states and 662 transitions. [2018-04-13 05:23:35,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-13 05:23:35,130 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 643 [2018-04-13 05:23:35,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:23:35,131 INFO L225 Difference]: With dead ends: 661 [2018-04-13 05:23:35,131 INFO L226 Difference]: Without dead ends: 661 [2018-04-13 05:23:35,132 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 721 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3308 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=9563, Invalid=16197, Unknown=0, NotChecked=0, Total=25760 [2018-04-13 05:23:35,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-04-13 05:23:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 657. [2018-04-13 05:23:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-04-13 05:23:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 658 transitions. [2018-04-13 05:23:35,135 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 658 transitions. Word has length 643 [2018-04-13 05:23:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:23:35,135 INFO L459 AbstractCegarLoop]: Abstraction has 657 states and 658 transitions. [2018-04-13 05:23:35,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-13 05:23:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 658 transitions. [2018-04-13 05:23:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2018-04-13 05:23:35,137 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:23:35,138 INFO L355 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:23:35,138 INFO L408 AbstractCegarLoop]: === Iteration 84 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:23:35,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1397529750, now seen corresponding path program 72 times [2018-04-13 05:23:35,138 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:23:35,138 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:23:35,138 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:35,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:23:35,138 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:23:35,202 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:23:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 24336 backedges. 0 proven. 12168 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2018-04-13 05:23:36,722 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:23:36,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:23:36,723 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:23:36,869 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2018-04-13 05:23:36,869 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:23:36,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:23:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 24336 backedges. 0 proven. 12168 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2018-04-13 05:23:37,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:23:37,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 81] total 84 [2018-04-13 05:23:37,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-13 05:23:37,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-13 05:23:37,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3325, Invalid=3647, Unknown=0, NotChecked=0, Total=6972 [2018-04-13 05:23:37,092 INFO L87 Difference]: Start difference. First operand 657 states and 658 transitions. Second operand 84 states. [2018-04-13 05:23:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:23:39,013 INFO L93 Difference]: Finished difference Result 669 states and 670 transitions. [2018-04-13 05:23:39,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-13 05:23:39,013 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 651 [2018-04-13 05:23:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:23:39,014 INFO L225 Difference]: With dead ends: 669 [2018-04-13 05:23:39,014 INFO L226 Difference]: Without dead ends: 669 [2018-04-13 05:23:39,015 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 891 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3390 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=9804, Invalid=16602, Unknown=0, NotChecked=0, Total=26406 [2018-04-13 05:23:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2018-04-13 05:23:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 665. [2018-04-13 05:23:39,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-04-13 05:23:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 666 transitions. [2018-04-13 05:23:39,018 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 666 transitions. Word has length 651 [2018-04-13 05:23:39,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:23:39,018 INFO L459 AbstractCegarLoop]: Abstraction has 665 states and 666 transitions. [2018-04-13 05:23:39,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-13 05:23:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 666 transitions. [2018-04-13 05:23:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2018-04-13 05:23:39,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:23:39,021 INFO L355 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:23:39,021 INFO L408 AbstractCegarLoop]: === Iteration 85 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:23:39,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1957143434, now seen corresponding path program 73 times [2018-04-13 05:23:39,021 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:23:39,022 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:23:39,022 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:39,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:23:39,022 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:23:39,081 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:23:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 24964 backedges. 0 proven. 12482 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2018-04-13 05:23:40,680 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:23:40,680 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:23:40,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:23:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:23:40,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:23:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 24964 backedges. 0 proven. 12482 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2018-04-13 05:23:42,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:23:42,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 83] total 164 [2018-04-13 05:23:42,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-04-13 05:23:42,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-04-13 05:23:42,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9964, Invalid=16768, Unknown=0, NotChecked=0, Total=26732 [2018-04-13 05:23:42,633 INFO L87 Difference]: Start difference. First operand 665 states and 666 transitions. Second operand 164 states. [2018-04-13 05:23:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:23:44,099 INFO L93 Difference]: Finished difference Result 677 states and 678 transitions. [2018-04-13 05:23:44,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-13 05:23:44,099 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 659 [2018-04-13 05:23:44,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:23:44,100 INFO L225 Difference]: With dead ends: 677 [2018-04-13 05:23:44,100 INFO L226 Difference]: Without dead ends: 677 [2018-04-13 05:23:44,100 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 579 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12717 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=10127, Invalid=16933, Unknown=0, NotChecked=0, Total=27060 [2018-04-13 05:23:44,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-04-13 05:23:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 673. [2018-04-13 05:23:44,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-04-13 05:23:44,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 674 transitions. [2018-04-13 05:23:44,103 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 674 transitions. Word has length 659 [2018-04-13 05:23:44,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:23:44,104 INFO L459 AbstractCegarLoop]: Abstraction has 673 states and 674 transitions. [2018-04-13 05:23:44,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-04-13 05:23:44,104 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 674 transitions. [2018-04-13 05:23:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2018-04-13 05:23:44,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:23:44,106 INFO L355 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:23:44,106 INFO L408 AbstractCegarLoop]: === Iteration 86 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:23:44,107 INFO L82 PathProgramCache]: Analyzing trace with hash -671996586, now seen corresponding path program 74 times [2018-04-13 05:23:44,107 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:23:44,107 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:23:44,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:44,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:23:44,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:23:44,173 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:23:45,744 INFO L134 CoverageAnalysis]: Checked inductivity of 25600 backedges. 0 proven. 12800 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2018-04-13 05:23:45,744 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:23:45,744 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:23:45,744 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:23:45,830 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:23:45,830 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:23:45,845 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:23:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 25600 backedges. 0 proven. 12800 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2018-04-13 05:23:46,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:23:46,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 83] total 86 [2018-04-13 05:23:46,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-13 05:23:46,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-13 05:23:46,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3490, Invalid=3820, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 05:23:46,021 INFO L87 Difference]: Start difference. First operand 673 states and 674 transitions. Second operand 86 states. [2018-04-13 05:23:47,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:23:47,942 INFO L93 Difference]: Finished difference Result 685 states and 686 transitions. [2018-04-13 05:23:48,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-04-13 05:23:48,004 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 667 [2018-04-13 05:23:48,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:23:48,005 INFO L225 Difference]: With dead ends: 685 [2018-04-13 05:23:48,006 INFO L226 Difference]: Without dead ends: 685 [2018-04-13 05:23:48,007 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 913 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3557 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=10295, Invalid=17427, Unknown=0, NotChecked=0, Total=27722 [2018-04-13 05:23:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-04-13 05:23:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 681. [2018-04-13 05:23:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-04-13 05:23:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 682 transitions. [2018-04-13 05:23:48,010 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 682 transitions. Word has length 667 [2018-04-13 05:23:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:23:48,010 INFO L459 AbstractCegarLoop]: Abstraction has 681 states and 682 transitions. [2018-04-13 05:23:48,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-13 05:23:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 682 transitions. [2018-04-13 05:23:48,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-04-13 05:23:48,013 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:23:48,013 INFO L355 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:23:48,013 INFO L408 AbstractCegarLoop]: === Iteration 87 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:23:48,013 INFO L82 PathProgramCache]: Analyzing trace with hash 551843638, now seen corresponding path program 75 times [2018-04-13 05:23:48,013 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:23:48,013 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:23:48,013 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:48,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:23:48,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:23:48,076 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:23:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 26244 backedges. 0 proven. 13122 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2018-04-13 05:23:49,716 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:23:49,716 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:23:49,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:23:49,865 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-04-13 05:23:49,865 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:23:49,928 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:23:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 26244 backedges. 0 proven. 13122 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2018-04-13 05:23:50,073 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:23:50,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 84] total 87 [2018-04-13 05:23:50,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-13 05:23:50,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-13 05:23:50,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3574, Invalid=3908, Unknown=0, NotChecked=0, Total=7482 [2018-04-13 05:23:50,074 INFO L87 Difference]: Start difference. First operand 681 states and 682 transitions. Second operand 87 states. [2018-04-13 05:23:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:23:52,160 INFO L93 Difference]: Finished difference Result 693 states and 694 transitions. [2018-04-13 05:23:52,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-13 05:23:52,161 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 675 [2018-04-13 05:23:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:23:52,162 INFO L225 Difference]: With dead ends: 693 [2018-04-13 05:23:52,162 INFO L226 Difference]: Without dead ends: 693 [2018-04-13 05:23:52,163 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 757 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3642 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=10545, Invalid=17847, Unknown=0, NotChecked=0, Total=28392 [2018-04-13 05:23:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2018-04-13 05:23:52,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 689. [2018-04-13 05:23:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2018-04-13 05:23:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 690 transitions. [2018-04-13 05:23:52,166 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 690 transitions. Word has length 675 [2018-04-13 05:23:52,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:23:52,166 INFO L459 AbstractCegarLoop]: Abstraction has 689 states and 690 transitions. [2018-04-13 05:23:52,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-04-13 05:23:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 690 transitions. [2018-04-13 05:23:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2018-04-13 05:23:52,169 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:23:52,169 INFO L355 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:23:52,169 INFO L408 AbstractCegarLoop]: === Iteration 88 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:23:52,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2109329942, now seen corresponding path program 76 times [2018-04-13 05:23:52,169 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:23:52,169 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:23:52,170 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:52,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:23:52,170 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:23:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:23:52,234 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:23:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 26896 backedges. 0 proven. 13448 refuted. 0 times theorem prover too weak. 13448 trivial. 0 not checked. [2018-04-13 05:23:53,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:23:53,895 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:23:53,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:23:54,186 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:23:54,187 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:23:54,221 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:23:54,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:23:54,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:23:54,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:23:54,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:24:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 26896 backedges. 13448 proven. 13448 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:24:02,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:24:02,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 170] total 255 [2018-04-13 05:24:02,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 255 states [2018-04-13 05:24:02,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 255 interpolants. [2018-04-13 05:24:02,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14450, Invalid=50320, Unknown=0, NotChecked=0, Total=64770 [2018-04-13 05:24:02,778 INFO L87 Difference]: Start difference. First operand 689 states and 690 transitions. Second operand 255 states. [2018-04-13 05:24:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:24:07,337 INFO L93 Difference]: Finished difference Result 701 states and 702 transitions. [2018-04-13 05:24:07,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-04-13 05:24:07,337 INFO L78 Accepts]: Start accepts. Automaton has 255 states. Word has length 683 [2018-04-13 05:24:07,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:24:07,338 INFO L225 Difference]: With dead ends: 701 [2018-04-13 05:24:07,338 INFO L226 Difference]: Without dead ends: 701 [2018-04-13 05:24:07,340 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 856 GetRequests, 516 SyntacticMatches, 1 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48717 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=25255, Invalid=90685, Unknown=0, NotChecked=0, Total=115940 [2018-04-13 05:24:07,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-04-13 05:24:07,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 697. [2018-04-13 05:24:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-04-13 05:24:07,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 698 transitions. [2018-04-13 05:24:07,343 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 698 transitions. Word has length 683 [2018-04-13 05:24:07,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:24:07,343 INFO L459 AbstractCegarLoop]: Abstraction has 697 states and 698 transitions. [2018-04-13 05:24:07,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 255 states. [2018-04-13 05:24:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 698 transitions. [2018-04-13 05:24:07,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2018-04-13 05:24:07,346 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:24:07,346 INFO L355 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:24:07,346 INFO L408 AbstractCegarLoop]: === Iteration 89 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:24:07,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1438430710, now seen corresponding path program 77 times [2018-04-13 05:24:07,346 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:24:07,346 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:24:07,347 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:24:07,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:24:07,347 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:24:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:24:07,435 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:24:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 27556 backedges. 0 proven. 13778 refuted. 0 times theorem prover too weak. 13778 trivial. 0 not checked. [2018-04-13 05:24:09,125 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:24:09,125 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:24:09,126 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:24:09,451 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2018-04-13 05:24:09,451 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:24:09,463 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:24:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 27556 backedges. 0 proven. 13778 refuted. 0 times theorem prover too weak. 13778 trivial. 0 not checked. [2018-04-13 05:24:09,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:24:09,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 86] total 89 [2018-04-13 05:24:09,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-04-13 05:24:09,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-04-13 05:24:09,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3745, Invalid=4087, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 05:24:09,617 INFO L87 Difference]: Start difference. First operand 697 states and 698 transitions. Second operand 89 states. [2018-04-13 05:24:11,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:24:11,813 INFO L93 Difference]: Finished difference Result 709 states and 710 transitions. [2018-04-13 05:24:11,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-04-13 05:24:11,813 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 691 [2018-04-13 05:24:11,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:24:11,814 INFO L225 Difference]: With dead ends: 709 [2018-04-13 05:24:11,814 INFO L226 Difference]: Without dead ends: 709 [2018-04-13 05:24:11,815 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 946 GetRequests, 775 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3815 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=11054, Invalid=18702, Unknown=0, NotChecked=0, Total=29756 [2018-04-13 05:24:11,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-04-13 05:24:11,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 705. [2018-04-13 05:24:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-04-13 05:24:11,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 706 transitions. [2018-04-13 05:24:11,820 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 706 transitions. Word has length 691 [2018-04-13 05:24:11,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:24:11,820 INFO L459 AbstractCegarLoop]: Abstraction has 705 states and 706 transitions. [2018-04-13 05:24:11,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-04-13 05:24:11,821 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 706 transitions. [2018-04-13 05:24:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-04-13 05:24:11,824 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:24:11,825 INFO L355 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 84, 84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:24:11,825 INFO L408 AbstractCegarLoop]: === Iteration 90 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:24:11,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2146935510, now seen corresponding path program 78 times [2018-04-13 05:24:11,825 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:24:11,825 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:24:11,826 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:24:11,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:24:11,826 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:24:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:24:11,921 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:24:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 28224 backedges. 0 proven. 14112 refuted. 0 times theorem prover too weak. 14112 trivial. 0 not checked. [2018-04-13 05:24:13,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:24:13,685 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:24:13,685 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:24:13,853 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2018-04-13 05:24:13,854 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:24:13,904 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:24:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 28224 backedges. 0 proven. 14112 refuted. 0 times theorem prover too weak. 14112 trivial. 0 not checked. [2018-04-13 05:24:14,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:24:14,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 87] total 90 [2018-04-13 05:24:14,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-04-13 05:24:14,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-04-13 05:24:14,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3832, Invalid=4178, Unknown=0, NotChecked=0, Total=8010 [2018-04-13 05:24:14,097 INFO L87 Difference]: Start difference. First operand 705 states and 706 transitions. Second operand 90 states. [2018-04-13 05:24:16,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:24:16,273 INFO L93 Difference]: Finished difference Result 717 states and 718 transitions. [2018-04-13 05:24:16,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-13 05:24:16,273 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 699 [2018-04-13 05:24:16,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:24:16,274 INFO L225 Difference]: With dead ends: 717 [2018-04-13 05:24:16,274 INFO L226 Difference]: Without dead ends: 717 [2018-04-13 05:24:16,275 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 957 GetRequests, 784 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3903 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=11313, Invalid=19137, Unknown=0, NotChecked=0, Total=30450 [2018-04-13 05:24:16,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-04-13 05:24:16,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 713. [2018-04-13 05:24:16,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-04-13 05:24:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 714 transitions. [2018-04-13 05:24:16,279 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 714 transitions. Word has length 699 [2018-04-13 05:24:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:24:16,279 INFO L459 AbstractCegarLoop]: Abstraction has 713 states and 714 transitions. [2018-04-13 05:24:16,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-04-13 05:24:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 714 transitions. [2018-04-13 05:24:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2018-04-13 05:24:16,282 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:24:16,282 INFO L355 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 85, 85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:24:16,282 INFO L408 AbstractCegarLoop]: === Iteration 91 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:24:16,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1664424118, now seen corresponding path program 79 times [2018-04-13 05:24:16,282 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:24:16,282 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:24:16,283 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:24:16,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:24:16,283 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:24:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:24:16,354 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:24:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 28900 backedges. 0 proven. 14450 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2018-04-13 05:24:18,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:24:18,137 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:24:18,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:24:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:24:18,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:24:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 28900 backedges. 0 proven. 14450 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2018-04-13 05:24:20,418 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:24:20,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 89] total 176 [2018-04-13 05:24:20,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-04-13 05:24:20,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-04-13 05:24:20,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11485, Invalid=19315, Unknown=0, NotChecked=0, Total=30800 [2018-04-13 05:24:20,420 INFO L87 Difference]: Start difference. First operand 713 states and 714 transitions. Second operand 176 states. [2018-04-13 05:24:22,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:24:22,234 INFO L93 Difference]: Finished difference Result 725 states and 726 transitions. [2018-04-13 05:24:22,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-04-13 05:24:22,234 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 707 [2018-04-13 05:24:22,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:24:22,235 INFO L225 Difference]: With dead ends: 725 [2018-04-13 05:24:22,235 INFO L226 Difference]: Without dead ends: 725 [2018-04-13 05:24:22,236 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 621 SyntacticMatches, 1 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14703 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=11660, Invalid=19492, Unknown=0, NotChecked=0, Total=31152 [2018-04-13 05:24:22,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-04-13 05:24:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 721. [2018-04-13 05:24:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-04-13 05:24:22,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 722 transitions. [2018-04-13 05:24:22,239 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 722 transitions. Word has length 707 [2018-04-13 05:24:22,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:24:22,239 INFO L459 AbstractCegarLoop]: Abstraction has 721 states and 722 transitions. [2018-04-13 05:24:22,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-04-13 05:24:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 722 transitions. [2018-04-13 05:24:22,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2018-04-13 05:24:22,242 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:24:22,242 INFO L355 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 86, 86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:24:22,242 INFO L408 AbstractCegarLoop]: === Iteration 92 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:24:22,242 INFO L82 PathProgramCache]: Analyzing trace with hash 369072022, now seen corresponding path program 80 times [2018-04-13 05:24:22,242 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:24:22,242 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:24:22,243 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:24:22,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:24:22,243 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:24:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:24:22,321 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:24:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 29584 backedges. 0 proven. 14792 refuted. 0 times theorem prover too weak. 14792 trivial. 0 not checked. [2018-04-13 05:24:24,214 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:24:24,214 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:24:24,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:24:24,311 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:24:24,311 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:24:24,390 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:24:24,555 INFO L134 CoverageAnalysis]: Checked inductivity of 29584 backedges. 0 proven. 14792 refuted. 0 times theorem prover too weak. 14792 trivial. 0 not checked. [2018-04-13 05:24:24,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:24:24,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 89] total 92 [2018-04-13 05:24:24,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-13 05:24:24,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-13 05:24:24,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4009, Invalid=4363, Unknown=0, NotChecked=0, Total=8372 [2018-04-13 05:24:24,556 INFO L87 Difference]: Start difference. First operand 721 states and 722 transitions. Second operand 92 states. [2018-04-13 05:24:26,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:24:26,838 INFO L93 Difference]: Finished difference Result 733 states and 734 transitions. [2018-04-13 05:24:26,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-13 05:24:26,838 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 715 [2018-04-13 05:24:26,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:24:26,839 INFO L225 Difference]: With dead ends: 733 [2018-04-13 05:24:26,839 INFO L226 Difference]: Without dead ends: 733 [2018-04-13 05:24:26,840 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 979 GetRequests, 802 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4082 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=11840, Invalid=20022, Unknown=0, NotChecked=0, Total=31862 [2018-04-13 05:24:26,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-04-13 05:24:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 729. [2018-04-13 05:24:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2018-04-13 05:24:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 730 transitions. [2018-04-13 05:24:26,842 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 730 transitions. Word has length 715 [2018-04-13 05:24:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:24:26,843 INFO L459 AbstractCegarLoop]: Abstraction has 729 states and 730 transitions. [2018-04-13 05:24:26,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-13 05:24:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 730 transitions. [2018-04-13 05:24:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2018-04-13 05:24:26,845 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:24:26,846 INFO L355 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 87, 87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:24:26,846 INFO L408 AbstractCegarLoop]: === Iteration 93 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:24:26,846 INFO L82 PathProgramCache]: Analyzing trace with hash 2124521334, now seen corresponding path program 81 times [2018-04-13 05:24:26,846 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:24:26,846 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:24:26,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:24:26,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:24:26,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:24:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:24:26,921 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:24:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 30276 backedges. 0 proven. 15138 refuted. 0 times theorem prover too weak. 15138 trivial. 0 not checked. [2018-04-13 05:24:28,875 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:24:28,875 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:24:28,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:24:29,043 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-04-13 05:24:29,044 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:24:29,085 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:24:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 30276 backedges. 0 proven. 15138 refuted. 0 times theorem prover too weak. 15138 trivial. 0 not checked. [2018-04-13 05:24:31,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:24:31,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 91] total 180 [2018-04-13 05:24:31,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-04-13 05:24:31,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-04-13 05:24:31,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12016, Invalid=20204, Unknown=0, NotChecked=0, Total=32220 [2018-04-13 05:24:31,342 INFO L87 Difference]: Start difference. First operand 729 states and 730 transitions. Second operand 180 states. [2018-04-13 05:24:33,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:24:33,110 INFO L93 Difference]: Finished difference Result 741 states and 742 transitions. [2018-04-13 05:24:33,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-13 05:24:33,110 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 723 [2018-04-13 05:24:33,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:24:33,111 INFO L225 Difference]: With dead ends: 741 [2018-04-13 05:24:33,111 INFO L226 Difference]: Without dead ends: 741 [2018-04-13 05:24:33,112 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 815 GetRequests, 635 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15397 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=12195, Invalid=20385, Unknown=0, NotChecked=0, Total=32580 [2018-04-13 05:24:33,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-04-13 05:24:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 737. [2018-04-13 05:24:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-04-13 05:24:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 738 transitions. [2018-04-13 05:24:33,115 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 738 transitions. Word has length 723 [2018-04-13 05:24:33,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:24:33,115 INFO L459 AbstractCegarLoop]: Abstraction has 737 states and 738 transitions. [2018-04-13 05:24:33,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-04-13 05:24:33,115 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 738 transitions. [2018-04-13 05:24:33,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2018-04-13 05:24:33,118 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:24:33,118 INFO L355 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 88, 88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:24:33,118 INFO L408 AbstractCegarLoop]: === Iteration 94 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:24:33,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1931849814, now seen corresponding path program 82 times [2018-04-13 05:24:33,118 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:24:33,118 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:24:33,119 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:24:33,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:24:33,119 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:24:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:24:33,193 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:24:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 30976 backedges. 0 proven. 15488 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2018-04-13 05:24:35,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:24:35,153 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:24:35,154 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:24:35,464 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:24:35,464 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:24:35,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:24:35,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:24:35,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:24:35,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:24:35,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:24:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 30976 backedges. 15488 proven. 15488 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:24:45,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:24:45,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 182] total 273 [2018-04-13 05:24:45,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 273 states [2018-04-13 05:24:45,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 273 interpolants. [2018-04-13 05:24:45,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16562, Invalid=57694, Unknown=0, NotChecked=0, Total=74256 [2018-04-13 05:24:45,053 INFO L87 Difference]: Start difference. First operand 737 states and 738 transitions. Second operand 273 states. [2018-04-13 05:24:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:24:50,429 INFO L93 Difference]: Finished difference Result 749 states and 750 transitions. [2018-04-13 05:24:50,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-13 05:24:50,430 INFO L78 Accepts]: Start accepts. Automaton has 273 states. Word has length 731 [2018-04-13 05:24:50,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:24:50,431 INFO L225 Difference]: With dead ends: 749 [2018-04-13 05:24:50,431 INFO L226 Difference]: Without dead ends: 749 [2018-04-13 05:24:50,435 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 916 GetRequests, 552 SyntacticMatches, 1 SemanticMatches, 363 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55977 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=28948, Invalid=103912, Unknown=0, NotChecked=0, Total=132860 [2018-04-13 05:24:50,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-04-13 05:24:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 745. [2018-04-13 05:24:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-04-13 05:24:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 746 transitions. [2018-04-13 05:24:50,439 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 746 transitions. Word has length 731 [2018-04-13 05:24:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:24:50,439 INFO L459 AbstractCegarLoop]: Abstraction has 745 states and 746 transitions. [2018-04-13 05:24:50,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 273 states. [2018-04-13 05:24:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 746 transitions. [2018-04-13 05:24:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-04-13 05:24:50,441 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:24:50,442 INFO L355 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 89, 89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:24:50,442 INFO L408 AbstractCegarLoop]: === Iteration 95 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:24:50,442 INFO L82 PathProgramCache]: Analyzing trace with hash -648656330, now seen corresponding path program 83 times [2018-04-13 05:24:50,442 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:24:50,442 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:24:50,442 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:24:50,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:24:50,442 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:24:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:24:50,531 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:24:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 31684 backedges. 0 proven. 15842 refuted. 0 times theorem prover too weak. 15842 trivial. 0 not checked. [2018-04-13 05:24:52,498 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:24:52,499 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:24:52,499 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:24:52,884 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2018-04-13 05:24:52,884 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:24:52,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:24:53,116 INFO L134 CoverageAnalysis]: Checked inductivity of 31684 backedges. 0 proven. 15842 refuted. 0 times theorem prover too weak. 15842 trivial. 0 not checked. [2018-04-13 05:24:53,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:24:53,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 92] total 95 [2018-04-13 05:24:53,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-04-13 05:24:53,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-04-13 05:24:53,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4282, Invalid=4648, Unknown=0, NotChecked=0, Total=8930 [2018-04-13 05:24:53,117 INFO L87 Difference]: Start difference. First operand 745 states and 746 transitions. Second operand 95 states. [2018-04-13 05:24:55,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:24:55,556 INFO L93 Difference]: Finished difference Result 757 states and 758 transitions. [2018-04-13 05:24:55,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-13 05:24:55,556 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 739 [2018-04-13 05:24:55,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:24:55,557 INFO L225 Difference]: With dead ends: 757 [2018-04-13 05:24:55,557 INFO L226 Difference]: Without dead ends: 757 [2018-04-13 05:24:55,559 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1012 GetRequests, 829 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4358 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=12653, Invalid=21387, Unknown=0, NotChecked=0, Total=34040 [2018-04-13 05:24:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-04-13 05:24:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 753. [2018-04-13 05:24:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-04-13 05:24:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 754 transitions. [2018-04-13 05:24:55,562 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 754 transitions. Word has length 739 [2018-04-13 05:24:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:24:55,563 INFO L459 AbstractCegarLoop]: Abstraction has 753 states and 754 transitions. [2018-04-13 05:24:55,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-04-13 05:24:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 754 transitions. [2018-04-13 05:24:55,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2018-04-13 05:24:55,565 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:24:55,566 INFO L355 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 90, 90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:24:55,566 INFO L408 AbstractCegarLoop]: === Iteration 96 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:24:55,566 INFO L82 PathProgramCache]: Analyzing trace with hash -960631530, now seen corresponding path program 84 times [2018-04-13 05:24:55,566 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:24:55,566 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:24:55,566 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:24:55,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:24:55,567 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:24:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:24:55,658 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:24:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 32400 backedges. 0 proven. 16200 refuted. 0 times theorem prover too weak. 16200 trivial. 0 not checked. [2018-04-13 05:24:57,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:24:57,697 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:24:57,697 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:24:57,948 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2018-04-13 05:24:57,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:24:57,998 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:25:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 32400 backedges. 0 proven. 16200 refuted. 0 times theorem prover too weak. 16200 trivial. 0 not checked. [2018-04-13 05:25:00,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:25:00,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 94] total 186 [2018-04-13 05:25:00,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-04-13 05:25:00,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-04-13 05:25:00,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12835, Invalid=21575, Unknown=0, NotChecked=0, Total=34410 [2018-04-13 05:25:00,357 INFO L87 Difference]: Start difference. First operand 753 states and 754 transitions. Second operand 186 states. [2018-04-13 05:25:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:25:02,528 INFO L93 Difference]: Finished difference Result 765 states and 766 transitions. [2018-04-13 05:25:02,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-13 05:25:02,528 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 747 [2018-04-13 05:25:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:25:02,529 INFO L225 Difference]: With dead ends: 765 [2018-04-13 05:25:02,529 INFO L226 Difference]: Without dead ends: 765 [2018-04-13 05:25:02,530 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 656 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16468 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=13020, Invalid=21762, Unknown=0, NotChecked=0, Total=34782 [2018-04-13 05:25:02,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-04-13 05:25:02,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 761. [2018-04-13 05:25:02,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-04-13 05:25:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 762 transitions. [2018-04-13 05:25:02,533 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 762 transitions. Word has length 747 [2018-04-13 05:25:02,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:25:02,533 INFO L459 AbstractCegarLoop]: Abstraction has 761 states and 762 transitions. [2018-04-13 05:25:02,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-04-13 05:25:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 762 transitions. [2018-04-13 05:25:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2018-04-13 05:25:02,536 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:25:02,536 INFO L355 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 91, 91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:25:02,536 INFO L408 AbstractCegarLoop]: === Iteration 97 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:25:02,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1599661834, now seen corresponding path program 85 times [2018-04-13 05:25:02,537 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:25:02,537 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:25:02,537 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:25:02,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:25:02,537 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:25:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:25:02,622 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:25:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 33124 backedges. 0 proven. 16562 refuted. 0 times theorem prover too weak. 16562 trivial. 0 not checked. [2018-04-13 05:25:04,648 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:25:04,648 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:25:04,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:25:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:25:04,719 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:25:07,206 INFO L134 CoverageAnalysis]: Checked inductivity of 33124 backedges. 0 proven. 16562 refuted. 0 times theorem prover too weak. 16562 trivial. 0 not checked. [2018-04-13 05:25:07,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:25:07,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 95] total 188 [2018-04-13 05:25:07,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-04-13 05:25:07,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-04-13 05:25:07,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13114, Invalid=22042, Unknown=0, NotChecked=0, Total=35156 [2018-04-13 05:25:07,208 INFO L87 Difference]: Start difference. First operand 761 states and 762 transitions. Second operand 188 states. [2018-04-13 05:25:09,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:25:09,137 INFO L93 Difference]: Finished difference Result 773 states and 774 transitions. [2018-04-13 05:25:09,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-13 05:25:09,137 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 755 [2018-04-13 05:25:09,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:25:09,138 INFO L225 Difference]: With dead ends: 773 [2018-04-13 05:25:09,138 INFO L226 Difference]: Without dead ends: 773 [2018-04-13 05:25:09,139 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 663 SyntacticMatches, 1 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16833 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=13301, Invalid=22231, Unknown=0, NotChecked=0, Total=35532 [2018-04-13 05:25:09,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-04-13 05:25:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 769. [2018-04-13 05:25:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-04-13 05:25:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 770 transitions. [2018-04-13 05:25:09,142 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 770 transitions. Word has length 755 [2018-04-13 05:25:09,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:25:09,142 INFO L459 AbstractCegarLoop]: Abstraction has 769 states and 770 transitions. [2018-04-13 05:25:09,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-04-13 05:25:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 770 transitions. [2018-04-13 05:25:09,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 764 [2018-04-13 05:25:09,145 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:25:09,145 INFO L355 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 92, 92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:25:09,145 INFO L408 AbstractCegarLoop]: === Iteration 98 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:25:09,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1008487894, now seen corresponding path program 86 times [2018-04-13 05:25:09,146 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:25:09,146 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:25:09,146 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:25:09,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:25:09,146 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:25:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:25:09,231 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:25:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 33856 backedges. 0 proven. 16928 refuted. 0 times theorem prover too weak. 16928 trivial. 0 not checked. [2018-04-13 05:25:11,327 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:25:11,328 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:25:11,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:25:11,458 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:25:11,458 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:25:11,480 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:25:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 33856 backedges. 0 proven. 16928 refuted. 0 times theorem prover too weak. 16928 trivial. 0 not checked. [2018-04-13 05:25:11,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:25:11,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 95] total 98 [2018-04-13 05:25:11,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-04-13 05:25:11,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-04-13 05:25:11,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=4942, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 05:25:11,670 INFO L87 Difference]: Start difference. First operand 769 states and 770 transitions. Second operand 98 states. [2018-04-13 05:25:14,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:25:14,226 INFO L93 Difference]: Finished difference Result 781 states and 782 transitions. [2018-04-13 05:25:14,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-13 05:25:14,226 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 763 [2018-04-13 05:25:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:25:14,227 INFO L225 Difference]: With dead ends: 781 [2018-04-13 05:25:14,227 INFO L226 Difference]: Without dead ends: 781 [2018-04-13 05:25:14,228 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1045 GetRequests, 856 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4643 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=13493, Invalid=22797, Unknown=0, NotChecked=0, Total=36290 [2018-04-13 05:25:14,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2018-04-13 05:25:14,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 777. [2018-04-13 05:25:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2018-04-13 05:25:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 778 transitions. [2018-04-13 05:25:14,232 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 778 transitions. Word has length 763 [2018-04-13 05:25:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:25:14,232 INFO L459 AbstractCegarLoop]: Abstraction has 777 states and 778 transitions. [2018-04-13 05:25:14,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-04-13 05:25:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 778 transitions. [2018-04-13 05:25:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2018-04-13 05:25:14,236 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:25:14,236 INFO L355 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 93, 93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:25:14,236 INFO L408 AbstractCegarLoop]: === Iteration 99 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:25:14,236 INFO L82 PathProgramCache]: Analyzing trace with hash -35124298, now seen corresponding path program 87 times [2018-04-13 05:25:14,236 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:25:14,237 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:25:14,237 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:25:14,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:25:14,237 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:25:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:25:14,326 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:25:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 34596 backedges. 0 proven. 17298 refuted. 0 times theorem prover too weak. 17298 trivial. 0 not checked. [2018-04-13 05:25:16,481 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:25:16,481 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:25:16,482 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:25:16,668 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2018-04-13 05:25:16,668 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:25:16,727 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:25:16,917 INFO L134 CoverageAnalysis]: Checked inductivity of 34596 backedges. 0 proven. 17298 refuted. 0 times theorem prover too weak. 17298 trivial. 0 not checked. [2018-04-13 05:25:16,917 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:25:16,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 96] total 99 [2018-04-13 05:25:16,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-13 05:25:16,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-13 05:25:16,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4660, Invalid=5042, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 05:25:16,918 INFO L87 Difference]: Start difference. First operand 777 states and 778 transitions. Second operand 99 states. [2018-04-13 05:25:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:25:19,538 INFO L93 Difference]: Finished difference Result 789 states and 790 transitions. [2018-04-13 05:25:19,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-04-13 05:25:19,538 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 771 [2018-04-13 05:25:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:25:19,539 INFO L225 Difference]: With dead ends: 789 [2018-04-13 05:25:19,539 INFO L226 Difference]: Without dead ends: 789 [2018-04-13 05:25:19,540 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 865 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4740 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=13779, Invalid=23277, Unknown=0, NotChecked=0, Total=37056 [2018-04-13 05:25:19,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-04-13 05:25:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 785. [2018-04-13 05:25:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2018-04-13 05:25:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 786 transitions. [2018-04-13 05:25:19,543 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 786 transitions. Word has length 771 [2018-04-13 05:25:19,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:25:19,544 INFO L459 AbstractCegarLoop]: Abstraction has 785 states and 786 transitions. [2018-04-13 05:25:19,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-13 05:25:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 786 transitions. [2018-04-13 05:25:19,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2018-04-13 05:25:19,547 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:25:19,547 INFO L355 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:25:19,547 INFO L408 AbstractCegarLoop]: === Iteration 100 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:25:19,547 INFO L82 PathProgramCache]: Analyzing trace with hash -90910058, now seen corresponding path program 88 times [2018-04-13 05:25:19,547 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:25:19,547 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:25:19,548 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:25:19,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:25:19,548 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:25:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:25:19,636 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:25:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 35344 backedges. 0 proven. 17672 refuted. 0 times theorem prover too weak. 17672 trivial. 0 not checked. [2018-04-13 05:25:21,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:25:21,797 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:25:21,797 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:25:22,170 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:25:22,170 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:25:22,222 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:25:22,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:25:22,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:25:22,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:25:22,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:25:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 35344 backedges. 17672 proven. 17672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:25:32,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:25:32,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 194] total 291 [2018-04-13 05:25:32,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 291 states [2018-04-13 05:25:32,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 291 interpolants. [2018-04-13 05:25:32,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18818, Invalid=65572, Unknown=0, NotChecked=0, Total=84390 [2018-04-13 05:25:32,925 INFO L87 Difference]: Start difference. First operand 785 states and 786 transitions. Second operand 291 states. [2018-04-13 05:25:38,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:25:38,890 INFO L93 Difference]: Finished difference Result 797 states and 798 transitions. [2018-04-13 05:25:38,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-04-13 05:25:38,890 INFO L78 Accepts]: Start accepts. Automaton has 291 states. Word has length 779 [2018-04-13 05:25:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:25:38,891 INFO L225 Difference]: With dead ends: 797 [2018-04-13 05:25:38,891 INFO L226 Difference]: Without dead ends: 797 [2018-04-13 05:25:38,897 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 976 GetRequests, 588 SyntacticMatches, 1 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63741 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=32893, Invalid=118039, Unknown=0, NotChecked=0, Total=150932 [2018-04-13 05:25:38,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-04-13 05:25:38,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 793. [2018-04-13 05:25:38,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-04-13 05:25:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 794 transitions. [2018-04-13 05:25:38,902 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 794 transitions. Word has length 779 [2018-04-13 05:25:38,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:25:38,902 INFO L459 AbstractCegarLoop]: Abstraction has 793 states and 794 transitions. [2018-04-13 05:25:38,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 291 states. [2018-04-13 05:25:38,903 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 794 transitions. [2018-04-13 05:25:38,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2018-04-13 05:25:38,907 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:25:38,908 INFO L355 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 95, 95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:25:38,908 INFO L408 AbstractCegarLoop]: === Iteration 101 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:25:38,908 INFO L82 PathProgramCache]: Analyzing trace with hash 376250998, now seen corresponding path program 89 times [2018-04-13 05:25:38,908 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:25:38,908 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:25:38,909 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:25:38,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:25:38,909 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:25:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:25:39,006 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:25:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 36100 backedges. 0 proven. 18050 refuted. 0 times theorem prover too weak. 18050 trivial. 0 not checked. [2018-04-13 05:25:41,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:25:41,250 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:25:41,250 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:25:41,637 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2018-04-13 05:25:41,637 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:25:41,654 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:25:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 36100 backedges. 0 proven. 18050 refuted. 0 times theorem prover too weak. 18050 trivial. 0 not checked. [2018-04-13 05:25:41,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:25:41,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 98] total 101 [2018-04-13 05:25:41,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-04-13 05:25:41,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-04-13 05:25:41,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4855, Invalid=5245, Unknown=0, NotChecked=0, Total=10100 [2018-04-13 05:25:41,879 INFO L87 Difference]: Start difference. First operand 793 states and 794 transitions. Second operand 101 states. [2018-04-13 05:25:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:25:44,620 INFO L93 Difference]: Finished difference Result 805 states and 806 transitions. [2018-04-13 05:25:44,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-04-13 05:25:44,620 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 787 [2018-04-13 05:25:44,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:25:44,622 INFO L225 Difference]: With dead ends: 805 [2018-04-13 05:25:44,622 INFO L226 Difference]: Without dead ends: 805 [2018-04-13 05:25:44,623 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1078 GetRequests, 883 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4937 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=14360, Invalid=24252, Unknown=0, NotChecked=0, Total=38612 [2018-04-13 05:25:44,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-04-13 05:25:44,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 801. [2018-04-13 05:25:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-04-13 05:25:44,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 802 transitions. [2018-04-13 05:25:44,627 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 802 transitions. Word has length 787 [2018-04-13 05:25:44,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:25:44,628 INFO L459 AbstractCegarLoop]: Abstraction has 801 states and 802 transitions. [2018-04-13 05:25:44,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-04-13 05:25:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 802 transitions. [2018-04-13 05:25:44,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2018-04-13 05:25:44,631 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:25:44,631 INFO L355 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 96, 96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:25:44,631 INFO L408 AbstractCegarLoop]: === Iteration 102 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:25:44,631 INFO L82 PathProgramCache]: Analyzing trace with hash 628849494, now seen corresponding path program 90 times [2018-04-13 05:25:44,631 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:25:44,631 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:25:44,631 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:25:44,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:25:44,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:25:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:25:44,742 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:25:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 36864 backedges. 0 proven. 18432 refuted. 0 times theorem prover too weak. 18432 trivial. 0 not checked. [2018-04-13 05:25:47,035 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:25:47,035 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:25:47,036 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:25:47,538 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2018-04-13 05:25:47,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:25:47,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:25:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 36864 backedges. 0 proven. 18432 refuted. 0 times theorem prover too weak. 18432 trivial. 0 not checked. [2018-04-13 05:25:50,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:25:50,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 100] total 198 [2018-04-13 05:25:50,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-04-13 05:25:50,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-04-13 05:25:50,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14554, Invalid=24452, Unknown=0, NotChecked=0, Total=39006 [2018-04-13 05:25:50,318 INFO L87 Difference]: Start difference. First operand 801 states and 802 transitions. Second operand 198 states. [2018-04-13 05:25:52,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:25:52,694 INFO L93 Difference]: Finished difference Result 813 states and 814 transitions. [2018-04-13 05:25:52,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-04-13 05:25:52,694 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 795 [2018-04-13 05:25:52,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:25:52,696 INFO L225 Difference]: With dead ends: 813 [2018-04-13 05:25:52,696 INFO L226 Difference]: Without dead ends: 813 [2018-04-13 05:25:52,697 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 896 GetRequests, 698 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18718 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=14751, Invalid=24651, Unknown=0, NotChecked=0, Total=39402 [2018-04-13 05:25:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-04-13 05:25:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 809. [2018-04-13 05:25:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-04-13 05:25:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 810 transitions. [2018-04-13 05:25:52,701 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 810 transitions. Word has length 795 [2018-04-13 05:25:52,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:25:52,701 INFO L459 AbstractCegarLoop]: Abstraction has 809 states and 810 transitions. [2018-04-13 05:25:52,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-04-13 05:25:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 810 transitions. [2018-04-13 05:25:52,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 804 [2018-04-13 05:25:52,705 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:25:52,705 INFO L355 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 97, 97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:25:52,705 INFO L408 AbstractCegarLoop]: === Iteration 103 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:25:52,705 INFO L82 PathProgramCache]: Analyzing trace with hash 193617206, now seen corresponding path program 91 times [2018-04-13 05:25:52,705 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:25:52,706 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:25:52,706 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:25:52,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:25:52,706 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:25:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:25:52,804 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:25:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 37636 backedges. 0 proven. 18818 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2018-04-13 05:25:55,086 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:25:55,087 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:25:55,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:25:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:25:55,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:25:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 37636 backedges. 0 proven. 18818 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2018-04-13 05:25:57,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:25:57,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 101] total 200 [2018-04-13 05:25:57,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-04-13 05:25:57,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-04-13 05:25:57,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14851, Invalid=24949, Unknown=0, NotChecked=0, Total=39800 [2018-04-13 05:25:57,951 INFO L87 Difference]: Start difference. First operand 809 states and 810 transitions. Second operand 200 states. [2018-04-13 05:26:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:26:00,396 INFO L93 Difference]: Finished difference Result 821 states and 822 transitions. [2018-04-13 05:26:00,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-04-13 05:26:00,396 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 803 [2018-04-13 05:26:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:26:00,397 INFO L225 Difference]: With dead ends: 821 [2018-04-13 05:26:00,397 INFO L226 Difference]: Without dead ends: 821 [2018-04-13 05:26:00,398 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 905 GetRequests, 705 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19107 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=15050, Invalid=25150, Unknown=0, NotChecked=0, Total=40200 [2018-04-13 05:26:00,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2018-04-13 05:26:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 817. [2018-04-13 05:26:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-04-13 05:26:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 818 transitions. [2018-04-13 05:26:00,402 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 818 transitions. Word has length 803 [2018-04-13 05:26:00,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:26:00,402 INFO L459 AbstractCegarLoop]: Abstraction has 817 states and 818 transitions. [2018-04-13 05:26:00,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-04-13 05:26:00,402 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 818 transitions. [2018-04-13 05:26:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2018-04-13 05:26:00,405 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:26:00,405 INFO L355 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 98, 98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:26:00,405 INFO L408 AbstractCegarLoop]: === Iteration 104 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:26:00,405 INFO L82 PathProgramCache]: Analyzing trace with hash -601602026, now seen corresponding path program 92 times [2018-04-13 05:26:00,406 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:26:00,406 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:26:00,406 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:26:00,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:26:00,406 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:26:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:26:00,521 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:26:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 38416 backedges. 0 proven. 19208 refuted. 0 times theorem prover too weak. 19208 trivial. 0 not checked. [2018-04-13 05:26:03,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:26:03,173 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:26:03,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:26:03,350 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:26:03,350 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:26:03,366 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:26:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 38416 backedges. 0 proven. 19208 refuted. 0 times theorem prover too weak. 19208 trivial. 0 not checked. [2018-04-13 05:26:03,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:26:03,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 101] total 104 [2018-04-13 05:26:03,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-04-13 05:26:03,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-04-13 05:26:03,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5155, Invalid=5557, Unknown=0, NotChecked=0, Total=10712 [2018-04-13 05:26:03,574 INFO L87 Difference]: Start difference. First operand 817 states and 818 transitions. Second operand 104 states. [2018-04-13 05:26:06,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:26:06,507 INFO L93 Difference]: Finished difference Result 829 states and 830 transitions. [2018-04-13 05:26:06,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-04-13 05:26:06,507 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 811 [2018-04-13 05:26:06,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:26:06,508 INFO L225 Difference]: With dead ends: 829 [2018-04-13 05:26:06,508 INFO L226 Difference]: Without dead ends: 829 [2018-04-13 05:26:06,509 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1111 GetRequests, 910 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5240 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=15254, Invalid=25752, Unknown=0, NotChecked=0, Total=41006 [2018-04-13 05:26:06,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-04-13 05:26:06,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 825. [2018-04-13 05:26:06,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-04-13 05:26:06,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 826 transitions. [2018-04-13 05:26:06,514 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 826 transitions. Word has length 811 [2018-04-13 05:26:06,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:26:06,515 INFO L459 AbstractCegarLoop]: Abstraction has 825 states and 826 transitions. [2018-04-13 05:26:06,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-04-13 05:26:06,515 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 826 transitions. [2018-04-13 05:26:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2018-04-13 05:26:06,520 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:26:06,520 INFO L355 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 99, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:26:06,520 INFO L408 AbstractCegarLoop]: === Iteration 105 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:26:06,520 INFO L82 PathProgramCache]: Analyzing trace with hash -90981386, now seen corresponding path program 93 times [2018-04-13 05:26:06,520 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:26:06,520 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:26:06,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:26:06,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:26:06,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:26:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:26:06,639 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:26:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 39204 backedges. 0 proven. 19602 refuted. 0 times theorem prover too weak. 19602 trivial. 0 not checked. [2018-04-13 05:26:09,041 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:26:09,041 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:26:09,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:26:09,268 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2018-04-13 05:26:09,268 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:26:09,419 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:26:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 39204 backedges. 0 proven. 19602 refuted. 0 times theorem prover too weak. 19602 trivial. 0 not checked. [2018-04-13 05:26:12,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:26:12,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 103] total 204 [2018-04-13 05:26:12,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-04-13 05:26:12,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-04-13 05:26:12,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15454, Invalid=25958, Unknown=0, NotChecked=0, Total=41412 [2018-04-13 05:26:12,314 INFO L87 Difference]: Start difference. First operand 825 states and 826 transitions. Second operand 204 states. [2018-04-13 05:26:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:26:14,933 INFO L93 Difference]: Finished difference Result 837 states and 838 transitions. [2018-04-13 05:26:14,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-04-13 05:26:14,933 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 819 [2018-04-13 05:26:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:26:14,934 INFO L225 Difference]: With dead ends: 837 [2018-04-13 05:26:14,935 INFO L226 Difference]: Without dead ends: 837 [2018-04-13 05:26:14,935 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 923 GetRequests, 719 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19897 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=15657, Invalid=26163, Unknown=0, NotChecked=0, Total=41820 [2018-04-13 05:26:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2018-04-13 05:26:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 833. [2018-04-13 05:26:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2018-04-13 05:26:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 834 transitions. [2018-04-13 05:26:14,940 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 834 transitions. Word has length 819 [2018-04-13 05:26:14,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:26:14,940 INFO L459 AbstractCegarLoop]: Abstraction has 833 states and 834 transitions. [2018-04-13 05:26:14,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-04-13 05:26:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 834 transitions. [2018-04-13 05:26:14,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2018-04-13 05:26:14,945 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:26:14,945 INFO L355 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:26:14,945 INFO L408 AbstractCegarLoop]: === Iteration 106 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:26:14,946 INFO L82 PathProgramCache]: Analyzing trace with hash 971192534, now seen corresponding path program 94 times [2018-04-13 05:26:14,946 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:26:14,946 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:26:14,946 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:26:14,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:26:14,946 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:26:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:26:15,083 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:26:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 40000 backedges. 0 proven. 20000 refuted. 0 times theorem prover too weak. 20000 trivial. 0 not checked. [2018-04-13 05:26:17,541 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:26:17,541 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:26:17,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:26:18,052 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:26:18,052 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:26:18,103 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:26:18,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:26:18,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:26:18,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:26:18,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:26:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 40000 backedges. 20000 proven. 20000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:26:30,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:26:30,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 206] total 309 [2018-04-13 05:26:30,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 309 states [2018-04-13 05:26:30,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 309 interpolants. [2018-04-13 05:26:30,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21218, Invalid=73954, Unknown=0, NotChecked=0, Total=95172 [2018-04-13 05:26:30,157 INFO L87 Difference]: Start difference. First operand 833 states and 834 transitions. Second operand 309 states. [2018-04-13 05:26:37,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:26:37,085 INFO L93 Difference]: Finished difference Result 845 states and 846 transitions. [2018-04-13 05:26:37,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-04-13 05:26:37,085 INFO L78 Accepts]: Start accepts. Automaton has 309 states. Word has length 827 [2018-04-13 05:26:37,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:26:37,086 INFO L225 Difference]: With dead ends: 845 [2018-04-13 05:26:37,086 INFO L226 Difference]: Without dead ends: 845 [2018-04-13 05:26:37,090 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1036 GetRequests, 624 SyntacticMatches, 1 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72009 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=37090, Invalid=133066, Unknown=0, NotChecked=0, Total=170156 [2018-04-13 05:26:37,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-04-13 05:26:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 841. [2018-04-13 05:26:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-04-13 05:26:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 842 transitions. [2018-04-13 05:26:37,093 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 842 transitions. Word has length 827 [2018-04-13 05:26:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:26:37,093 INFO L459 AbstractCegarLoop]: Abstraction has 841 states and 842 transitions. [2018-04-13 05:26:37,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 309 states. [2018-04-13 05:26:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 842 transitions. [2018-04-13 05:26:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2018-04-13 05:26:37,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:26:37,096 INFO L355 BasicCegarLoop]: trace histogram [102, 102, 101, 101, 101, 101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:26:37,096 INFO L408 AbstractCegarLoop]: === Iteration 107 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:26:37,097 INFO L82 PathProgramCache]: Analyzing trace with hash -52609354, now seen corresponding path program 95 times [2018-04-13 05:26:37,097 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:26:37,097 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:26:37,097 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:26:37,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:26:37,097 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:26:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:26:37,217 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:26:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 40804 backedges. 0 proven. 20402 refuted. 0 times theorem prover too weak. 20402 trivial. 0 not checked. [2018-04-13 05:26:39,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:26:39,672 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:26:39,672 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:26:40,246 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 102 check-sat command(s) [2018-04-13 05:26:40,246 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:26:40,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:26:40,522 INFO L134 CoverageAnalysis]: Checked inductivity of 40804 backedges. 0 proven. 20402 refuted. 0 times theorem prover too weak. 20402 trivial. 0 not checked. [2018-04-13 05:26:40,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:26:40,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 104] total 107 [2018-04-13 05:26:40,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-04-13 05:26:40,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-04-13 05:26:40,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5464, Invalid=5878, Unknown=0, NotChecked=0, Total=11342 [2018-04-13 05:26:40,524 INFO L87 Difference]: Start difference. First operand 841 states and 842 transitions. Second operand 107 states. [2018-04-13 05:26:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:26:43,509 INFO L93 Difference]: Finished difference Result 853 states and 854 transitions. [2018-04-13 05:26:43,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-04-13 05:26:43,509 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 835 [2018-04-13 05:26:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:26:43,510 INFO L225 Difference]: With dead ends: 853 [2018-04-13 05:26:43,511 INFO L226 Difference]: Without dead ends: 853 [2018-04-13 05:26:43,511 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1144 GetRequests, 937 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5552 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=16175, Invalid=27297, Unknown=0, NotChecked=0, Total=43472 [2018-04-13 05:26:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-04-13 05:26:43,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 849. [2018-04-13 05:26:43,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-04-13 05:26:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 850 transitions. [2018-04-13 05:26:43,514 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 850 transitions. Word has length 835 [2018-04-13 05:26:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:26:43,515 INFO L459 AbstractCegarLoop]: Abstraction has 849 states and 850 transitions. [2018-04-13 05:26:43,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-04-13 05:26:43,515 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 850 transitions. [2018-04-13 05:26:43,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2018-04-13 05:26:43,518 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:26:43,518 INFO L355 BasicCegarLoop]: trace histogram [103, 103, 102, 102, 102, 102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:26:43,518 INFO L408 AbstractCegarLoop]: === Iteration 108 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:26:43,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1443646870, now seen corresponding path program 96 times [2018-04-13 05:26:43,518 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:26:43,518 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:26:43,518 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:26:43,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:26:43,519 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:26:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:26:43,623 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:26:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 41616 backedges. 0 proven. 20808 refuted. 0 times theorem prover too weak. 20808 trivial. 0 not checked. [2018-04-13 05:26:46,186 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:26:46,186 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:26:46,186 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:26:46,441 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 103 check-sat command(s) [2018-04-13 05:26:46,441 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:26:46,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:26:49,551 INFO L134 CoverageAnalysis]: Checked inductivity of 41616 backedges. 0 proven. 20808 refuted. 0 times theorem prover too weak. 20808 trivial. 0 not checked. [2018-04-13 05:26:49,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:26:49,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 106] total 210 [2018-04-13 05:26:49,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-04-13 05:26:49,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-04-13 05:26:49,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16381, Invalid=27509, Unknown=0, NotChecked=0, Total=43890 [2018-04-13 05:26:49,554 INFO L87 Difference]: Start difference. First operand 849 states and 850 transitions. Second operand 210 states. [2018-04-13 05:26:52,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:26:52,633 INFO L93 Difference]: Finished difference Result 861 states and 862 transitions. [2018-04-13 05:26:52,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-04-13 05:26:52,634 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 843 [2018-04-13 05:26:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:26:52,635 INFO L225 Difference]: With dead ends: 861 [2018-04-13 05:26:52,635 INFO L226 Difference]: Without dead ends: 861 [2018-04-13 05:26:52,636 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 740 SyntacticMatches, 1 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21112 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=16590, Invalid=27720, Unknown=0, NotChecked=0, Total=44310 [2018-04-13 05:26:52,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-04-13 05:26:52,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 857. [2018-04-13 05:26:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2018-04-13 05:26:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 858 transitions. [2018-04-13 05:26:52,640 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 858 transitions. Word has length 843 [2018-04-13 05:26:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:26:52,640 INFO L459 AbstractCegarLoop]: Abstraction has 857 states and 858 transitions. [2018-04-13 05:26:52,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-04-13 05:26:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 858 transitions. [2018-04-13 05:26:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2018-04-13 05:26:52,643 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:26:52,644 INFO L355 BasicCegarLoop]: trace histogram [104, 104, 103, 103, 103, 103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:26:52,644 INFO L408 AbstractCegarLoop]: === Iteration 109 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:26:52,644 INFO L82 PathProgramCache]: Analyzing trace with hash 666559862, now seen corresponding path program 97 times [2018-04-13 05:26:52,644 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:26:52,644 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:26:52,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:26:52,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:26:52,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:26:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:26:52,803 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:26:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 42436 backedges. 0 proven. 21218 refuted. 0 times theorem prover too weak. 21218 trivial. 0 not checked. [2018-04-13 05:26:55,382 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:26:55,382 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:26:55,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:26:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:26:55,473 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:26:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 42436 backedges. 0 proven. 21218 refuted. 0 times theorem prover too weak. 21218 trivial. 0 not checked. [2018-04-13 05:26:58,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:26:58,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 107] total 212 [2018-04-13 05:26:58,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 212 states [2018-04-13 05:26:58,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2018-04-13 05:26:58,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16696, Invalid=28036, Unknown=0, NotChecked=0, Total=44732 [2018-04-13 05:26:58,528 INFO L87 Difference]: Start difference. First operand 857 states and 858 transitions. Second operand 212 states. [2018-04-13 05:27:01,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:27:01,329 INFO L93 Difference]: Finished difference Result 869 states and 870 transitions. [2018-04-13 05:27:01,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-04-13 05:27:01,343 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 851 [2018-04-13 05:27:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:27:01,344 INFO L225 Difference]: With dead ends: 869 [2018-04-13 05:27:01,344 INFO L226 Difference]: Without dead ends: 869 [2018-04-13 05:27:01,345 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 959 GetRequests, 747 SyntacticMatches, 1 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21525 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=16907, Invalid=28249, Unknown=0, NotChecked=0, Total=45156 [2018-04-13 05:27:01,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-04-13 05:27:01,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 865. [2018-04-13 05:27:01,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-04-13 05:27:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 866 transitions. [2018-04-13 05:27:01,349 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 866 transitions. Word has length 851 [2018-04-13 05:27:01,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:27:01,349 INFO L459 AbstractCegarLoop]: Abstraction has 865 states and 866 transitions. [2018-04-13 05:27:01,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 212 states. [2018-04-13 05:27:01,349 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 866 transitions. [2018-04-13 05:27:01,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 860 [2018-04-13 05:27:01,353 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:27:01,353 INFO L355 BasicCegarLoop]: trace histogram [105, 105, 104, 104, 104, 104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:27:01,353 INFO L408 AbstractCegarLoop]: === Iteration 110 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:27:01,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1140033110, now seen corresponding path program 98 times [2018-04-13 05:27:01,353 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:27:01,353 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:27:01,353 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:27:01,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:27:01,353 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:27:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:27:01,465 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:27:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 43264 backedges. 0 proven. 21632 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2018-04-13 05:27:04,475 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:27:04,475 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:27:04,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:27:04,650 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:27:04,650 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:27:04,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:27:04,898 INFO L134 CoverageAnalysis]: Checked inductivity of 43264 backedges. 0 proven. 21632 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2018-04-13 05:27:04,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:27:04,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 107] total 110 [2018-04-13 05:27:04,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-04-13 05:27:04,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-04-13 05:27:04,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5782, Invalid=6208, Unknown=0, NotChecked=0, Total=11990 [2018-04-13 05:27:04,899 INFO L87 Difference]: Start difference. First operand 865 states and 866 transitions. Second operand 110 states. [2018-04-13 05:27:08,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:27:08,087 INFO L93 Difference]: Finished difference Result 877 states and 878 transitions. [2018-04-13 05:27:08,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-04-13 05:27:08,087 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 859 [2018-04-13 05:27:08,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:27:08,088 INFO L225 Difference]: With dead ends: 877 [2018-04-13 05:27:08,088 INFO L226 Difference]: Without dead ends: 877 [2018-04-13 05:27:08,089 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1177 GetRequests, 964 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5873 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=17123, Invalid=28887, Unknown=0, NotChecked=0, Total=46010 [2018-04-13 05:27:08,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-04-13 05:27:08,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 873. [2018-04-13 05:27:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-04-13 05:27:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 874 transitions. [2018-04-13 05:27:08,093 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 874 transitions. Word has length 859 [2018-04-13 05:27:08,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:27:08,093 INFO L459 AbstractCegarLoop]: Abstraction has 873 states and 874 transitions. [2018-04-13 05:27:08,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-04-13 05:27:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 874 transitions. [2018-04-13 05:27:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2018-04-13 05:27:08,097 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:27:08,097 INFO L355 BasicCegarLoop]: trace histogram [106, 106, 105, 105, 105, 105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:27:08,097 INFO L408 AbstractCegarLoop]: === Iteration 111 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:27:08,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1937723338, now seen corresponding path program 99 times [2018-04-13 05:27:08,097 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:27:08,097 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:27:08,098 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:27:08,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:27:08,098 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:27:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:27:08,246 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:27:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 44100 backedges. 0 proven. 22050 refuted. 0 times theorem prover too weak. 22050 trivial. 0 not checked. [2018-04-13 05:27:10,974 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:27:10,974 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:27:10,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:27:11,234 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 106 check-sat command(s) [2018-04-13 05:27:11,234 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:27:11,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:27:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 44100 backedges. 0 proven. 22050 refuted. 0 times theorem prover too weak. 22050 trivial. 0 not checked. [2018-04-13 05:27:11,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:27:11,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 108] total 111 [2018-04-13 05:27:11,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-04-13 05:27:11,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-04-13 05:27:11,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5890, Invalid=6320, Unknown=0, NotChecked=0, Total=12210 [2018-04-13 05:27:11,710 INFO L87 Difference]: Start difference. First operand 873 states and 874 transitions. Second operand 111 states. [2018-04-13 05:27:14,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:27:14,962 INFO L93 Difference]: Finished difference Result 885 states and 886 transitions. [2018-04-13 05:27:14,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-04-13 05:27:14,962 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 867 [2018-04-13 05:27:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:27:14,963 INFO L225 Difference]: With dead ends: 885 [2018-04-13 05:27:14,963 INFO L226 Difference]: Without dead ends: 885 [2018-04-13 05:27:14,964 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1188 GetRequests, 973 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5982 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=17445, Invalid=29427, Unknown=0, NotChecked=0, Total=46872 [2018-04-13 05:27:14,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-04-13 05:27:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 881. [2018-04-13 05:27:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2018-04-13 05:27:14,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 882 transitions. [2018-04-13 05:27:14,966 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 882 transitions. Word has length 867 [2018-04-13 05:27:14,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:27:14,967 INFO L459 AbstractCegarLoop]: Abstraction has 881 states and 882 transitions. [2018-04-13 05:27:14,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-04-13 05:27:14,967 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 882 transitions. [2018-04-13 05:27:14,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2018-04-13 05:27:14,970 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:27:14,970 INFO L355 BasicCegarLoop]: trace histogram [107, 107, 106, 106, 106, 106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:27:14,970 INFO L408 AbstractCegarLoop]: === Iteration 112 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:27:14,970 INFO L82 PathProgramCache]: Analyzing trace with hash 317514518, now seen corresponding path program 100 times [2018-04-13 05:27:14,970 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:27:14,970 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:27:14,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:27:14,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:27:14,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:27:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:27:15,092 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:27:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 44944 backedges. 0 proven. 22472 refuted. 0 times theorem prover too weak. 22472 trivial. 0 not checked. [2018-04-13 05:27:17,938 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:27:17,938 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:27:17,938 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:27:18,610 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:27:18,611 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:27:18,673 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:27:18,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:27:18,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:27:18,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:27:18,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:27:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 44944 backedges. 22472 proven. 22472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:27:32,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:27:32,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 218] total 327 [2018-04-13 05:27:32,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 327 states [2018-04-13 05:27:32,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 327 interpolants. [2018-04-13 05:27:32,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23762, Invalid=82840, Unknown=0, NotChecked=0, Total=106602 [2018-04-13 05:27:32,403 INFO L87 Difference]: Start difference. First operand 881 states and 882 transitions. Second operand 327 states. [2018-04-13 05:27:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:27:40,651 INFO L93 Difference]: Finished difference Result 893 states and 894 transitions. [2018-04-13 05:27:40,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-04-13 05:27:40,651 INFO L78 Accepts]: Start accepts. Automaton has 327 states. Word has length 875 [2018-04-13 05:27:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:27:40,652 INFO L225 Difference]: With dead ends: 893 [2018-04-13 05:27:40,652 INFO L226 Difference]: Without dead ends: 893 [2018-04-13 05:27:40,657 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1096 GetRequests, 660 SyntacticMatches, 1 SemanticMatches, 435 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80781 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=41539, Invalid=148993, Unknown=0, NotChecked=0, Total=190532 [2018-04-13 05:27:40,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-04-13 05:27:40,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 889. [2018-04-13 05:27:40,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-04-13 05:27:40,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 890 transitions. [2018-04-13 05:27:40,660 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 890 transitions. Word has length 875 [2018-04-13 05:27:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:27:40,660 INFO L459 AbstractCegarLoop]: Abstraction has 889 states and 890 transitions. [2018-04-13 05:27:40,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 327 states. [2018-04-13 05:27:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 890 transitions. [2018-04-13 05:27:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 884 [2018-04-13 05:27:40,664 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:27:40,664 INFO L355 BasicCegarLoop]: trace histogram [108, 108, 107, 107, 107, 107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:27:40,664 INFO L408 AbstractCegarLoop]: === Iteration 113 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:27:40,664 INFO L82 PathProgramCache]: Analyzing trace with hash 948084470, now seen corresponding path program 101 times [2018-04-13 05:27:40,664 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:27:40,664 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:27:40,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:27:40,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:27:40,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:27:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:27:40,793 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:27:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 45796 backedges. 0 proven. 22898 refuted. 0 times theorem prover too weak. 22898 trivial. 0 not checked. [2018-04-13 05:27:43,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:27:43,530 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:27:43,530 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:27:44,110 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 108 check-sat command(s) [2018-04-13 05:27:44,110 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:27:44,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:27:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 45796 backedges. 0 proven. 22898 refuted. 0 times theorem prover too weak. 22898 trivial. 0 not checked. [2018-04-13 05:27:44,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:27:44,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 110] total 113 [2018-04-13 05:27:44,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-04-13 05:27:44,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-04-13 05:27:44,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6109, Invalid=6547, Unknown=0, NotChecked=0, Total=12656 [2018-04-13 05:27:44,367 INFO L87 Difference]: Start difference. First operand 889 states and 890 transitions. Second operand 113 states. [2018-04-13 05:27:47,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:27:47,749 INFO L93 Difference]: Finished difference Result 901 states and 902 transitions. [2018-04-13 05:27:47,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-04-13 05:27:47,749 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 883 [2018-04-13 05:27:47,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:27:47,750 INFO L225 Difference]: With dead ends: 901 [2018-04-13 05:27:47,750 INFO L226 Difference]: Without dead ends: 901 [2018-04-13 05:27:47,752 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1210 GetRequests, 991 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6203 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=18098, Invalid=30522, Unknown=0, NotChecked=0, Total=48620 [2018-04-13 05:27:47,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2018-04-13 05:27:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 897. [2018-04-13 05:27:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-04-13 05:27:47,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 898 transitions. [2018-04-13 05:27:47,758 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 898 transitions. Word has length 883 [2018-04-13 05:27:47,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:27:47,758 INFO L459 AbstractCegarLoop]: Abstraction has 897 states and 898 transitions. [2018-04-13 05:27:47,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-04-13 05:27:47,758 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 898 transitions. [2018-04-13 05:27:47,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2018-04-13 05:27:47,764 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:27:47,764 INFO L355 BasicCegarLoop]: trace histogram [109, 109, 108, 108, 108, 108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:27:47,764 INFO L408 AbstractCegarLoop]: === Iteration 114 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:27:47,764 INFO L82 PathProgramCache]: Analyzing trace with hash -833854506, now seen corresponding path program 102 times [2018-04-13 05:27:47,765 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:27:47,765 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:27:47,765 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:27:47,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:27:47,765 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:27:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:27:47,907 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:27:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 46656 backedges. 0 proven. 23328 refuted. 0 times theorem prover too weak. 23328 trivial. 0 not checked. [2018-04-13 05:27:50,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:27:50,687 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:27:50,687 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:27:51,039 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 109 check-sat command(s) [2018-04-13 05:27:51,039 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:27:51,168 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:27:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 46656 backedges. 0 proven. 23328 refuted. 0 times theorem prover too weak. 23328 trivial. 0 not checked. [2018-04-13 05:27:51,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:27:51,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 111] total 114 [2018-04-13 05:27:51,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-04-13 05:27:51,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-04-13 05:27:51,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6220, Invalid=6662, Unknown=0, NotChecked=0, Total=12882 [2018-04-13 05:27:51,410 INFO L87 Difference]: Start difference. First operand 897 states and 898 transitions. Second operand 114 states. [2018-04-13 05:27:54,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:27:54,892 INFO L93 Difference]: Finished difference Result 909 states and 910 transitions. [2018-04-13 05:27:54,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-04-13 05:27:54,892 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 891 [2018-04-13 05:27:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:27:54,893 INFO L225 Difference]: With dead ends: 909 [2018-04-13 05:27:54,893 INFO L226 Difference]: Without dead ends: 909 [2018-04-13 05:27:54,894 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1221 GetRequests, 1000 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6315 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=18429, Invalid=31077, Unknown=0, NotChecked=0, Total=49506 [2018-04-13 05:27:54,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-04-13 05:27:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 905. [2018-04-13 05:27:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-04-13 05:27:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 906 transitions. [2018-04-13 05:27:54,898 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 906 transitions. Word has length 891 [2018-04-13 05:27:54,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:27:54,898 INFO L459 AbstractCegarLoop]: Abstraction has 905 states and 906 transitions. [2018-04-13 05:27:54,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-04-13 05:27:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 906 transitions. [2018-04-13 05:27:54,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 900 [2018-04-13 05:27:54,901 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:27:54,901 INFO L355 BasicCegarLoop]: trace histogram [110, 110, 109, 109, 109, 109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:27:54,901 INFO L408 AbstractCegarLoop]: === Iteration 115 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:27:54,902 INFO L82 PathProgramCache]: Analyzing trace with hash 890548662, now seen corresponding path program 103 times [2018-04-13 05:27:54,902 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:27:54,902 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:27:54,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:27:54,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:27:54,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:27:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:27:55,036 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:27:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 47524 backedges. 0 proven. 23762 refuted. 0 times theorem prover too weak. 23762 trivial. 0 not checked. [2018-04-13 05:27:57,830 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:27:57,830 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:27:57,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:27:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:27:57,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:28:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 47524 backedges. 0 proven. 23762 refuted. 0 times theorem prover too weak. 23762 trivial. 0 not checked. [2018-04-13 05:28:01,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:28:01,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 113] total 224 [2018-04-13 05:28:01,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 224 states [2018-04-13 05:28:01,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 224 interpolants. [2018-04-13 05:28:01,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18649, Invalid=31303, Unknown=0, NotChecked=0, Total=49952 [2018-04-13 05:28:01,315 INFO L87 Difference]: Start difference. First operand 905 states and 906 transitions. Second operand 224 states. [2018-04-13 05:28:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:28:05,173 INFO L93 Difference]: Finished difference Result 917 states and 918 transitions. [2018-04-13 05:28:05,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-04-13 05:28:05,173 INFO L78 Accepts]: Start accepts. Automaton has 224 states. Word has length 899 [2018-04-13 05:28:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:28:05,175 INFO L225 Difference]: With dead ends: 917 [2018-04-13 05:28:05,175 INFO L226 Difference]: Without dead ends: 917 [2018-04-13 05:28:05,176 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1013 GetRequests, 789 SyntacticMatches, 1 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24087 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=18872, Invalid=31528, Unknown=0, NotChecked=0, Total=50400 [2018-04-13 05:28:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-04-13 05:28:05,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 913. [2018-04-13 05:28:05,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2018-04-13 05:28:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 914 transitions. [2018-04-13 05:28:05,179 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 914 transitions. Word has length 899 [2018-04-13 05:28:05,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:28:05,179 INFO L459 AbstractCegarLoop]: Abstraction has 913 states and 914 transitions. [2018-04-13 05:28:05,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 224 states. [2018-04-13 05:28:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 914 transitions. [2018-04-13 05:28:05,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 908 [2018-04-13 05:28:05,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:28:05,183 INFO L355 BasicCegarLoop]: trace histogram [111, 111, 110, 110, 110, 110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:28:05,183 INFO L408 AbstractCegarLoop]: === Iteration 116 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:28:05,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2103838870, now seen corresponding path program 104 times [2018-04-13 05:28:05,183 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:28:05,183 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:28:05,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:28:05,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:28:05,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:28:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:28:05,326 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:28:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 48400 backedges. 0 proven. 24200 refuted. 0 times theorem prover too weak. 24200 trivial. 0 not checked. [2018-04-13 05:28:08,165 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:28:08,165 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:28:08,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:28:08,360 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:28:08,360 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:28:08,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:28:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 48400 backedges. 0 proven. 24200 refuted. 0 times theorem prover too weak. 24200 trivial. 0 not checked. [2018-04-13 05:28:08,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:28:08,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 113] total 116 [2018-04-13 05:28:08,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-04-13 05:28:08,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-04-13 05:28:08,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6445, Invalid=6895, Unknown=0, NotChecked=0, Total=13340 [2018-04-13 05:28:08,665 INFO L87 Difference]: Start difference. First operand 913 states and 914 transitions. Second operand 116 states. [2018-04-13 05:28:12,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:28:12,306 INFO L93 Difference]: Finished difference Result 925 states and 926 transitions. [2018-04-13 05:28:12,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-04-13 05:28:12,323 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 907 [2018-04-13 05:28:12,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:28:12,324 INFO L225 Difference]: With dead ends: 925 [2018-04-13 05:28:12,324 INFO L226 Difference]: Without dead ends: 925 [2018-04-13 05:28:12,325 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1243 GetRequests, 1018 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6542 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=19100, Invalid=32202, Unknown=0, NotChecked=0, Total=51302 [2018-04-13 05:28:12,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-04-13 05:28:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 921. [2018-04-13 05:28:12,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2018-04-13 05:28:12,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 922 transitions. [2018-04-13 05:28:12,328 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 922 transitions. Word has length 907 [2018-04-13 05:28:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:28:12,328 INFO L459 AbstractCegarLoop]: Abstraction has 921 states and 922 transitions. [2018-04-13 05:28:12,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-04-13 05:28:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 922 transitions. [2018-04-13 05:28:12,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2018-04-13 05:28:12,332 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:28:12,332 INFO L355 BasicCegarLoop]: trace histogram [112, 112, 111, 111, 111, 111, 111, 111, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:28:12,332 INFO L408 AbstractCegarLoop]: === Iteration 117 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:28:12,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2020939658, now seen corresponding path program 105 times [2018-04-13 05:28:12,332 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:28:12,332 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:28:12,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:28:12,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:28:12,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:28:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:28:12,474 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:28:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 49284 backedges. 0 proven. 24642 refuted. 0 times theorem prover too weak. 24642 trivial. 0 not checked. [2018-04-13 05:28:15,371 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:28:15,371 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:28:15,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:28:15,674 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 112 check-sat command(s) [2018-04-13 05:28:15,674 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:28:15,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:28:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 49284 backedges. 0 proven. 24642 refuted. 0 times theorem prover too weak. 24642 trivial. 0 not checked. [2018-04-13 05:28:19,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:28:19,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 115] total 228 [2018-04-13 05:28:19,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 228 states [2018-04-13 05:28:19,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 228 interpolants. [2018-04-13 05:28:19,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19324, Invalid=32432, Unknown=0, NotChecked=0, Total=51756 [2018-04-13 05:28:19,300 INFO L87 Difference]: Start difference. First operand 921 states and 922 transitions. Second operand 228 states. [2018-04-13 05:28:23,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:28:23,103 INFO L93 Difference]: Finished difference Result 933 states and 934 transitions. [2018-04-13 05:28:23,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-04-13 05:28:23,103 INFO L78 Accepts]: Start accepts. Automaton has 228 states. Word has length 915 [2018-04-13 05:28:23,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:28:23,105 INFO L225 Difference]: With dead ends: 933 [2018-04-13 05:28:23,105 INFO L226 Difference]: Without dead ends: 933 [2018-04-13 05:28:23,105 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 803 SyntacticMatches, 1 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24973 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=19551, Invalid=32661, Unknown=0, NotChecked=0, Total=52212 [2018-04-13 05:28:23,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-04-13 05:28:23,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 929. [2018-04-13 05:28:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2018-04-13 05:28:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 930 transitions. [2018-04-13 05:28:23,109 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 930 transitions. Word has length 915 [2018-04-13 05:28:23,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:28:23,109 INFO L459 AbstractCegarLoop]: Abstraction has 929 states and 930 transitions. [2018-04-13 05:28:23,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 228 states. [2018-04-13 05:28:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 930 transitions. [2018-04-13 05:28:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2018-04-13 05:28:23,113 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:28:23,113 INFO L355 BasicCegarLoop]: trace histogram [113, 113, 112, 112, 112, 112, 112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:28:23,113 INFO L408 AbstractCegarLoop]: === Iteration 118 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:28:23,113 INFO L82 PathProgramCache]: Analyzing trace with hash 596496726, now seen corresponding path program 106 times [2018-04-13 05:28:23,113 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:28:23,113 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:28:23,114 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:28:23,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:28:23,114 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:28:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:28:23,268 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:28:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 50176 backedges. 0 proven. 25088 refuted. 0 times theorem prover too weak. 25088 trivial. 0 not checked. [2018-04-13 05:28:26,229 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:28:26,229 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:28:26,229 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:28:26,891 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:28:26,891 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:28:26,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:28:26,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:28:26,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:28:26,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:28:26,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:28:41,672 INFO L134 CoverageAnalysis]: Checked inductivity of 50176 backedges. 25088 proven. 25088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:28:41,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:28:41,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 230] total 345 [2018-04-13 05:28:41,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 345 states [2018-04-13 05:28:41,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 345 interpolants. [2018-04-13 05:28:41,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26450, Invalid=92230, Unknown=0, NotChecked=0, Total=118680 [2018-04-13 05:28:41,679 INFO L87 Difference]: Start difference. First operand 929 states and 930 transitions. Second operand 345 states. [2018-04-13 05:28:51,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:28:51,151 INFO L93 Difference]: Finished difference Result 941 states and 942 transitions. [2018-04-13 05:28:51,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-04-13 05:28:51,151 INFO L78 Accepts]: Start accepts. Automaton has 345 states. Word has length 923 [2018-04-13 05:28:51,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:28:51,152 INFO L225 Difference]: With dead ends: 941 [2018-04-13 05:28:51,152 INFO L226 Difference]: Without dead ends: 941 [2018-04-13 05:28:51,156 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1156 GetRequests, 696 SyntacticMatches, 1 SemanticMatches, 459 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90057 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=46240, Invalid=165820, Unknown=0, NotChecked=0, Total=212060 [2018-04-13 05:28:51,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2018-04-13 05:28:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 937. [2018-04-13 05:28:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2018-04-13 05:28:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 938 transitions. [2018-04-13 05:28:51,159 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 938 transitions. Word has length 923 [2018-04-13 05:28:51,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:28:51,159 INFO L459 AbstractCegarLoop]: Abstraction has 937 states and 938 transitions. [2018-04-13 05:28:51,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 345 states. [2018-04-13 05:28:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 938 transitions. [2018-04-13 05:28:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2018-04-13 05:28:51,163 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:28:51,163 INFO L355 BasicCegarLoop]: trace histogram [114, 114, 113, 113, 113, 113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:28:51,163 INFO L408 AbstractCegarLoop]: === Iteration 119 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:28:51,163 INFO L82 PathProgramCache]: Analyzing trace with hash 825836342, now seen corresponding path program 107 times [2018-04-13 05:28:51,163 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:28:51,163 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:28:51,164 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:28:51,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:28:51,164 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:28:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:28:51,320 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:28:54,395 INFO L134 CoverageAnalysis]: Checked inductivity of 51076 backedges. 0 proven. 25538 refuted. 0 times theorem prover too weak. 25538 trivial. 0 not checked. [2018-04-13 05:28:54,395 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:28:54,395 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:28:54,396 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:28:55,039 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 114 check-sat command(s) [2018-04-13 05:28:55,040 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:28:55,060 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:28:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 51076 backedges. 0 proven. 25538 refuted. 0 times theorem prover too weak. 25538 trivial. 0 not checked. [2018-04-13 05:28:55,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:28:55,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 116] total 119 [2018-04-13 05:28:55,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-04-13 05:28:55,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-04-13 05:28:55,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6790, Invalid=7252, Unknown=0, NotChecked=0, Total=14042 [2018-04-13 05:28:55,364 INFO L87 Difference]: Start difference. First operand 937 states and 938 transitions. Second operand 119 states. [2018-04-13 05:28:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:28:59,133 INFO L93 Difference]: Finished difference Result 949 states and 950 transitions. [2018-04-13 05:28:59,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-04-13 05:28:59,133 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 931 [2018-04-13 05:28:59,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:28:59,134 INFO L225 Difference]: With dead ends: 949 [2018-04-13 05:28:59,134 INFO L226 Difference]: Without dead ends: 949 [2018-04-13 05:28:59,136 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1276 GetRequests, 1045 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6890 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=20129, Invalid=33927, Unknown=0, NotChecked=0, Total=54056 [2018-04-13 05:28:59,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-04-13 05:28:59,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 945. [2018-04-13 05:28:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2018-04-13 05:28:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 946 transitions. [2018-04-13 05:28:59,140 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 946 transitions. Word has length 931 [2018-04-13 05:28:59,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:28:59,140 INFO L459 AbstractCegarLoop]: Abstraction has 945 states and 946 transitions. [2018-04-13 05:28:59,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-04-13 05:28:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 946 transitions. [2018-04-13 05:28:59,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2018-04-13 05:28:59,144 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:28:59,144 INFO L355 BasicCegarLoop]: trace histogram [115, 115, 114, 114, 114, 114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:28:59,144 INFO L408 AbstractCegarLoop]: === Iteration 120 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:28:59,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1072185834, now seen corresponding path program 108 times [2018-04-13 05:28:59,144 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:28:59,144 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:28:59,145 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:28:59,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:28:59,145 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:28:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:28:59,329 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:29:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 51984 backedges. 0 proven. 25992 refuted. 0 times theorem prover too weak. 25992 trivial. 0 not checked. [2018-04-13 05:29:02,756 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:29:02,756 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:29:02,756 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:29:03,125 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 115 check-sat command(s) [2018-04-13 05:29:03,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:29:03,288 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:29:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 51984 backedges. 0 proven. 25992 refuted. 0 times theorem prover too weak. 25992 trivial. 0 not checked. [2018-04-13 05:29:07,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:29:07,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 118] total 234 [2018-04-13 05:29:07,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 234 states [2018-04-13 05:29:07,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 234 interpolants. [2018-04-13 05:29:07,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20359, Invalid=34163, Unknown=0, NotChecked=0, Total=54522 [2018-04-13 05:29:07,019 INFO L87 Difference]: Start difference. First operand 945 states and 946 transitions. Second operand 234 states. [2018-04-13 05:29:11,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:29:11,129 INFO L93 Difference]: Finished difference Result 957 states and 958 transitions. [2018-04-13 05:29:11,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-04-13 05:29:11,154 INFO L78 Accepts]: Start accepts. Automaton has 234 states. Word has length 939 [2018-04-13 05:29:11,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:29:11,156 INFO L225 Difference]: With dead ends: 957 [2018-04-13 05:29:11,156 INFO L226 Difference]: Without dead ends: 957 [2018-04-13 05:29:11,157 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1058 GetRequests, 824 SyntacticMatches, 1 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26332 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=20592, Invalid=34398, Unknown=0, NotChecked=0, Total=54990 [2018-04-13 05:29:11,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2018-04-13 05:29:11,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 953. [2018-04-13 05:29:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2018-04-13 05:29:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 954 transitions. [2018-04-13 05:29:11,159 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 954 transitions. Word has length 939 [2018-04-13 05:29:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:29:11,160 INFO L459 AbstractCegarLoop]: Abstraction has 953 states and 954 transitions. [2018-04-13 05:29:11,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 234 states. [2018-04-13 05:29:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 954 transitions. [2018-04-13 05:29:11,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 948 [2018-04-13 05:29:11,163 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:29:11,164 INFO L355 BasicCegarLoop]: trace histogram [116, 116, 115, 115, 115, 115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:29:11,164 INFO L408 AbstractCegarLoop]: === Iteration 121 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:29:11,164 INFO L82 PathProgramCache]: Analyzing trace with hash 796115446, now seen corresponding path program 109 times [2018-04-13 05:29:11,164 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:29:11,164 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:29:11,164 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:29:11,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:29:11,164 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:29:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:29:11,331 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:29:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 52900 backedges. 0 proven. 26450 refuted. 0 times theorem prover too weak. 26450 trivial. 0 not checked. [2018-04-13 05:29:14,465 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:29:14,465 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:29:14,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:29:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:29:14,607 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:29:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 52900 backedges. 0 proven. 26450 refuted. 0 times theorem prover too weak. 26450 trivial. 0 not checked. [2018-04-13 05:29:18,382 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:29:18,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 119] total 236 [2018-04-13 05:29:18,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 236 states [2018-04-13 05:29:18,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 236 interpolants. [2018-04-13 05:29:18,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20710, Invalid=34750, Unknown=0, NotChecked=0, Total=55460 [2018-04-13 05:29:18,385 INFO L87 Difference]: Start difference. First operand 953 states and 954 transitions. Second operand 236 states. [2018-04-13 05:29:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:29:22,739 INFO L93 Difference]: Finished difference Result 965 states and 966 transitions. [2018-04-13 05:29:22,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-04-13 05:29:22,740 INFO L78 Accepts]: Start accepts. Automaton has 236 states. Word has length 947 [2018-04-13 05:29:22,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:29:22,741 INFO L225 Difference]: With dead ends: 965 [2018-04-13 05:29:22,741 INFO L226 Difference]: Without dead ends: 965 [2018-04-13 05:29:22,742 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1067 GetRequests, 831 SyntacticMatches, 1 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26793 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=20945, Invalid=34987, Unknown=0, NotChecked=0, Total=55932 [2018-04-13 05:29:22,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2018-04-13 05:29:22,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 961. [2018-04-13 05:29:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2018-04-13 05:29:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 962 transitions. [2018-04-13 05:29:22,745 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 962 transitions. Word has length 947 [2018-04-13 05:29:22,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:29:22,745 INFO L459 AbstractCegarLoop]: Abstraction has 961 states and 962 transitions. [2018-04-13 05:29:22,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 236 states. [2018-04-13 05:29:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 962 transitions. [2018-04-13 05:29:22,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2018-04-13 05:29:22,749 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:29:22,749 INFO L355 BasicCegarLoop]: trace histogram [117, 117, 116, 116, 116, 116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:29:22,749 INFO L408 AbstractCegarLoop]: === Iteration 122 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:29:22,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1314377430, now seen corresponding path program 110 times [2018-04-13 05:29:22,749 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:29:22,749 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:29:22,750 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:29:22,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:29:22,750 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:29:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:29:22,920 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:29:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 53824 backedges. 0 proven. 26912 refuted. 0 times theorem prover too weak. 26912 trivial. 0 not checked. [2018-04-13 05:29:26,165 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:29:26,165 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:29:26,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:29:26,453 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:29:26,453 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:29:26,483 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:29:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 53824 backedges. 0 proven. 26912 refuted. 0 times theorem prover too weak. 26912 trivial. 0 not checked. [2018-04-13 05:29:26,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:29:26,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 119] total 122 [2018-04-13 05:29:26,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-04-13 05:29:26,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-04-13 05:29:26,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7144, Invalid=7618, Unknown=0, NotChecked=0, Total=14762 [2018-04-13 05:29:26,767 INFO L87 Difference]: Start difference. First operand 961 states and 962 transitions. Second operand 122 states. [2018-04-13 05:29:30,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:29:30,728 INFO L93 Difference]: Finished difference Result 973 states and 974 transitions. [2018-04-13 05:29:30,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-04-13 05:29:30,729 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 955 [2018-04-13 05:29:30,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:29:30,730 INFO L225 Difference]: With dead ends: 973 [2018-04-13 05:29:30,730 INFO L226 Difference]: Without dead ends: 973 [2018-04-13 05:29:30,732 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1309 GetRequests, 1072 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7247 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=21185, Invalid=35697, Unknown=0, NotChecked=0, Total=56882 [2018-04-13 05:29:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2018-04-13 05:29:30,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 969. [2018-04-13 05:29:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2018-04-13 05:29:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 970 transitions. [2018-04-13 05:29:30,735 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 970 transitions. Word has length 955 [2018-04-13 05:29:30,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:29:30,735 INFO L459 AbstractCegarLoop]: Abstraction has 969 states and 970 transitions. [2018-04-13 05:29:30,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-04-13 05:29:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 970 transitions. [2018-04-13 05:29:30,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2018-04-13 05:29:30,739 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:29:30,739 INFO L355 BasicCegarLoop]: trace histogram [118, 118, 117, 117, 117, 117, 117, 117, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:29:30,740 INFO L408 AbstractCegarLoop]: === Iteration 123 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:29:30,740 INFO L82 PathProgramCache]: Analyzing trace with hash 2072929462, now seen corresponding path program 111 times [2018-04-13 05:29:30,740 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:29:30,740 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:29:30,740 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:29:30,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:29:30,740 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:29:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:29:30,954 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:29:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 54756 backedges. 0 proven. 27378 refuted. 0 times theorem prover too weak. 27378 trivial. 0 not checked. [2018-04-13 05:29:34,328 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:29:34,329 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:29:34,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:29:34,665 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 118 check-sat command(s) [2018-04-13 05:29:34,665 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:29:34,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:29:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 54756 backedges. 0 proven. 27378 refuted. 0 times theorem prover too weak. 27378 trivial. 0 not checked. [2018-04-13 05:29:35,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:29:35,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122, 120] total 123 [2018-04-13 05:29:35,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-04-13 05:29:35,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-04-13 05:29:35,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7264, Invalid=7742, Unknown=0, NotChecked=0, Total=15006 [2018-04-13 05:29:35,048 INFO L87 Difference]: Start difference. First operand 969 states and 970 transitions. Second operand 123 states. [2018-04-13 05:29:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:29:39,079 INFO L93 Difference]: Finished difference Result 981 states and 982 transitions. [2018-04-13 05:29:39,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-04-13 05:29:39,079 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 963 [2018-04-13 05:29:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:29:39,080 INFO L225 Difference]: With dead ends: 981 [2018-04-13 05:29:39,080 INFO L226 Difference]: Without dead ends: 981 [2018-04-13 05:29:39,081 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1320 GetRequests, 1081 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7368 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=21543, Invalid=36297, Unknown=0, NotChecked=0, Total=57840 [2018-04-13 05:29:39,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-04-13 05:29:39,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 977. [2018-04-13 05:29:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-04-13 05:29:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 978 transitions. [2018-04-13 05:29:39,084 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 978 transitions. Word has length 963 [2018-04-13 05:29:39,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:29:39,084 INFO L459 AbstractCegarLoop]: Abstraction has 977 states and 978 transitions. [2018-04-13 05:29:39,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-04-13 05:29:39,085 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 978 transitions. [2018-04-13 05:29:39,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 972 [2018-04-13 05:29:39,088 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:29:39,089 INFO L355 BasicCegarLoop]: trace histogram [119, 119, 118, 118, 118, 118, 118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:29:39,089 INFO L408 AbstractCegarLoop]: === Iteration 124 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:29:39,089 INFO L82 PathProgramCache]: Analyzing trace with hash -979237994, now seen corresponding path program 112 times [2018-04-13 05:29:39,089 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:29:39,089 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:29:39,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:29:39,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:29:39,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:29:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:29:39,273 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:29:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 55696 backedges. 0 proven. 27848 refuted. 0 times theorem prover too weak. 27848 trivial. 0 not checked. [2018-04-13 05:29:42,623 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:29:42,623 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:29:42,623 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:29:43,519 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:29:43,519 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:29:43,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:29:43,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:29:43,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:29:43,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:29:43,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:30:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 55696 backedges. 27848 proven. 27848 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:30:00,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:30:00,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 242] total 363 [2018-04-13 05:30:00,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 363 states [2018-04-13 05:30:00,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 363 interpolants. [2018-04-13 05:30:00,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29282, Invalid=102124, Unknown=0, NotChecked=0, Total=131406 [2018-04-13 05:30:00,935 INFO L87 Difference]: Start difference. First operand 977 states and 978 transitions. Second operand 363 states. [2018-04-13 05:30:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:30:11,978 INFO L93 Difference]: Finished difference Result 989 states and 990 transitions. [2018-04-13 05:30:11,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-04-13 05:30:11,978 INFO L78 Accepts]: Start accepts. Automaton has 363 states. Word has length 971 [2018-04-13 05:30:11,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:30:11,979 INFO L225 Difference]: With dead ends: 989 [2018-04-13 05:30:11,979 INFO L226 Difference]: Without dead ends: 989 [2018-04-13 05:30:11,983 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1216 GetRequests, 732 SyntacticMatches, 1 SemanticMatches, 483 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99837 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=51193, Invalid=183547, Unknown=0, NotChecked=0, Total=234740 [2018-04-13 05:30:11,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2018-04-13 05:30:11,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 985. [2018-04-13 05:30:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2018-04-13 05:30:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 986 transitions. [2018-04-13 05:30:11,987 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 986 transitions. Word has length 971 [2018-04-13 05:30:11,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:30:11,987 INFO L459 AbstractCegarLoop]: Abstraction has 985 states and 986 transitions. [2018-04-13 05:30:11,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 363 states. [2018-04-13 05:30:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 986 transitions. [2018-04-13 05:30:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 980 [2018-04-13 05:30:11,991 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:30:11,991 INFO L355 BasicCegarLoop]: trace histogram [120, 120, 119, 119, 119, 119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:30:11,991 INFO L408 AbstractCegarLoop]: === Iteration 125 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:30:11,991 INFO L82 PathProgramCache]: Analyzing trace with hash 182266742, now seen corresponding path program 113 times [2018-04-13 05:30:11,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:30:11,992 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:30:11,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:30:11,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:30:11,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:30:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:30:12,178 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:30:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 56644 backedges. 0 proven. 28322 refuted. 0 times theorem prover too weak. 28322 trivial. 0 not checked. [2018-04-13 05:30:15,530 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:30:15,530 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:30:15,530 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:30:16,306 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 120 check-sat command(s) [2018-04-13 05:30:16,306 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:30:16,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:30:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 56644 backedges. 0 proven. 28322 refuted. 0 times theorem prover too weak. 28322 trivial. 0 not checked. [2018-04-13 05:30:16,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:30:16,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124, 122] total 125 [2018-04-13 05:30:16,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-04-13 05:30:16,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-04-13 05:30:16,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7507, Invalid=7993, Unknown=0, NotChecked=0, Total=15500 [2018-04-13 05:30:16,618 INFO L87 Difference]: Start difference. First operand 985 states and 986 transitions. Second operand 125 states. [2018-04-13 05:30:20,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:30:20,711 INFO L93 Difference]: Finished difference Result 997 states and 998 transitions. [2018-04-13 05:30:20,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-04-13 05:30:20,711 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 979 [2018-04-13 05:30:20,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:30:20,712 INFO L225 Difference]: With dead ends: 997 [2018-04-13 05:30:20,712 INFO L226 Difference]: Without dead ends: 997 [2018-04-13 05:30:20,715 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1342 GetRequests, 1099 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7613 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=22268, Invalid=37512, Unknown=0, NotChecked=0, Total=59780 [2018-04-13 05:30:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-04-13 05:30:20,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 993. [2018-04-13 05:30:20,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2018-04-13 05:30:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 994 transitions. [2018-04-13 05:30:20,718 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 994 transitions. Word has length 979 [2018-04-13 05:30:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:30:20,718 INFO L459 AbstractCegarLoop]: Abstraction has 993 states and 994 transitions. [2018-04-13 05:30:20,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-04-13 05:30:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 994 transitions. [2018-04-13 05:30:20,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2018-04-13 05:30:20,722 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:30:20,723 INFO L355 BasicCegarLoop]: trace histogram [121, 121, 120, 120, 120, 120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:30:20,723 INFO L408 AbstractCegarLoop]: === Iteration 126 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:30:20,723 INFO L82 PathProgramCache]: Analyzing trace with hash 424303702, now seen corresponding path program 114 times [2018-04-13 05:30:20,723 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:30:20,723 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:30:20,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:30:20,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:30:20,724 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:30:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:30:20,953 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:30:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 57600 backedges. 0 proven. 28800 refuted. 0 times theorem prover too weak. 28800 trivial. 0 not checked. [2018-04-13 05:30:24,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:30:24,447 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:30:24,448 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:30:25,157 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 121 check-sat command(s) [2018-04-13 05:30:25,157 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:30:25,302 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:30:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 57600 backedges. 0 proven. 28800 refuted. 0 times theorem prover too weak. 28800 trivial. 0 not checked. [2018-04-13 05:30:25,635 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:30:25,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 123] total 126 [2018-04-13 05:30:25,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-04-13 05:30:25,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-04-13 05:30:25,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7630, Invalid=8120, Unknown=0, NotChecked=0, Total=15750 [2018-04-13 05:30:25,637 INFO L87 Difference]: Start difference. First operand 993 states and 994 transitions. Second operand 126 states. [2018-04-13 05:30:29,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:30:29,829 INFO L93 Difference]: Finished difference Result 1005 states and 1006 transitions. [2018-04-13 05:30:29,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-04-13 05:30:29,829 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 987 [2018-04-13 05:30:29,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:30:29,830 INFO L225 Difference]: With dead ends: 1005 [2018-04-13 05:30:29,830 INFO L226 Difference]: Without dead ends: 1005 [2018-04-13 05:30:29,832 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1353 GetRequests, 1108 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7737 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=22635, Invalid=38127, Unknown=0, NotChecked=0, Total=60762 [2018-04-13 05:30:29,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2018-04-13 05:30:29,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 1001. [2018-04-13 05:30:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-04-13 05:30:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1002 transitions. [2018-04-13 05:30:29,835 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1002 transitions. Word has length 987 [2018-04-13 05:30:29,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:30:29,835 INFO L459 AbstractCegarLoop]: Abstraction has 1001 states and 1002 transitions. [2018-04-13 05:30:29,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-04-13 05:30:29,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1002 transitions. [2018-04-13 05:30:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2018-04-13 05:30:29,839 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:30:29,839 INFO L355 BasicCegarLoop]: trace histogram [122, 122, 121, 121, 121, 121, 121, 121, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:30:29,839 INFO L408 AbstractCegarLoop]: === Iteration 127 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:30:29,840 INFO L82 PathProgramCache]: Analyzing trace with hash -827058634, now seen corresponding path program 115 times [2018-04-13 05:30:29,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:30:29,840 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:30:29,840 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:30:29,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:30:29,840 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:30:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:30:30,067 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:30:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 58564 backedges. 0 proven. 29282 refuted. 0 times theorem prover too weak. 29282 trivial. 0 not checked. [2018-04-13 05:30:33,556 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:30:33,557 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:30:33,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:30:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:30:33,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:30:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 58564 backedges. 0 proven. 29282 refuted. 0 times theorem prover too weak. 29282 trivial. 0 not checked. [2018-04-13 05:30:37,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:30:37,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126, 125] total 248 [2018-04-13 05:30:37,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 248 states [2018-04-13 05:30:37,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 248 interpolants. [2018-04-13 05:30:37,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22879, Invalid=38377, Unknown=0, NotChecked=0, Total=61256 [2018-04-13 05:30:37,862 INFO L87 Difference]: Start difference. First operand 1001 states and 1002 transitions. Second operand 248 states. [2018-04-13 05:30:42,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:30:42,873 INFO L93 Difference]: Finished difference Result 1013 states and 1014 transitions. [2018-04-13 05:30:42,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-04-13 05:30:42,890 INFO L78 Accepts]: Start accepts. Automaton has 248 states. Word has length 995 [2018-04-13 05:30:42,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:30:42,891 INFO L225 Difference]: With dead ends: 1013 [2018-04-13 05:30:42,892 INFO L226 Difference]: Without dead ends: 1013 [2018-04-13 05:30:42,893 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1121 GetRequests, 873 SyntacticMatches, 1 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29643 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=23126, Invalid=38626, Unknown=0, NotChecked=0, Total=61752 [2018-04-13 05:30:42,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2018-04-13 05:30:42,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1009. [2018-04-13 05:30:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2018-04-13 05:30:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1010 transitions. [2018-04-13 05:30:42,897 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1010 transitions. Word has length 995 [2018-04-13 05:30:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:30:42,897 INFO L459 AbstractCegarLoop]: Abstraction has 1009 states and 1010 transitions. [2018-04-13 05:30:42,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 248 states. [2018-04-13 05:30:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1010 transitions. [2018-04-13 05:30:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1004 [2018-04-13 05:30:42,901 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:30:42,901 INFO L355 BasicCegarLoop]: trace histogram [123, 123, 122, 122, 122, 122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:30:42,902 INFO L408 AbstractCegarLoop]: === Iteration 128 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:30:42,902 INFO L82 PathProgramCache]: Analyzing trace with hash 950327574, now seen corresponding path program 116 times [2018-04-13 05:30:42,902 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:30:42,902 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:30:42,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:30:42,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:30:42,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:30:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:30:43,103 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:30:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 59536 backedges. 0 proven. 29768 refuted. 0 times theorem prover too weak. 29768 trivial. 0 not checked. [2018-04-13 05:30:46,667 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:30:46,667 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:30:46,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:30:46,917 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:30:46,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:30:46,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:30:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 59536 backedges. 0 proven. 29768 refuted. 0 times theorem prover too weak. 29768 trivial. 0 not checked. [2018-04-13 05:30:47,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:30:47,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 125] total 128 [2018-04-13 05:30:47,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-04-13 05:30:47,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-04-13 05:30:47,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7879, Invalid=8377, Unknown=0, NotChecked=0, Total=16256 [2018-04-13 05:30:47,254 INFO L87 Difference]: Start difference. First operand 1009 states and 1010 transitions. Second operand 128 states. [2018-04-13 05:30:51,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:30:51,584 INFO L93 Difference]: Finished difference Result 1021 states and 1022 transitions. [2018-04-13 05:30:51,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-04-13 05:30:51,584 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 1003 [2018-04-13 05:30:51,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:30:51,585 INFO L225 Difference]: With dead ends: 1021 [2018-04-13 05:30:51,586 INFO L226 Difference]: Without dead ends: 1021 [2018-04-13 05:30:51,588 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1375 GetRequests, 1126 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7988 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=23378, Invalid=39372, Unknown=0, NotChecked=0, Total=62750 [2018-04-13 05:30:51,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2018-04-13 05:30:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1017. [2018-04-13 05:30:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1017 states. [2018-04-13 05:30:51,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1018 transitions. [2018-04-13 05:30:51,594 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1018 transitions. Word has length 1003 [2018-04-13 05:30:51,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:30:51,594 INFO L459 AbstractCegarLoop]: Abstraction has 1017 states and 1018 transitions. [2018-04-13 05:30:51,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-04-13 05:30:51,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1018 transitions. [2018-04-13 05:30:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1012 [2018-04-13 05:30:51,599 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:30:51,599 INFO L355 BasicCegarLoop]: trace histogram [124, 124, 123, 123, 123, 123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:30:51,599 INFO L408 AbstractCegarLoop]: === Iteration 129 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:30:51,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1268308746, now seen corresponding path program 117 times [2018-04-13 05:30:51,599 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:30:51,599 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:30:51,600 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:30:51,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:30:51,600 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:30:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:30:51,872 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:30:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 60516 backedges. 0 proven. 30258 refuted. 0 times theorem prover too weak. 30258 trivial. 0 not checked. [2018-04-13 05:30:55,495 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:30:55,495 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:30:55,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:30:55,889 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 124 check-sat command(s) [2018-04-13 05:30:55,890 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:30:55,988 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:31:00,265 INFO L134 CoverageAnalysis]: Checked inductivity of 60516 backedges. 0 proven. 30258 refuted. 0 times theorem prover too weak. 30258 trivial. 0 not checked. [2018-04-13 05:31:00,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:31:00,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 127] total 252 [2018-04-13 05:31:00,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 252 states [2018-04-13 05:31:00,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 252 interpolants. [2018-04-13 05:31:00,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23626, Invalid=39626, Unknown=0, NotChecked=0, Total=63252 [2018-04-13 05:31:00,268 INFO L87 Difference]: Start difference. First operand 1017 states and 1018 transitions. Second operand 252 states. [2018-04-13 05:31:05,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:31:05,766 INFO L93 Difference]: Finished difference Result 1029 states and 1030 transitions. [2018-04-13 05:31:05,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-04-13 05:31:05,767 INFO L78 Accepts]: Start accepts. Automaton has 252 states. Word has length 1011 [2018-04-13 05:31:05,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:31:05,768 INFO L225 Difference]: With dead ends: 1029 [2018-04-13 05:31:05,768 INFO L226 Difference]: Without dead ends: 1029 [2018-04-13 05:31:05,769 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1139 GetRequests, 887 SyntacticMatches, 1 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30625 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=23877, Invalid=39879, Unknown=0, NotChecked=0, Total=63756 [2018-04-13 05:31:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2018-04-13 05:31:05,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1025. [2018-04-13 05:31:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2018-04-13 05:31:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1026 transitions. [2018-04-13 05:31:05,772 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1026 transitions. Word has length 1011 [2018-04-13 05:31:05,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:31:05,773 INFO L459 AbstractCegarLoop]: Abstraction has 1025 states and 1026 transitions. [2018-04-13 05:31:05,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 252 states. [2018-04-13 05:31:05,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1026 transitions. [2018-04-13 05:31:05,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1020 [2018-04-13 05:31:05,777 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:31:05,777 INFO L355 BasicCegarLoop]: trace histogram [125, 125, 124, 124, 124, 124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:31:05,777 INFO L408 AbstractCegarLoop]: === Iteration 130 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:31:05,777 INFO L82 PathProgramCache]: Analyzing trace with hash 252017110, now seen corresponding path program 118 times [2018-04-13 05:31:05,777 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:31:05,777 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:31:05,778 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:31:05,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:31:05,778 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:31:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:31:06,034 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:31:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 61504 backedges. 0 proven. 30752 refuted. 0 times theorem prover too weak. 30752 trivial. 0 not checked. [2018-04-13 05:31:09,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:31:09,710 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:31:09,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:31:10,725 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:31:10,726 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:31:10,803 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:31:10,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:31:10,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:31:10,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:31:10,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:31:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 61504 backedges. 30752 proven. 30752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:31:28,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:31:28,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 254] total 381 [2018-04-13 05:31:28,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 381 states [2018-04-13 05:31:28,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 381 interpolants. [2018-04-13 05:31:28,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32258, Invalid=112522, Unknown=0, NotChecked=0, Total=144780 [2018-04-13 05:31:28,586 INFO L87 Difference]: Start difference. First operand 1025 states and 1026 transitions. Second operand 381 states. [2018-04-13 05:31:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:31:40,873 INFO L93 Difference]: Finished difference Result 1037 states and 1038 transitions. [2018-04-13 05:31:40,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-04-13 05:31:40,874 INFO L78 Accepts]: Start accepts. Automaton has 381 states. Word has length 1019 [2018-04-13 05:31:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:31:40,875 INFO L225 Difference]: With dead ends: 1037 [2018-04-13 05:31:40,875 INFO L226 Difference]: Without dead ends: 1037 [2018-04-13 05:31:40,880 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1276 GetRequests, 768 SyntacticMatches, 1 SemanticMatches, 507 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110121 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=56398, Invalid=202174, Unknown=0, NotChecked=0, Total=258572 [2018-04-13 05:31:40,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2018-04-13 05:31:40,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1033. [2018-04-13 05:31:40,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2018-04-13 05:31:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1034 transitions. [2018-04-13 05:31:40,884 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1034 transitions. Word has length 1019 [2018-04-13 05:31:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:31:40,885 INFO L459 AbstractCegarLoop]: Abstraction has 1033 states and 1034 transitions. [2018-04-13 05:31:40,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 381 states. [2018-04-13 05:31:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1034 transitions. [2018-04-13 05:31:40,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1028 [2018-04-13 05:31:40,889 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:31:40,889 INFO L355 BasicCegarLoop]: trace histogram [126, 126, 125, 125, 125, 125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:31:40,889 INFO L408 AbstractCegarLoop]: === Iteration 131 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:31:40,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1521854538, now seen corresponding path program 119 times [2018-04-13 05:31:40,890 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:31:40,890 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:31:40,890 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:31:40,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:31:40,890 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:31:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:31:41,158 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:31:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 62500 backedges. 0 proven. 31250 refuted. 0 times theorem prover too weak. 31250 trivial. 0 not checked. [2018-04-13 05:31:44,928 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:31:44,928 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:31:44,928 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:31:45,803 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 126 check-sat command(s) [2018-04-13 05:31:45,803 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:31:45,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:31:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 62500 backedges. 0 proven. 31250 refuted. 0 times theorem prover too weak. 31250 trivial. 0 not checked. [2018-04-13 05:31:46,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:31:46,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130, 128] total 131 [2018-04-13 05:31:46,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-04-13 05:31:46,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-04-13 05:31:46,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8260, Invalid=8770, Unknown=0, NotChecked=0, Total=17030 [2018-04-13 05:31:46,188 INFO L87 Difference]: Start difference. First operand 1033 states and 1034 transitions. Second operand 131 states. [2018-04-13 05:31:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:31:50,639 INFO L93 Difference]: Finished difference Result 1045 states and 1046 transitions. [2018-04-13 05:31:50,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-04-13 05:31:50,639 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 1027 [2018-04-13 05:31:50,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:31:50,640 INFO L225 Difference]: With dead ends: 1045 [2018-04-13 05:31:50,640 INFO L226 Difference]: Without dead ends: 1045 [2018-04-13 05:31:50,642 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1408 GetRequests, 1153 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=24515, Invalid=41277, Unknown=0, NotChecked=0, Total=65792 [2018-04-13 05:31:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2018-04-13 05:31:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1041. [2018-04-13 05:31:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2018-04-13 05:31:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1042 transitions. [2018-04-13 05:31:50,646 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1042 transitions. Word has length 1027 [2018-04-13 05:31:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:31:50,646 INFO L459 AbstractCegarLoop]: Abstraction has 1041 states and 1042 transitions. [2018-04-13 05:31:50,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-04-13 05:31:50,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1042 transitions. [2018-04-13 05:31:50,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2018-04-13 05:31:50,651 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:31:50,651 INFO L355 BasicCegarLoop]: trace histogram [127, 127, 126, 126, 126, 126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:31:50,651 INFO L408 AbstractCegarLoop]: === Iteration 132 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:31:50,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2084553066, now seen corresponding path program 120 times [2018-04-13 05:31:50,651 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:31:50,651 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:31:50,652 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:31:50,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:31:50,652 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:31:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:31:50,895 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:31:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 63504 backedges. 0 proven. 31752 refuted. 0 times theorem prover too weak. 31752 trivial. 0 not checked. [2018-04-13 05:31:54,728 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:31:54,728 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:31:54,728 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:31:55,135 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 127 check-sat command(s) [2018-04-13 05:31:55,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:31:55,438 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:31:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 63504 backedges. 0 proven. 31752 refuted. 0 times theorem prover too weak. 31752 trivial. 0 not checked. [2018-04-13 05:31:59,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:31:59,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 130] total 258 [2018-04-13 05:31:59,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 258 states [2018-04-13 05:31:59,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 258 interpolants. [2018-04-13 05:31:59,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24769, Invalid=41537, Unknown=0, NotChecked=0, Total=66306 [2018-04-13 05:31:59,916 INFO L87 Difference]: Start difference. First operand 1041 states and 1042 transitions. Second operand 258 states. [2018-04-13 05:32:06,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:06,158 INFO L93 Difference]: Finished difference Result 1051 states and 1052 transitions. [2018-04-13 05:32:06,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-04-13 05:32:06,158 INFO L78 Accepts]: Start accepts. Automaton has 258 states. Word has length 1035 [2018-04-13 05:32:06,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:06,159 INFO L225 Difference]: With dead ends: 1051 [2018-04-13 05:32:06,159 INFO L226 Difference]: Without dead ends: 1051 [2018-04-13 05:32:06,160 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1166 GetRequests, 908 SyntacticMatches, 1 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32128 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=25026, Invalid=41796, Unknown=0, NotChecked=0, Total=66822 [2018-04-13 05:32:06,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2018-04-13 05:32:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1049. [2018-04-13 05:32:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2018-04-13 05:32:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1050 transitions. [2018-04-13 05:32:06,163 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1050 transitions. Word has length 1035 [2018-04-13 05:32:06,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:06,163 INFO L459 AbstractCegarLoop]: Abstraction has 1049 states and 1050 transitions. [2018-04-13 05:32:06,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 258 states. [2018-04-13 05:32:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1050 transitions. [2018-04-13 05:32:06,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2018-04-13 05:32:06,168 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:06,168 INFO L355 BasicCegarLoop]: trace histogram [128, 128, 127, 127, 127, 127, 127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:06,168 INFO L408 AbstractCegarLoop]: === Iteration 133 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:32:06,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2035175818, now seen corresponding path program 121 times [2018-04-13 05:32:06,168 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:06,168 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:06,168 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:06,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:32:06,169 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:06,405 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 64516 backedges. 0 proven. 32258 refuted. 0 times theorem prover too weak. 32258 trivial. 0 not checked. [2018-04-13 05:32:10,216 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:10,216 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:10,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:10,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:14,990 INFO L134 CoverageAnalysis]: Checked inductivity of 64516 backedges. 0 proven. 32258 refuted. 0 times theorem prover too weak. 32258 trivial. 0 not checked. [2018-04-13 05:32:14,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:14,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132, 131] total 260 [2018-04-13 05:32:14,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 260 states [2018-04-13 05:32:14,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 260 interpolants. [2018-04-13 05:32:14,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25156, Invalid=42184, Unknown=0, NotChecked=0, Total=67340 [2018-04-13 05:32:14,994 INFO L87 Difference]: Start difference. First operand 1049 states and 1050 transitions. Second operand 260 states. [2018-04-13 05:32:20,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:20,700 INFO L93 Difference]: Finished difference Result 1055 states and 1056 transitions. [2018-04-13 05:32:20,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-04-13 05:32:20,700 INFO L78 Accepts]: Start accepts. Automaton has 260 states. Word has length 1043 [2018-04-13 05:32:20,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:20,701 INFO L225 Difference]: With dead ends: 1055 [2018-04-13 05:32:20,701 INFO L226 Difference]: Without dead ends: 1055 [2018-04-13 05:32:20,703 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1175 GetRequests, 915 SyntacticMatches, 1 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32637 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=25415, Invalid=42445, Unknown=0, NotChecked=0, Total=67860 [2018-04-13 05:32:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2018-04-13 05:32:20,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1053. [2018-04-13 05:32:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-04-13 05:32:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1054 transitions. [2018-04-13 05:32:20,706 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1054 transitions. Word has length 1043 [2018-04-13 05:32:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:20,707 INFO L459 AbstractCegarLoop]: Abstraction has 1053 states and 1054 transitions. [2018-04-13 05:32:20,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 260 states. [2018-04-13 05:32:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1054 transitions. [2018-04-13 05:32:20,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2018-04-13 05:32:20,711 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:20,711 INFO L355 BasicCegarLoop]: trace histogram [129, 128, 128, 128, 128, 127, 127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:20,711 INFO L408 AbstractCegarLoop]: === Iteration 134 === [__U_MULTI_f_________false_valid_free_i__fooErr1RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr3RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr2RequiresViolation, __U_MULTI_f_________false_valid_free_i__fooErr0RequiresViolation, mainErr1RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr4AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr12EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr9AssertViolationMEMORY_FREE, mainErr2RequiresViolation, mainErr8AssertViolationMEMORY_FREE, mainErr5AssertViolationMEMORY_FREE]=== [2018-04-13 05:32:20,711 INFO L82 PathProgramCache]: Analyzing trace with hash -461496307, now seen corresponding path program 122 times [2018-04-13 05:32:20,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:20,711 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:20,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:20,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:20,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-13 05:32:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-13 05:32:21,708 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-13 05:32:21,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:32:21 BoogieIcfgContainer [2018-04-13 05:32:21,896 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 05:32:21,896 INFO L168 Benchmark]: Toolchain (without parser) took 703896.07 ms. Allocated memory was 395.3 MB in the beginning and 2.8 GB in the end (delta: 2.4 GB). Free memory was 330.3 MB in the beginning and 1.1 GB in the end (delta: -763.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-04-13 05:32:21,897 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 395.3 MB. Free memory is still 357.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 05:32:21,897 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.36 ms. Allocated memory is still 395.3 MB. Free memory was 330.3 MB in the beginning and 306.3 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-13 05:32:21,898 INFO L168 Benchmark]: Boogie Preprocessor took 34.78 ms. Allocated memory is still 395.3 MB. Free memory was 306.3 MB in the beginning and 303.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-13 05:32:21,898 INFO L168 Benchmark]: RCFGBuilder took 376.38 ms. Allocated memory was 395.3 MB in the beginning and 598.2 MB in the end (delta: 202.9 MB). Free memory was 303.7 MB in the beginning and 534.3 MB in the end (delta: -230.6 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-13 05:32:21,898 INFO L168 Benchmark]: TraceAbstraction took 703256.00 ms. Allocated memory was 598.2 MB in the beginning and 2.8 GB in the end (delta: 2.2 GB). Free memory was 534.3 MB in the beginning and 1.1 GB in the end (delta: -559.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-04-13 05:32:21,899 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 395.3 MB. Free memory is still 357.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 226.36 ms. Allocated memory is still 395.3 MB. Free memory was 330.3 MB in the beginning and 306.3 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.78 ms. Allocated memory is still 395.3 MB. Free memory was 306.3 MB in the beginning and 303.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 376.38 ms. Allocated memory was 395.3 MB in the beginning and 598.2 MB in the end (delta: 202.9 MB). Free memory was 303.7 MB in the beginning and 534.3 MB in the end (delta: -230.6 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 703256.00 ms. Allocated memory was 598.2 MB in the beginning and 2.8 GB in the end (delta: 2.2 GB). Free memory was 534.3 MB in the beginning and 1.1 GB in the end (delta: -559.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 639]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L619] int *a, *b; [L619] int *a, *b; [L620] int n; VAL [\old(a)=520, \old(a)=514, \old(a)=516, \old(a)=519, \old(n)=517, a={0:0}, a={0:0}, n=0] [L631] n = 128 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={0:0}, a={0:0}, n=128] [L632] EXPR, FCALL malloc (n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={0:0}, a={0:0}, malloc (n * sizeof(*a))={513:0}, n=128] [L632] a = malloc (n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={0:0}, malloc (n * sizeof(*a))={513:0}, n=128] [L633] EXPR, FCALL malloc (n * sizeof(*b)) VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={0:0}, malloc (n * sizeof(*a))={513:0}, malloc (n * sizeof(*b))={518:0}, n=128] [L633] b = malloc (n * sizeof(*b)) [L634] EXPR b++ [L634] EXPR b++ VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, b++={518:0}, malloc (n * sizeof(*a))={513:0}, malloc (n * sizeof(*b))={518:0}, n=128] [L634] FCALL *b++ = 0 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, b++={518:0}, malloc (n * sizeof(*a))={513:0}, malloc (n * sizeof(*b))={518:0}, n=128] [L635] CALL foo () VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, n=128] [L623] int i; [L624] i = 0 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=0, n=128] [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=0, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=0, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=1, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=1, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=2, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=2, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=3, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=3, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=4, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=4, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=5, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=5, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=6, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=6, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=7, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=7, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=8, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=8, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=9, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=9, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=10, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=10, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=11, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=11, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=12, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=12, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=13, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=13, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=14, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=14, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=15, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=15, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=16, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=16, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=17, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=17, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=18, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=18, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=19, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=19, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=20, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=20, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=21, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=21, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=22, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=22, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=23, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=23, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=24, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=24, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=25, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=25, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=26, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=26, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=27, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=27, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=28, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=28, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=29, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=29, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=30, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=30, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=31, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=31, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=32, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=32, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=33, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=33, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=34, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=34, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=35, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=35, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=36, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=36, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=37, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=37, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=38, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=38, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=39, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=39, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=40, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=40, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=41, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=41, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=42, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=42, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=43, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=43, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=44, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=44, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=45, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=45, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=46, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=46, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=47, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=47, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=48, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=48, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=49, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=49, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=50, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=50, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=51, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=51, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=52, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=52, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=53, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=53, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=54, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=54, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=55, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=55, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=56, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=56, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=57, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=57, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=58, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=58, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=59, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=59, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=60, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=60, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=61, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=61, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=62, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=62, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=63, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=63, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=64, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=64, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=65, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=65, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=66, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=66, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=67, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=67, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=68, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=68, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=69, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=69, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=70, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=70, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=71, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=71, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=72, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=72, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=73, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=73, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=74, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=74, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=75, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=75, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=76, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=76, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=77, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=77, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=78, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=78, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=79, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=79, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=80, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=80, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=81, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=81, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=82, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=82, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=83, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=83, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=84, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=84, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=85, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=85, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=86, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=86, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=87, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=87, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=88, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=88, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=89, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=89, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=90, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=90, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=91, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=91, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=92, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=92, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=93, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=93, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=94, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=94, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=95, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=95, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=96, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=96, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=97, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=97, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=98, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=98, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=99, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=99, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=100, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=100, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=101, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=101, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=102, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=102, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=103, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=103, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=104, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=104, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=105, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=105, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=106, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=106, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=107, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=107, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=108, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=108, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=109, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=109, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=110, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=110, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=111, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=111, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=112, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=112, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=113, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=113, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=114, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=114, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=115, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=115, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=116, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=116, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=117, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=117, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=118, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=118, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=119, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=119, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=120, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=120, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=121, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=121, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=122, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=122, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=123, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=123, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=124, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=124, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=125, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=125, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=126, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=126, n=128] [L624] i++ [L624] i++ [L624] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=127, n=128] [L625] FCALL a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=127, n=128] [L624] i++ [L624] i++ [L624] COND FALSE !(i < n) VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=128, n=128] [L626] i = 0 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=0, n=128] [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=0, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=0, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=1, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=1, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=2, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=2, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=3, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=3, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=4, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=4, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=5, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=5, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=6, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=6, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=7, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=7, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=8, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=8, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=9, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=9, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=10, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=10, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=11, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=11, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=12, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=12, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=13, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=13, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=14, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=14, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=15, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=15, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=16, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=16, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=17, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=17, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=18, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=18, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=19, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=19, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=20, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=20, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=21, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=21, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=22, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=22, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=23, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=23, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=24, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=24, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=25, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=25, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=26, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=26, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=27, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=27, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=28, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=28, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=29, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=29, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=30, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=30, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=31, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=31, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=32, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=32, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=33, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=33, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=34, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=34, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=35, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=35, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=36, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=36, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=37, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=37, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=38, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=38, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=39, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=39, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=40, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=40, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=41, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=41, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=42, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=42, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=43, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=43, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=44, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=44, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=45, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=45, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=46, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=46, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=47, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=47, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=48, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=48, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=49, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=49, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=50, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=50, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=51, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=51, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=52, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=52, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=53, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=53, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=54, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=54, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=55, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=55, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=56, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=56, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=57, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=57, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=58, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=58, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=59, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=59, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=60, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=60, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=61, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=61, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=62, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=62, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=63, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=63, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=64, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=64, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=65, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=65, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=66, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=66, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=67, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=67, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=68, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=68, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=69, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=69, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=70, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=70, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=71, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=71, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=72, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=72, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=73, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=73, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=74, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=74, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=75, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=75, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=76, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=76, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=77, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=77, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=78, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=78, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=79, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=79, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=80, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=80, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=81, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=81, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=82, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=82, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=83, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=83, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=84, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=84, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=85, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=85, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=86, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=86, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=87, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=87, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=88, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=88, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=89, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=89, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=90, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=90, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=91, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=91, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=92, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=92, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=93, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=93, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=94, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=94, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=95, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=95, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=96, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=96, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=97, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=97, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=98, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=98, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=99, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=99, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=100, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=100, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=101, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=101, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=102, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=102, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=103, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=103, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=104, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=104, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=105, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=105, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=106, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=106, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=107, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=107, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=108, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=108, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=109, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=109, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=110, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=110, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=111, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=111, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=112, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=112, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=113, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=113, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=114, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=114, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=115, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=115, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=116, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=116, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=117, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=117, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=118, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=118, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=119, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=119, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=120, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=120, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=121, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=121, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=122, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=122, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=123, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=123, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=124, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=124, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=125, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=125, n=128] [L626] i++ [L626] i++ [L626] COND TRUE i < 128 - 1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=126, n=128] [L627] FCALL b[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, i=126, n=128] [L626] i++ [L626] i++ [L626] COND FALSE, RET !(i < 128 - 1) VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, i=127, n=128] [L635] foo () VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, malloc (n * sizeof(*a))={513:0}, malloc (n * sizeof(*b))={518:0}, n=128] [L636] FCALL b[-1] VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, b[-1]=0, malloc (n * sizeof(*a))={513:0}, malloc (n * sizeof(*b))={518:0}, n=128] [L636] COND FALSE !(b[-1]) [L639] free(a) VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, malloc (n * sizeof(*a))={513:0}, malloc (n * sizeof(*b))={518:0}, n=128] [L639] free(a) VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={513:0}, a={518:4}, malloc (n * sizeof(*a))={513:0}, malloc (n * sizeof(*b))={518:0}, n=128] [L639] FCALL free(a) VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, malloc (n * sizeof(*a))={513:0}, malloc (n * sizeof(*b))={518:0}, n=128] [L639] free(b) VAL [\old(a)=0, \old(a)=0, \old(a)=0, \old(a)=0, \old(n)=0, a={518:4}, a={513:0}, malloc (n * sizeof(*a))={513:0}, malloc (n * sizeof(*b))={518:0}, n=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 17 error locations. UNSAFE Result, 703.2s OverallTime, 134 OverallIterations, 129 TraceHistogramMax, 263.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3806 SDtfs, 111774 SDslu, 122626 SDs, 0 SdLazy, 95484 SolverSat, 28874 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86408 GetRequests, 66586 SyntacticMatches, 64 SemanticMatches, 19758 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510689 ImplicationChecksByTransitivity, 466.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1053occurred in iteration=133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 133 MinimizatonAttempts, 543 StatesRemovedByMinimization, 129 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 29.9s SatisfiabilityAnalysisTime, 387.2s InterpolantComputationTime, 137877 NumberOfCodeBlocks, 136473 NumberOfCodeBlocksAsserted, 4347 NumberOfCheckSat, 136463 ConstructedInterpolants, 130 QuantifiedInterpolants, 371727904 SizeOfPredicates, 253 NumberOfNonLiveVariables, 162361 ConjunctsInSsa, 10031 ConjunctsInUnsatCore, 258 InterpolantComputations, 7 PerfectInterpolantSequences, 2763256/5526668 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_05-32-21-909.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_05-32-21-909.csv Received shutdown request...