java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 13:12:14,985 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 13:12:14,986 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 13:12:14,999 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 13:12:15,000 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 13:12:15,000 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 13:12:15,001 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 13:12:15,003 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 13:12:15,004 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 13:12:15,005 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 13:12:15,006 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 13:12:15,006 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 13:12:15,007 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 13:12:15,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 13:12:15,008 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 13:12:15,010 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 13:12:15,011 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 13:12:15,013 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 13:12:15,013 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 13:12:15,014 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 13:12:15,016 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 13:12:15,016 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 13:12:15,016 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 13:12:15,017 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 13:12:15,018 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 13:12:15,019 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 13:12:15,019 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 13:12:15,019 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 13:12:15,020 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 13:12:15,020 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 13:12:15,020 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 13:12:15,021 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-04-11 13:12:15,040 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 13:12:15,040 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 13:12:15,041 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 13:12:15,041 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 13:12:15,042 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 13:12:15,042 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 13:12:15,042 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 13:12:15,042 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 13:12:15,042 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 13:12:15,042 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 13:12:15,042 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 13:12:15,043 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 13:12:15,043 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 13:12:15,043 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 13:12:15,043 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 13:12:15,043 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 13:12:15,043 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 13:12:15,043 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 13:12:15,044 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 13:12:15,044 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 13:12:15,044 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 13:12:15,044 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 13:12:15,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 13:12:15,083 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 13:12:15,086 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 13:12:15,088 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 13:12:15,088 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 13:12:15,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,427 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG4f1e4cd4c [2018-04-11 13:12:15,554 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 13:12:15,555 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 13:12:15,555 INFO L168 CDTParser]: Scanning lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,564 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 13:12:15,564 INFO L215 ultiparseSymbolTable]: [2018-04-11 13:12:15,564 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 13:12:15,564 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,564 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flockfree_____false_valid_memtrack_i__push ('push') in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,565 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flockfree_____false_valid_memtrack_i__pop ('pop') in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,565 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 13:12:15,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____clockid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____daddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__clockid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____clock_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__quad_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_int in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint8_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____key_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blkcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int8_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int16_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_cond_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____loff_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__suseconds_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____useconds_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fd_mask in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__wchar_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____off_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ino64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_long in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__nlink_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__uint in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ssize_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____sigset_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_once_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__dev_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ino_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_spinlock_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__id_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int8_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_short in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ulong in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__gid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__S in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsfilcnt64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ldiv_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ino_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____swblk_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_barrierattr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__register_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__clock_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int8_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____dev_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____time_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__daddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_quad_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ushort in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__loff_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__t4 in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsfilcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__t1 in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_condattr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint16_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____WAIT_STATUS in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____rlim64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blksize_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____qaddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int32_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__div_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__garbage in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__time_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____suseconds_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__key_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_mutex_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__uid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fd_set in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__lldiv_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____rlim_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int16_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__mode_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pc1 in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_short in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pc4 in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____intptr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_key_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsblkcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____caddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__size_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_rwlock_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint32_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__caddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__blksize_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____mode_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__sigset_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_char in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__timer_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_long in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int16_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__off_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__blkcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blkcnt64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int32_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_rwlockattr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsfilcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ssize_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____pthread_list_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____socklen_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____nlink_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_attr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int32_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_char in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____gid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_quad_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____sig_atomic_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_barrier_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____id_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__x1 in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____quad_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fd_mask in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____off64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsblkcnt64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__x4 in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____pid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsblkcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____timer_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_mutexattr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int in lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:15,589 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG4f1e4cd4c [2018-04-11 13:12:15,592 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 13:12:15,593 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 13:12:15,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 13:12:15,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 13:12:15,597 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 13:12:15,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 01:12:15" (1/1) ... [2018-04-11 13:12:15,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c38fc40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:12:15, skipping insertion in model container [2018-04-11 13:12:15,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 01:12:15" (1/1) ... [2018-04-11 13:12:15,615 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 13:12:15,641 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 13:12:15,786 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 13:12:15,828 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 13:12:15,834 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-11 13:12:15,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:12:15 WrapperNode [2018-04-11 13:12:15,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 13:12:15,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 13:12:15,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 13:12:15,879 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 13:12:15,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:12:15" (1/1) ... [2018-04-11 13:12:15,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:12:15" (1/1) ... [2018-04-11 13:12:15,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:12:15" (1/1) ... [2018-04-11 13:12:15,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:12:15" (1/1) ... [2018-04-11 13:12:15,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:12:15" (1/1) ... [2018-04-11 13:12:15,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:12:15" (1/1) ... [2018-04-11 13:12:15,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:12:15" (1/1) ... [2018-04-11 13:12:15,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 13:12:15,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 13:12:15,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 13:12:15,919 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 13:12:15,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:12:15" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 13:12:16,003 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 13:12:16,003 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 13:12:16,004 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-11 13:12:16,004 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-11 13:12:16,004 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 13:12:16,004 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 13:12:16,004 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 13:12:16,004 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 13:12:16,004 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 13:12:16,004 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 13:12:16,004 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 13:12:16,004 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 13:12:16,004 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 13:12:16,004 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 13:12:16,004 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 13:12:16,005 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 13:12:16,005 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 13:12:16,005 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 13:12:16,005 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 13:12:16,005 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 13:12:16,005 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 13:12:16,005 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 13:12:16,005 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 13:12:16,005 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 13:12:16,006 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 13:12:16,006 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 13:12:16,006 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 13:12:16,006 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 13:12:16,006 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 13:12:16,006 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 13:12:16,006 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 13:12:16,006 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 13:12:16,007 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 13:12:16,007 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 13:12:16,007 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 13:12:16,007 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 13:12:16,007 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 13:12:16,007 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 13:12:16,007 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 13:12:16,007 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 13:12:16,007 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 13:12:16,007 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 13:12:16,008 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 13:12:16,008 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 13:12:16,008 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 13:12:16,008 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 13:12:16,008 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 13:12:16,008 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 13:12:16,008 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 13:12:16,008 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 13:12:16,008 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 13:12:16,008 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 13:12:16,009 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 13:12:16,009 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 13:12:16,009 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 13:12:16,009 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 13:12:16,009 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 13:12:16,009 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 13:12:16,009 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 13:12:16,009 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 13:12:16,009 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 13:12:16,009 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 13:12:16,010 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 13:12:16,010 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 13:12:16,010 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 13:12:16,010 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 13:12:16,010 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 13:12:16,010 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 13:12:16,010 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 13:12:16,010 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 13:12:16,010 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 13:12:16,011 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 13:12:16,011 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 13:12:16,011 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 13:12:16,011 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 13:12:16,011 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 13:12:16,011 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 13:12:16,011 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 13:12:16,011 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 13:12:16,011 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 13:12:16,011 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 13:12:16,011 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 13:12:16,012 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 13:12:16,012 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 13:12:16,012 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 13:12:16,012 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 13:12:16,012 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 13:12:16,012 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 13:12:16,012 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 13:12:16,012 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 13:12:16,012 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 13:12:16,012 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 13:12:16,013 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 13:12:16,013 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 13:12:16,013 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 13:12:16,013 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 13:12:16,013 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 13:12:16,013 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 13:12:16,013 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 13:12:16,013 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 13:12:16,013 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 13:12:16,013 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 13:12:16,014 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 13:12:16,014 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 13:12:16,014 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 13:12:16,014 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 13:12:16,014 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 13:12:16,014 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 13:12:16,014 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-11 13:12:16,014 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 13:12:16,014 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 13:12:16,014 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 13:12:16,015 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-11 13:12:16,015 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 13:12:16,015 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 13:12:16,015 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 13:12:16,015 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 13:12:16,015 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 13:12:16,015 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 13:12:16,015 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 13:12:16,358 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 13:12:16,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 01:12:16 BoogieIcfgContainer [2018-04-11 13:12:16,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 13:12:16,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 13:12:16,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 13:12:16,361 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 13:12:16,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 01:12:15" (1/3) ... [2018-04-11 13:12:16,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4862e01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 01:12:16, skipping insertion in model container [2018-04-11 13:12:16,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:12:15" (2/3) ... [2018-04-11 13:12:16,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4862e01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 01:12:16, skipping insertion in model container [2018-04-11 13:12:16,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 01:12:16" (3/3) ... [2018-04-11 13:12:16,363 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-04-11 13:12:16,371 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 13:12:16,376 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-04-11 13:12:16,405 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 13:12:16,405 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 13:12:16,405 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 13:12:16,405 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-11 13:12:16,405 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 13:12:16,406 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 13:12:16,406 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 13:12:16,406 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 13:12:16,406 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 13:12:16,406 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 13:12:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-04-11 13:12:16,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-11 13:12:16,420 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:16,420 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:16,420 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:16,423 INFO L82 PathProgramCache]: Analyzing trace with hash 764612502, now seen corresponding path program 1 times [2018-04-11 13:12:16,453 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:16,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:16,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:16,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 13:12:16,532 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:16,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:16,533 INFO L182 omatonBuilderFactory]: Interpolants [81#true, 82#false] [2018-04-11 13:12:16,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:16,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-11 13:12:16,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-11 13:12:16,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 13:12:16,548 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-04-11 13:12:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:16,566 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-04-11 13:12:16,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-11 13:12:16,567 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-04-11 13:12:16,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:16,574 INFO L225 Difference]: With dead ends: 78 [2018-04-11 13:12:16,574 INFO L226 Difference]: Without dead ends: 75 [2018-04-11 13:12:16,576 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 13:12:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-11 13:12:16,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-11 13:12:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-11 13:12:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2018-04-11 13:12:16,599 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 9 [2018-04-11 13:12:16,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:16,599 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2018-04-11 13:12:16,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-11 13:12:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2018-04-11 13:12:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 13:12:16,599 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:16,599 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:16,599 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:16,600 INFO L82 PathProgramCache]: Analyzing trace with hash -2144181541, now seen corresponding path program 1 times [2018-04-11 13:12:16,600 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:16,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:16,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:16,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:12:16,636 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:16,636 INFO L182 omatonBuilderFactory]: Interpolants [236#true, 237#false, 238#|main_#t~short8|] [2018-04-11 13:12:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:16,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:12:16,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:12:16,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:12:16,637 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 3 states. [2018-04-11 13:12:16,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:16,646 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-04-11 13:12:16,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:12:16,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-11 13:12:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:16,648 INFO L225 Difference]: With dead ends: 76 [2018-04-11 13:12:16,648 INFO L226 Difference]: Without dead ends: 76 [2018-04-11 13:12:16,648 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:12:16,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-04-11 13:12:16,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-04-11 13:12:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-11 13:12:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2018-04-11 13:12:16,656 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 12 [2018-04-11 13:12:16,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:16,656 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2018-04-11 13:12:16,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:12:16,656 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2018-04-11 13:12:16,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 13:12:16,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:16,657 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:16,657 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:16,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2142334499, now seen corresponding path program 1 times [2018-04-11 13:12:16,658 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:16,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:16,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:16,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:12:16,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:16,719 INFO L182 omatonBuilderFactory]: Interpolants [391#true, 392#false, 393#(and (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__garbage~0.offset) (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__garbage~0.base))] [2018-04-11 13:12:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:16,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:12:16,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:12:16,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:12:16,720 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 3 states. [2018-04-11 13:12:16,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:16,746 INFO L93 Difference]: Finished difference Result 134 states and 169 transitions. [2018-04-11 13:12:16,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:12:16,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-11 13:12:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:16,747 INFO L225 Difference]: With dead ends: 134 [2018-04-11 13:12:16,747 INFO L226 Difference]: Without dead ends: 134 [2018-04-11 13:12:16,747 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:12:16,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-11 13:12:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2018-04-11 13:12:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 13:12:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2018-04-11 13:12:16,755 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 12 [2018-04-11 13:12:16,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:16,756 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2018-04-11 13:12:16,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:12:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2018-04-11 13:12:16,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 13:12:16,756 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:16,756 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:16,756 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:16,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1987861526, now seen corresponding path program 1 times [2018-04-11 13:12:16,757 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:16,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:16,785 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:16,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 13:12:16,786 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:16,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:16,786 INFO L182 omatonBuilderFactory]: Interpolants [644#true, 645#false, 646#(= |#valid| |old(#valid)|)] [2018-04-11 13:12:16,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:16,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:12:16,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:12:16,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:12:16,786 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. Second operand 3 states. [2018-04-11 13:12:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:16,830 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2018-04-11 13:12:16,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:12:16,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-04-11 13:12:16,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:16,831 INFO L225 Difference]: With dead ends: 151 [2018-04-11 13:12:16,832 INFO L226 Difference]: Without dead ends: 147 [2018-04-11 13:12:16,832 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:12:16,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-11 13:12:16,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2018-04-11 13:12:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-11 13:12:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 194 transitions. [2018-04-11 13:12:16,842 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 194 transitions. Word has length 13 [2018-04-11 13:12:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:16,843 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 194 transitions. [2018-04-11 13:12:16,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:12:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 194 transitions. [2018-04-11 13:12:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 13:12:16,843 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:16,843 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:16,843 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:16,844 INFO L82 PathProgramCache]: Analyzing trace with hash -990934181, now seen corresponding path program 1 times [2018-04-11 13:12:16,844 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:16,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:16,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:16,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:12:16,894 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:16,894 INFO L182 omatonBuilderFactory]: Interpolants [935#true, 936#false, 937#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 1), 938#(<= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1), 939#(not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)] [2018-04-11 13:12:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:16,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:12:16,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:12:16,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:12:16,895 INFO L87 Difference]: Start difference. First operand 137 states and 194 transitions. Second operand 5 states. [2018-04-11 13:12:16,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:16,951 INFO L93 Difference]: Finished difference Result 259 states and 361 transitions. [2018-04-11 13:12:16,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:12:16,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 13:12:16,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:16,954 INFO L225 Difference]: With dead ends: 259 [2018-04-11 13:12:16,954 INFO L226 Difference]: Without dead ends: 259 [2018-04-11 13:12:16,955 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:12:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-04-11 13:12:16,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 228. [2018-04-11 13:12:16,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-11 13:12:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 340 transitions. [2018-04-11 13:12:16,969 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 340 transitions. Word has length 15 [2018-04-11 13:12:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:16,970 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 340 transitions. [2018-04-11 13:12:16,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:12:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 340 transitions. [2018-04-11 13:12:16,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 13:12:16,970 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:16,971 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:16,971 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:16,971 INFO L82 PathProgramCache]: Analyzing trace with hash -654467540, now seen corresponding path program 1 times [2018-04-11 13:12:16,971 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:16,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:17,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:12:17,003 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,003 INFO L182 omatonBuilderFactory]: Interpolants [1429#true, 1430#false, 1431#(= 1 (select |#valid| |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~malloc2.base|)), 1432#(= 1 (select |#valid| ~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.base))] [2018-04-11 13:12:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:12:17,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:12:17,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:12:17,004 INFO L87 Difference]: Start difference. First operand 228 states and 340 transitions. Second operand 4 states. [2018-04-11 13:12:17,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:17,089 INFO L93 Difference]: Finished difference Result 390 states and 573 transitions. [2018-04-11 13:12:17,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:12:17,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 13:12:17,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:17,092 INFO L225 Difference]: With dead ends: 390 [2018-04-11 13:12:17,092 INFO L226 Difference]: Without dead ends: 390 [2018-04-11 13:12:17,093 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:12:17,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-04-11 13:12:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 360. [2018-04-11 13:12:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-04-11 13:12:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 550 transitions. [2018-04-11 13:12:17,109 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 550 transitions. Word has length 16 [2018-04-11 13:12:17,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:17,109 INFO L459 AbstractCegarLoop]: Abstraction has 360 states and 550 transitions. [2018-04-11 13:12:17,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:12:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 550 transitions. [2018-04-11 13:12:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 13:12:17,110 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:17,110 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:17,111 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:17,111 INFO L82 PathProgramCache]: Analyzing trace with hash -654467539, now seen corresponding path program 1 times [2018-04-11 13:12:17,112 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:17,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:17,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:17,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:12:17,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,157 INFO L182 omatonBuilderFactory]: Interpolants [2185#true, 2186#false, 2187#(and (= 0 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~malloc2.offset|) (= 8 (select |#length| |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~malloc2.base|))), 2188#(and (= 8 (select |#length| ~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.base)) (= ~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.offset 0))] [2018-04-11 13:12:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:12:17,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:12:17,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:12:17,157 INFO L87 Difference]: Start difference. First operand 360 states and 550 transitions. Second operand 4 states. [2018-04-11 13:12:17,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:17,276 INFO L93 Difference]: Finished difference Result 489 states and 720 transitions. [2018-04-11 13:12:17,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:12:17,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 13:12:17,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:17,279 INFO L225 Difference]: With dead ends: 489 [2018-04-11 13:12:17,279 INFO L226 Difference]: Without dead ends: 489 [2018-04-11 13:12:17,279 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:12:17,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-04-11 13:12:17,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 462. [2018-04-11 13:12:17,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-04-11 13:12:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 698 transitions. [2018-04-11 13:12:17,293 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 698 transitions. Word has length 16 [2018-04-11 13:12:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:17,294 INFO L459 AbstractCegarLoop]: Abstraction has 462 states and 698 transitions. [2018-04-11 13:12:17,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:12:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 698 transitions. [2018-04-11 13:12:17,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 13:12:17,294 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:17,294 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:17,294 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:17,295 INFO L82 PathProgramCache]: Analyzing trace with hash 2111148230, now seen corresponding path program 1 times [2018-04-11 13:12:17,295 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:17,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:17,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:12:17,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,333 INFO L182 omatonBuilderFactory]: Interpolants [3142#true, 3143#false, 3144#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 1), 3145#(<= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1), 3146#(not |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~switch4|)] [2018-04-11 13:12:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:12:17,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:12:17,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:12:17,334 INFO L87 Difference]: Start difference. First operand 462 states and 698 transitions. Second operand 5 states. [2018-04-11 13:12:17,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:17,372 INFO L93 Difference]: Finished difference Result 865 states and 1229 transitions. [2018-04-11 13:12:17,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:12:17,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-11 13:12:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:17,375 INFO L225 Difference]: With dead ends: 865 [2018-04-11 13:12:17,376 INFO L226 Difference]: Without dead ends: 865 [2018-04-11 13:12:17,376 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:12:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-04-11 13:12:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 830. [2018-04-11 13:12:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-04-11 13:12:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1198 transitions. [2018-04-11 13:12:17,395 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1198 transitions. Word has length 16 [2018-04-11 13:12:17,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:17,395 INFO L459 AbstractCegarLoop]: Abstraction has 830 states and 1198 transitions. [2018-04-11 13:12:17,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:12:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1198 transitions. [2018-04-11 13:12:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 13:12:17,396 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:17,396 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:17,396 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:17,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1464034702, now seen corresponding path program 1 times [2018-04-11 13:12:17,397 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:17,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:17,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 13:12:17,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,437 INFO L182 omatonBuilderFactory]: Interpolants [4848#(<= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 2), 4849#(not |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~switch4|), 4844#true, 4845#false, 4846#(or (not |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~switch4|) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 2)), 4847#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 2)] [2018-04-11 13:12:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:12:17,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:12:17,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:12:17,438 INFO L87 Difference]: Start difference. First operand 830 states and 1198 transitions. Second operand 6 states. [2018-04-11 13:12:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:17,501 INFO L93 Difference]: Finished difference Result 1293 states and 1813 transitions. [2018-04-11 13:12:17,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 13:12:17,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-11 13:12:17,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:17,505 INFO L225 Difference]: With dead ends: 1293 [2018-04-11 13:12:17,505 INFO L226 Difference]: Without dead ends: 1293 [2018-04-11 13:12:17,505 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:12:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2018-04-11 13:12:17,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1222. [2018-04-11 13:12:17,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-04-11 13:12:17,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1746 transitions. [2018-04-11 13:12:17,530 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1746 transitions. Word has length 26 [2018-04-11 13:12:17,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:17,530 INFO L459 AbstractCegarLoop]: Abstraction has 1222 states and 1746 transitions. [2018-04-11 13:12:17,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:12:17,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1746 transitions. [2018-04-11 13:12:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 13:12:17,531 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:17,531 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:17,532 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:17,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1396165131, now seen corresponding path program 1 times [2018-04-11 13:12:17,532 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:17,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:17,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:12:17,568 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,569 INFO L182 omatonBuilderFactory]: Interpolants [7371#true, 7372#false, 7373#(or (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|) (<= 2 ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)), 7374#(<= 2 ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 7375#|main_#t~short8|] [2018-04-11 13:12:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:12:17,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:12:17,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:12:17,569 INFO L87 Difference]: Start difference. First operand 1222 states and 1746 transitions. Second operand 5 states. [2018-04-11 13:12:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:17,634 INFO L93 Difference]: Finished difference Result 1826 states and 2685 transitions. [2018-04-11 13:12:17,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:12:17,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-04-11 13:12:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:17,642 INFO L225 Difference]: With dead ends: 1826 [2018-04-11 13:12:17,642 INFO L226 Difference]: Without dead ends: 1826 [2018-04-11 13:12:17,643 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:12:17,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2018-04-11 13:12:17,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1804. [2018-04-11 13:12:17,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2018-04-11 13:12:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2673 transitions. [2018-04-11 13:12:17,690 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2673 transitions. Word has length 27 [2018-04-11 13:12:17,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:17,690 INFO L459 AbstractCegarLoop]: Abstraction has 1804 states and 2673 transitions. [2018-04-11 13:12:17,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:12:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2673 transitions. [2018-04-11 13:12:17,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 13:12:17,691 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:17,691 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:17,691 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:17,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1008277157, now seen corresponding path program 1 times [2018-04-11 13:12:17,692 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:17,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:17,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 13:12:17,815 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,816 INFO L182 omatonBuilderFactory]: Interpolants [11008#true, 11009#false, 11010#(or |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1| (and (or (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 0) (and (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0) (< 1 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|))) (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)) (< 0 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|)))), 11011#(and (or (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 0) (and (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0) (< 1 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|))) (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)) (< 0 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|))), 11012#(or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 1) (<= 3 ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)), 11013#(or (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1) (<= 3 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|)), 11014#(not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)] [2018-04-11 13:12:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:17,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:12:17,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:12:17,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:12:17,817 INFO L87 Difference]: Start difference. First operand 1804 states and 2673 transitions. Second operand 7 states. [2018-04-11 13:12:18,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:18,021 INFO L93 Difference]: Finished difference Result 2122 states and 3004 transitions. [2018-04-11 13:12:18,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:18,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-04-11 13:12:18,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:18,030 INFO L225 Difference]: With dead ends: 2122 [2018-04-11 13:12:18,030 INFO L226 Difference]: Without dead ends: 2122 [2018-04-11 13:12:18,030 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:12:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-04-11 13:12:18,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2098. [2018-04-11 13:12:18,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-04-11 13:12:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2986 transitions. [2018-04-11 13:12:18,095 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2986 transitions. Word has length 31 [2018-04-11 13:12:18,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:18,095 INFO L459 AbstractCegarLoop]: Abstraction has 2098 states and 2986 transitions. [2018-04-11 13:12:18,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:12:18,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2986 transitions. [2018-04-11 13:12:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 13:12:18,097 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:18,097 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:18,097 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:18,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1466399373, now seen corresponding path program 1 times [2018-04-11 13:12:18,098 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:18,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:18,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:18,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:12:18,228 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:18,231 INFO L182 omatonBuilderFactory]: Interpolants [15249#true, 15250#false, 15251#(and (or (< 1 |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3|) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1))) (or (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0) (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 2))), 15252#(or (and (not (= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 2)) (or (< 1 |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3|) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1))) (or (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0) (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 2))) |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~switch4|), 15253#(and (not (= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 2)) (or (< 1 |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3|) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1))) (or (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0) (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 2))), 15254#(or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 2) (<= 4 ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0)), 15255#(or (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 2) (<= 4 |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3|)), 15256#(not |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~switch4|)] [2018-04-11 13:12:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:18,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:12:18,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:12:18,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:12:18,232 INFO L87 Difference]: Start difference. First operand 2098 states and 2986 transitions. Second operand 8 states. [2018-04-11 13:12:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:18,456 INFO L93 Difference]: Finished difference Result 3085 states and 4339 transitions. [2018-04-11 13:12:18,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:18,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-04-11 13:12:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:18,469 INFO L225 Difference]: With dead ends: 3085 [2018-04-11 13:12:18,470 INFO L226 Difference]: Without dead ends: 3085 [2018-04-11 13:12:18,470 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:12:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2018-04-11 13:12:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 2980. [2018-04-11 13:12:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2980 states. [2018-04-11 13:12:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 4240 transitions. [2018-04-11 13:12:18,555 INFO L78 Accepts]: Start accepts. Automaton has 2980 states and 4240 transitions. Word has length 31 [2018-04-11 13:12:18,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:18,556 INFO L459 AbstractCegarLoop]: Abstraction has 2980 states and 4240 transitions. [2018-04-11 13:12:18,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:12:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 4240 transitions. [2018-04-11 13:12:18,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 13:12:18,557 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:18,557 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:18,557 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:18,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1708388511, now seen corresponding path program 1 times [2018-04-11 13:12:18,558 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:18,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:18,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:18,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:12:18,691 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:18,691 INFO L182 omatonBuilderFactory]: Interpolants [21336#true, 21337#false, 21338#(and (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)) (< 2 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|)) (or (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 3) (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0))), 21339#(or |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1| (and (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)) (< 2 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|)) (or (and (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0) (< 3 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|)) (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 2)))), 21340#(and (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)) (< 2 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|)) (or (and (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0) (< 3 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|)) (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 2))), 21341#(or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 3) (<= 5 ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)), 21342#(or (<= 5 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|) (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 3)), 21343#(not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)] [2018-04-11 13:12:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:18,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:12:18,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:12:18,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:12:18,692 INFO L87 Difference]: Start difference. First operand 2980 states and 4240 transitions. Second operand 8 states. [2018-04-11 13:12:18,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:18,977 INFO L93 Difference]: Finished difference Result 4961 states and 7003 transitions. [2018-04-11 13:12:18,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 13:12:18,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-11 13:12:18,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:19,001 INFO L225 Difference]: With dead ends: 4961 [2018-04-11 13:12:19,001 INFO L226 Difference]: Without dead ends: 4961 [2018-04-11 13:12:19,002 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:12:19,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4961 states. [2018-04-11 13:12:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4961 to 4888. [2018-04-11 13:12:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2018-04-11 13:12:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 6936 transitions. [2018-04-11 13:12:19,172 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 6936 transitions. Word has length 33 [2018-04-11 13:12:19,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:19,172 INFO L459 AbstractCegarLoop]: Abstraction has 4888 states and 6936 transitions. [2018-04-11 13:12:19,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:12:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 6936 transitions. [2018-04-11 13:12:19,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 13:12:19,173 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:19,173 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:19,173 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:19,173 INFO L82 PathProgramCache]: Analyzing trace with hash 460690199, now seen corresponding path program 1 times [2018-04-11 13:12:19,174 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:19,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:19,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:19,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 13:12:19,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:19,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:19,269 INFO L182 omatonBuilderFactory]: Interpolants [31216#(or (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 4) (<= 6 |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3|)), 31217#(not |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~switch4|), 31211#true, 31212#false, 31213#(and (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1)) (< 3 |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3|)) (or (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0) (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 4))), 31214#(or |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~switch4| (and (or (and (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0) (not (= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 4))) (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 3)) (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1)) (< 3 |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3|)))), 31215#(or (<= 6 ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 4))] [2018-04-11 13:12:19,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:19,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:12:19,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:12:19,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:12:19,269 INFO L87 Difference]: Start difference. First operand 4888 states and 6936 transitions. Second operand 7 states. [2018-04-11 13:12:19,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:19,567 INFO L93 Difference]: Finished difference Result 6291 states and 8827 transitions. [2018-04-11 13:12:19,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 13:12:19,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-04-11 13:12:19,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:19,593 INFO L225 Difference]: With dead ends: 6291 [2018-04-11 13:12:19,593 INFO L226 Difference]: Without dead ends: 6291 [2018-04-11 13:12:19,593 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:12:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6291 states. [2018-04-11 13:12:19,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6291 to 6110. [2018-04-11 13:12:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6110 states. [2018-04-11 13:12:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6110 states to 6110 states and 8648 transitions. [2018-04-11 13:12:19,741 INFO L78 Accepts]: Start accepts. Automaton has 6110 states and 8648 transitions. Word has length 33 [2018-04-11 13:12:19,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:19,742 INFO L459 AbstractCegarLoop]: Abstraction has 6110 states and 8648 transitions. [2018-04-11 13:12:19,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:12:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 6110 states and 8648 transitions. [2018-04-11 13:12:19,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 13:12:19,743 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:19,743 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:19,743 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:19,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1776763504, now seen corresponding path program 1 times [2018-04-11 13:12:19,744 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:19,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-04-11 13:12:19,797 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:19,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:12:19,797 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:19,797 INFO L182 omatonBuilderFactory]: Interpolants [43633#true, 43634#false, 43635#(and (= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0) (= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 1)), 43636#(not |main_#t~short8|)] [2018-04-11 13:12:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-04-11 13:12:19,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:12:19,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:12:19,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:12:19,798 INFO L87 Difference]: Start difference. First operand 6110 states and 8648 transitions. Second operand 4 states. [2018-04-11 13:12:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:19,858 INFO L93 Difference]: Finished difference Result 6119 states and 8662 transitions. [2018-04-11 13:12:19,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:12:19,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-04-11 13:12:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:19,878 INFO L225 Difference]: With dead ends: 6119 [2018-04-11 13:12:19,878 INFO L226 Difference]: Without dead ends: 6119 [2018-04-11 13:12:19,879 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:12:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6119 states. [2018-04-11 13:12:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6119 to 6113. [2018-04-11 13:12:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6113 states. [2018-04-11 13:12:19,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6113 states to 6113 states and 8651 transitions. [2018-04-11 13:12:19,963 INFO L78 Accepts]: Start accepts. Automaton has 6113 states and 8651 transitions. Word has length 38 [2018-04-11 13:12:19,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:19,963 INFO L459 AbstractCegarLoop]: Abstraction has 6113 states and 8651 transitions. [2018-04-11 13:12:19,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:12:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 6113 states and 8651 transitions. [2018-04-11 13:12:19,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 13:12:19,963 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:19,964 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:19,964 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:19,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1816603918, now seen corresponding path program 1 times [2018-04-11 13:12:19,964 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:19,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:20,018 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:20,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:12:20,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:20,019 INFO L182 omatonBuilderFactory]: Interpolants [55872#false, 55873#(and (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.offset) (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base)), 55874#(and (= ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base)|) (= ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.offset |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.offset)|)), 55875#(and (= ~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.base |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base)|) (= ~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.offset |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.offset)|)), 55876#(and (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.base) (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.offset)), 55877#(and (= ~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.offset |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.offset)|) (= ~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.base |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.base)|)), 55878#(or (not (= 0 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.base)|)) (not (= 0 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.offset)|))), 55871#true] [2018-04-11 13:12:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:20,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:12:20,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:12:20,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:12:20,019 INFO L87 Difference]: Start difference. First operand 6113 states and 8651 transitions. Second operand 8 states. [2018-04-11 13:12:20,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:20,459 INFO L93 Difference]: Finished difference Result 12526 states and 18445 transitions. [2018-04-11 13:12:20,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 13:12:20,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-04-11 13:12:20,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:20,502 INFO L225 Difference]: With dead ends: 12526 [2018-04-11 13:12:20,502 INFO L226 Difference]: Without dead ends: 12526 [2018-04-11 13:12:20,502 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:12:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12526 states. [2018-04-11 13:12:20,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12526 to 11605. [2018-04-11 13:12:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11605 states. [2018-04-11 13:12:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11605 states to 11605 states and 16469 transitions. [2018-04-11 13:12:20,815 INFO L78 Accepts]: Start accepts. Automaton has 11605 states and 16469 transitions. Word has length 38 [2018-04-11 13:12:20,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:20,815 INFO L459 AbstractCegarLoop]: Abstraction has 11605 states and 16469 transitions. [2018-04-11 13:12:20,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:12:20,815 INFO L276 IsEmpty]: Start isEmpty. Operand 11605 states and 16469 transitions. [2018-04-11 13:12:20,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 13:12:20,816 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:20,817 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:20,817 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:20,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2142437170, now seen corresponding path program 1 times [2018-04-11 13:12:20,817 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:20,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:20,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:20,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:12:20,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:20,886 INFO L182 omatonBuilderFactory]: Interpolants [80033#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 80032#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 2), 80035#(or (<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 80034#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 80036#(<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 80029#true, 80031#(or (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 2)), 80030#false] [2018-04-11 13:12:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:20,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:12:20,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:12:20,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:12:20,887 INFO L87 Difference]: Start difference. First operand 11605 states and 16469 transitions. Second operand 8 states. [2018-04-11 13:12:21,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:21,130 INFO L93 Difference]: Finished difference Result 11828 states and 16830 transitions. [2018-04-11 13:12:21,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 13:12:21,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-04-11 13:12:21,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:21,164 INFO L225 Difference]: With dead ends: 11828 [2018-04-11 13:12:21,164 INFO L226 Difference]: Without dead ends: 11788 [2018-04-11 13:12:21,164 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:12:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11788 states. [2018-04-11 13:12:21,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11788 to 11565. [2018-04-11 13:12:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11565 states. [2018-04-11 13:12:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11565 states to 11565 states and 16409 transitions. [2018-04-11 13:12:21,383 INFO L78 Accepts]: Start accepts. Automaton has 11565 states and 16409 transitions. Word has length 42 [2018-04-11 13:12:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:21,384 INFO L459 AbstractCegarLoop]: Abstraction has 11565 states and 16409 transitions. [2018-04-11 13:12:21,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:12:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 11565 states and 16409 transitions. [2018-04-11 13:12:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 13:12:21,385 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:21,385 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:21,385 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:21,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1711295696, now seen corresponding path program 1 times [2018-04-11 13:12:21,386 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:21,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:21,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:21,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 13:12:21,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:21,545 INFO L182 omatonBuilderFactory]: Interpolants [103443#true, 103445#(and (or (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0) (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 2)) (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)) (< 1 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|))), 103444#false, 103447#(and (or (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0) (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 2)) (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)) (< 1 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|)) (not (= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 2))), 103446#(or |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1| (and (or (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0) (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 2)) (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)) (< 1 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|)) (not (= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 2)))), 103449#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 103448#(or (<= 4 ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 2)), 103451#(or (and (<= 3 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|) (<= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| 3)) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 103450#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 103452#(and (<= 3 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|) (<= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| 3))] [2018-04-11 13:12:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:21,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:12:21,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:12:21,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:12:21,546 INFO L87 Difference]: Start difference. First operand 11565 states and 16409 transitions. Second operand 10 states. [2018-04-11 13:12:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:21,972 INFO L93 Difference]: Finished difference Result 11421 states and 16089 transitions. [2018-04-11 13:12:21,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:21,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-04-11 13:12:21,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:22,007 INFO L225 Difference]: With dead ends: 11421 [2018-04-11 13:12:22,007 INFO L226 Difference]: Without dead ends: 11221 [2018-04-11 13:12:22,008 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:12:22,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11221 states. [2018-04-11 13:12:22,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11221 to 10977. [2018-04-11 13:12:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2018-04-11 13:12:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 15487 transitions. [2018-04-11 13:12:22,200 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 15487 transitions. Word has length 45 [2018-04-11 13:12:22,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:22,201 INFO L459 AbstractCegarLoop]: Abstraction has 10977 states and 15487 transitions. [2018-04-11 13:12:22,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:12:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 15487 transitions. [2018-04-11 13:12:22,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 13:12:22,203 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:22,203 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:22,203 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:22,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1402529137, now seen corresponding path program 1 times [2018-04-11 13:12:22,203 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:22,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:22,352 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:22,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 13:12:22,352 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:22,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:22,353 INFO L182 omatonBuilderFactory]: Interpolants [125873#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0)|), 125872#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0), 125875#(and (<= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0)| 4) (<= 4 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0)|)), 125874#(or (not |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~switch4|) (and (<= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0)| 4) (<= 4 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0)|))), 125867#false, 125866#true, 125869#(or (and (not (= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 3)) (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1)) (< 2 |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3|)) (or (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0) (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 3))) |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~switch4|), 125868#(and (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1)) (< 2 |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3|)) (or (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0) (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 3))), 125871#(or (<= 5 ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 3)), 125870#(and (not (= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 3)) (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1)) (< 2 |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3|)) (or (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0) (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 3)))] [2018-04-11 13:12:22,353 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:22,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:12:22,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:12:22,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:12:22,354 INFO L87 Difference]: Start difference. First operand 10977 states and 15487 transitions. Second operand 10 states. [2018-04-11 13:12:22,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:22,665 INFO L93 Difference]: Finished difference Result 11075 states and 15529 transitions. [2018-04-11 13:12:22,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:22,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-04-11 13:12:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:22,713 INFO L225 Difference]: With dead ends: 11075 [2018-04-11 13:12:22,713 INFO L226 Difference]: Without dead ends: 10718 [2018-04-11 13:12:22,713 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:12:22,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10718 states. [2018-04-11 13:12:22,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10718 to 8881. [2018-04-11 13:12:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8881 states. [2018-04-11 13:12:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8881 states to 8881 states and 12460 transitions. [2018-04-11 13:12:22,987 INFO L78 Accepts]: Start accepts. Automaton has 8881 states and 12460 transitions. Word has length 47 [2018-04-11 13:12:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:22,988 INFO L459 AbstractCegarLoop]: Abstraction has 8881 states and 12460 transitions. [2018-04-11 13:12:22,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:12:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 8881 states and 12460 transitions. [2018-04-11 13:12:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 13:12:22,990 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:22,990 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:22,991 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:22,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1766984159, now seen corresponding path program 1 times [2018-04-11 13:12:22,991 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:23,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 13:12:23,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:23,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:12:23,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:23,079 INFO L182 omatonBuilderFactory]: Interpolants [145856#(or (<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 145857#(<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 145850#false, 145851#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)), 145849#true, 145854#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 145855#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 145852#(or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 3) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 145853#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 3)] [2018-04-11 13:12:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 13:12:23,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:12:23,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:12:23,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:12:23,080 INFO L87 Difference]: Start difference. First operand 8881 states and 12460 transitions. Second operand 9 states. [2018-04-11 13:12:23,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:23,370 INFO L93 Difference]: Finished difference Result 8988 states and 12506 transitions. [2018-04-11 13:12:23,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:23,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-04-11 13:12:23,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:23,395 INFO L225 Difference]: With dead ends: 8988 [2018-04-11 13:12:23,395 INFO L226 Difference]: Without dead ends: 8988 [2018-04-11 13:12:23,395 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:12:23,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8988 states. [2018-04-11 13:12:23,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8988 to 8881. [2018-04-11 13:12:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8881 states. [2018-04-11 13:12:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8881 states to 8881 states and 12392 transitions. [2018-04-11 13:12:23,495 INFO L78 Accepts]: Start accepts. Automaton has 8881 states and 12392 transitions. Word has length 54 [2018-04-11 13:12:23,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:23,495 INFO L459 AbstractCegarLoop]: Abstraction has 8881 states and 12392 transitions. [2018-04-11 13:12:23,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:12:23,495 INFO L276 IsEmpty]: Start isEmpty. Operand 8881 states and 12392 transitions. [2018-04-11 13:12:23,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 13:12:23,496 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:23,496 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:23,496 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:23,497 INFO L82 PathProgramCache]: Analyzing trace with hash -2029376545, now seen corresponding path program 1 times [2018-04-11 13:12:23,497 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:23,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-11 13:12:23,549 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:23,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:12:23,549 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:23,550 INFO L182 omatonBuilderFactory]: Interpolants [163750#false, 163751#(or (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 2)), 163749#true, 163754#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 163755#(or (<= 3 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 163752#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 2), 163753#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 163756#(<= 3 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|)] [2018-04-11 13:12:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-11 13:12:23,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:12:23,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:12:23,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:12:23,550 INFO L87 Difference]: Start difference. First operand 8881 states and 12392 transitions. Second operand 8 states. [2018-04-11 13:12:23,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:23,793 INFO L93 Difference]: Finished difference Result 8920 states and 12385 transitions. [2018-04-11 13:12:23,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:23,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-04-11 13:12:23,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:23,824 INFO L225 Difference]: With dead ends: 8920 [2018-04-11 13:12:23,824 INFO L226 Difference]: Without dead ends: 8780 [2018-04-11 13:12:23,824 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:12:23,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8780 states. [2018-04-11 13:12:23,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8780 to 8741. [2018-04-11 13:12:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8741 states. [2018-04-11 13:12:23,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8741 states to 8741 states and 12184 transitions. [2018-04-11 13:12:23,971 INFO L78 Accepts]: Start accepts. Automaton has 8741 states and 12184 transitions. Word has length 54 [2018-04-11 13:12:23,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:23,971 INFO L459 AbstractCegarLoop]: Abstraction has 8741 states and 12184 transitions. [2018-04-11 13:12:23,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:12:23,971 INFO L276 IsEmpty]: Start isEmpty. Operand 8741 states and 12184 transitions. [2018-04-11 13:12:23,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 13:12:23,973 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:23,973 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:23,973 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:23,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2017153842, now seen corresponding path program 1 times [2018-04-11 13:12:23,974 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:23,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 13:12:24,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:24,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:12:24,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:24,101 INFO L182 omatonBuilderFactory]: Interpolants [181442#(or (and (<= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| 6) (<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|)) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 181443#(and (<= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| 6) (<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|)), 181440#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 181441#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 181435#true, 181438#(or |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1| (and (or (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 5) (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)) (not (= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 5)) (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)) (< 4 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|)))), 181439#(or (<= 7 ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 5)), 181436#false, 181437#(and (or (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 5) (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)) (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)) (< 4 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|)))] [2018-04-11 13:12:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 13:12:24,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:12:24,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:12:24,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:12:24,102 INFO L87 Difference]: Start difference. First operand 8741 states and 12184 transitions. Second operand 9 states. [2018-04-11 13:12:24,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:24,429 INFO L93 Difference]: Finished difference Result 10621 states and 15109 transitions. [2018-04-11 13:12:24,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 13:12:24,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-04-11 13:12:24,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:24,466 INFO L225 Difference]: With dead ends: 10621 [2018-04-11 13:12:24,466 INFO L226 Difference]: Without dead ends: 10617 [2018-04-11 13:12:24,466 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:12:24,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10617 states. [2018-04-11 13:12:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10617 to 10482. [2018-04-11 13:12:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10482 states. [2018-04-11 13:12:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10482 states to 10482 states and 14961 transitions. [2018-04-11 13:12:24,642 INFO L78 Accepts]: Start accepts. Automaton has 10482 states and 14961 transitions. Word has length 58 [2018-04-11 13:12:24,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:24,642 INFO L459 AbstractCegarLoop]: Abstraction has 10482 states and 14961 transitions. [2018-04-11 13:12:24,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:12:24,642 INFO L276 IsEmpty]: Start isEmpty. Operand 10482 states and 14961 transitions. [2018-04-11 13:12:24,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 13:12:24,644 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:24,644 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:24,644 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:24,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1522264473, now seen corresponding path program 1 times [2018-04-11 13:12:24,645 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:24,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 13:12:24,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:24,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 13:12:24,801 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:24,802 INFO L182 omatonBuilderFactory]: Interpolants [202567#(or |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1| (and (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)) (< 3 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|)) (or (and (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0) (not (= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 4))) (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 3)))), 202566#(and (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)) (< 3 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|)) (or (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 4) (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0))), 202565#false, 202564#true, 202571#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 202570#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 202569#(or (<= 6 ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 4)), 202568#(and (or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)) (< 3 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0|)) (or (and (<= (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1) ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0) (not (= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 4))) (<= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 3))), 202573#(and (<= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| 5) (<= 5 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|)), 202572#(or (and (<= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| 5) (<= 5 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|)) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|))] [2018-04-11 13:12:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 13:12:24,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:12:24,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:12:24,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:12:24,802 INFO L87 Difference]: Start difference. First operand 10482 states and 14961 transitions. Second operand 10 states. [2018-04-11 13:12:25,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:25,151 INFO L93 Difference]: Finished difference Result 4499 states and 6057 transitions. [2018-04-11 13:12:25,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:25,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-04-11 13:12:25,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:25,159 INFO L225 Difference]: With dead ends: 4499 [2018-04-11 13:12:25,160 INFO L226 Difference]: Without dead ends: 4438 [2018-04-11 13:12:25,160 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:12:25,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4438 states. [2018-04-11 13:12:25,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4438 to 4407. [2018-04-11 13:12:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4407 states. [2018-04-11 13:12:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4407 states to 4407 states and 5954 transitions. [2018-04-11 13:12:25,233 INFO L78 Accepts]: Start accepts. Automaton has 4407 states and 5954 transitions. Word has length 60 [2018-04-11 13:12:25,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:25,233 INFO L459 AbstractCegarLoop]: Abstraction has 4407 states and 5954 transitions. [2018-04-11 13:12:25,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:12:25,234 INFO L276 IsEmpty]: Start isEmpty. Operand 4407 states and 5954 transitions. [2018-04-11 13:12:25,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 13:12:25,235 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:25,235 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:25,235 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:25,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1953024946, now seen corresponding path program 1 times [2018-04-11 13:12:25,236 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:25,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 51 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-11 13:12:25,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:25,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:12:25,296 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:25,297 INFO L182 omatonBuilderFactory]: Interpolants [211507#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 211506#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 211505#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 4), 211504#(or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 4) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 211509#(<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 211508#(or (<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 211503#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)), 211502#false, 211501#true] [2018-04-11 13:12:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 51 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-11 13:12:25,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:12:25,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:12:25,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:12:25,298 INFO L87 Difference]: Start difference. First operand 4407 states and 5954 transitions. Second operand 9 states. [2018-04-11 13:12:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:25,534 INFO L93 Difference]: Finished difference Result 4447 states and 5971 transitions. [2018-04-11 13:12:25,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:25,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2018-04-11 13:12:25,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:25,540 INFO L225 Difference]: With dead ends: 4447 [2018-04-11 13:12:25,541 INFO L226 Difference]: Without dead ends: 4413 [2018-04-11 13:12:25,541 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:12:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2018-04-11 13:12:25,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 4356. [2018-04-11 13:12:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4356 states. [2018-04-11 13:12:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4356 states to 4356 states and 5886 transitions. [2018-04-11 13:12:25,586 INFO L78 Accepts]: Start accepts. Automaton has 4356 states and 5886 transitions. Word has length 66 [2018-04-11 13:12:25,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:25,586 INFO L459 AbstractCegarLoop]: Abstraction has 4356 states and 5886 transitions. [2018-04-11 13:12:25,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:12:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4356 states and 5886 transitions. [2018-04-11 13:12:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 13:12:25,587 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:25,588 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:25,588 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:25,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1759935924, now seen corresponding path program 1 times [2018-04-11 13:12:25,589 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:25,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-04-11 13:12:25,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:25,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:12:25,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:25,653 INFO L182 omatonBuilderFactory]: Interpolants [220339#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 3), 220338#(or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 3) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 220337#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)), 220336#false, 220343#(<= 4 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 220342#(or (<= 4 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 220341#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 220340#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 220335#true] [2018-04-11 13:12:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-04-11 13:12:25,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:12:25,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:12:25,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:12:25,653 INFO L87 Difference]: Start difference. First operand 4356 states and 5886 transitions. Second operand 9 states. [2018-04-11 13:12:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:25,966 INFO L93 Difference]: Finished difference Result 4413 states and 5886 transitions. [2018-04-11 13:12:25,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:25,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-04-11 13:12:25,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:25,974 INFO L225 Difference]: With dead ends: 4413 [2018-04-11 13:12:25,974 INFO L226 Difference]: Without dead ends: 4413 [2018-04-11 13:12:25,975 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:12:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2018-04-11 13:12:26,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 4356. [2018-04-11 13:12:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4356 states. [2018-04-11 13:12:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4356 states to 4356 states and 5835 transitions. [2018-04-11 13:12:26,035 INFO L78 Accepts]: Start accepts. Automaton has 4356 states and 5835 transitions. Word has length 68 [2018-04-11 13:12:26,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:26,036 INFO L459 AbstractCegarLoop]: Abstraction has 4356 states and 5835 transitions. [2018-04-11 13:12:26,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:12:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 4356 states and 5835 transitions. [2018-04-11 13:12:26,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-11 13:12:26,037 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:26,038 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:26,038 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:26,038 INFO L82 PathProgramCache]: Analyzing trace with hash 797961657, now seen corresponding path program 1 times [2018-04-11 13:12:26,038 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:26,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-04-11 13:12:26,132 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:26,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:12:26,133 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-11 13:12:26,133 INFO L182 omatonBuilderFactory]: Interpolants [229139#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 229138#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 5), 229137#(or (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 5)), 229136#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)), 229142#(<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 229141#(or (<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 229140#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 229135#false, 229134#true] [2018-04-11 13:12:26,134 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-04-11 13:12:26,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:12:26,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:12:26,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:12:26,134 INFO L87 Difference]: Start difference. First operand 4356 states and 5835 transitions. Second operand 9 states. [2018-04-11 13:12:26,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:26,340 INFO L93 Difference]: Finished difference Result 4292 states and 5716 transitions. [2018-04-11 13:12:26,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:26,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-04-11 13:12:26,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:26,346 INFO L225 Difference]: With dead ends: 4292 [2018-04-11 13:12:26,346 INFO L226 Difference]: Without dead ends: 4288 [2018-04-11 13:12:26,346 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:12:26,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2018-04-11 13:12:26,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 4246. [2018-04-11 13:12:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4246 states. [2018-04-11 13:12:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4246 states to 4246 states and 5676 transitions. [2018-04-11 13:12:26,406 INFO L78 Accepts]: Start accepts. Automaton has 4246 states and 5676 transitions. Word has length 80 [2018-04-11 13:12:26,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:26,406 INFO L459 AbstractCegarLoop]: Abstraction has 4246 states and 5676 transitions. [2018-04-11 13:12:26,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:12:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4246 states and 5676 transitions. [2018-04-11 13:12:26,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-11 13:12:26,408 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:26,408 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:26,408 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:26,409 INFO L82 PathProgramCache]: Analyzing trace with hash 623126807, now seen corresponding path program 1 times [2018-04-11 13:12:26,409 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:26,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-04-11 13:12:26,474 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:26,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:12:26,475 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:26,475 INFO L182 omatonBuilderFactory]: Interpolants [237703#true, 237707#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 4), 237706#(or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 4) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 237705#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)), 237704#false, 237711#(<= 5 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 237710#(or (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|) (<= 5 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|)), 237709#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 237708#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)] [2018-04-11 13:12:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-04-11 13:12:26,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:12:26,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:12:26,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:12:26,475 INFO L87 Difference]: Start difference. First operand 4246 states and 5676 transitions. Second operand 9 states. [2018-04-11 13:12:26,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:26,703 INFO L93 Difference]: Finished difference Result 4286 states and 5676 transitions. [2018-04-11 13:12:26,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:26,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-04-11 13:12:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:26,711 INFO L225 Difference]: With dead ends: 4286 [2018-04-11 13:12:26,711 INFO L226 Difference]: Without dead ends: 4201 [2018-04-11 13:12:26,712 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:12:26,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4201 states. [2018-04-11 13:12:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4201 to 4144. [2018-04-11 13:12:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4144 states. [2018-04-11 13:12:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5540 transitions. [2018-04-11 13:12:26,763 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5540 transitions. Word has length 81 [2018-04-11 13:12:26,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:26,763 INFO L459 AbstractCegarLoop]: Abstraction has 4144 states and 5540 transitions. [2018-04-11 13:12:26,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:12:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5540 transitions. [2018-04-11 13:12:26,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-11 13:12:26,765 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:26,765 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:26,765 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-11 13:12:26,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1015411636, now seen corresponding path program 1 times [2018-04-11 13:12:26,765 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 13:12:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 13:12:26,844 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-11 13:12:26,906 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-04-11 13:12:26,917 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,918 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,919 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,919 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,920 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,920 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,923 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,924 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,924 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,925 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,927 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,928 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,928 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,929 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,931 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,931 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,932 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,932 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,932 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,933 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,934 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,935 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,935 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,935 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,936 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,936 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,937 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,937 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,938 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,938 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,938 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,938 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,938 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,939 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-11 13:12:26,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 01:12:26 BoogieIcfgContainer [2018-04-11 13:12:26,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 13:12:26,950 INFO L168 Benchmark]: Toolchain (without parser) took 11357.94 ms. Allocated memory was 388.0 MB in the beginning and 1.0 GB in the end (delta: 627.0 MB). Free memory was 317.9 MB in the beginning and 522.5 MB in the end (delta: -204.6 MB). Peak memory consumption was 422.4 MB. Max. memory is 5.3 GB. [2018-04-11 13:12:26,951 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 388.0 MB. Free memory is still 348.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 13:12:26,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.93 ms. Allocated memory is still 388.0 MB. Free memory was 317.9 MB in the beginning and 292.8 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-11 13:12:26,951 INFO L168 Benchmark]: Boogie Preprocessor took 40.33 ms. Allocated memory is still 388.0 MB. Free memory was 292.8 MB in the beginning and 288.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-04-11 13:12:26,952 INFO L168 Benchmark]: RCFGBuilder took 439.84 ms. Allocated memory was 388.0 MB in the beginning and 579.9 MB in the end (delta: 191.9 MB). Free memory was 288.8 MB in the beginning and 506.9 MB in the end (delta: -218.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-11 13:12:26,952 INFO L168 Benchmark]: TraceAbstraction took 10590.42 ms. Allocated memory was 579.9 MB in the beginning and 1.0 GB in the end (delta: 435.2 MB). Free memory was 506.9 MB in the beginning and 522.5 MB in the end (delta: -15.5 MB). Peak memory consumption was 419.6 MB. Max. memory is 5.3 GB. [2018-04-11 13:12:26,953 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.13 ms. Allocated memory is still 388.0 MB. Free memory is still 348.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 284.93 ms. Allocated memory is still 388.0 MB. Free memory was 317.9 MB in the beginning and 292.8 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.33 ms. Allocated memory is still 388.0 MB. Free memory was 292.8 MB in the beginning and 288.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 439.84 ms. Allocated memory was 388.0 MB in the beginning and 579.9 MB in the end (delta: 191.9 MB). Free memory was 288.8 MB in the beginning and 506.9 MB in the end (delta: -218.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10590.42 ms. Allocated memory was 579.9 MB in the beginning and 1.0 GB in the end (delta: 435.2 MB). Free memory was 506.9 MB in the beginning and 522.5 MB in the end (delta: -15.5 MB). Peak memory consumption was 419.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 688]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=17, \old(garbage)=23, \old(pc1)=26, \old(pc4)=16, \old(res4)=15, \old(S)=12, \old(S)=25, \old(t1)=22, \old(t1)=24, \old(t4)=18, \old(t4)=13, \old(x1)=14, \old(x1)=20, \old(x4)=21, \old(x4)=11, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L632] COND TRUE case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] EXPR, FCALL malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={10:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] x1 = malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={10:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L634] FCALL x1->data = 0 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={10:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L635] RET, FCALL x1->next = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={10:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L632] COND FALSE !(case 1:) [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L637] COND TRUE case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L638] RET, FCALL x1->data = 4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L632] COND FALSE !(case 1:) [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L637] COND FALSE !(case 2:) [L640] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L640] COND TRUE case 3: [L641] RET t1 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L632] COND FALSE !(case 1:) [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L637] COND FALSE !(case 2:) [L640] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L640] COND FALSE !(case 3:) [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L643] COND TRUE case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L644] RET, FCALL x1->next = t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L632] COND FALSE !(case 1:) [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L637] COND FALSE !(case 2:) [L640] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L640] COND FALSE !(case 3:) [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L643] COND FALSE !(case 4:) [L646] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L646] COND TRUE case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L647] COND TRUE S == t1 [L648] RET S = x1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L632] COND FALSE !(case 1:) [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L637] COND FALSE !(case 2:) [L640] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L640] COND FALSE !(case 3:) [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L643] COND FALSE !(case 4:) [L646] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L646] COND FALSE !(case 5:) [L652] case 6: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L652] COND TRUE case 6: [L653] RET pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L696] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L701] S = ((void *)0) [L702] t1 = ((void *)0) [L703] x1 = ((void *)0) [L704] t4 = ((void *)0) [L705] x4 = ((void *)0) [L706] return !!garbage; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, \result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 78 locations, 19 error locations. UNSAFE Result, 10.5s OverallTime, 28 OverallIterations, 7 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2560 SDtfs, 3687 SDslu, 5653 SDs, 0 SdLazy, 4308 SolverSat, 551 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11605occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 696/821 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 4383 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1116 NumberOfCodeBlocks, 1116 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 994 ConstructedInterpolants, 0 QuantifiedInterpolants, 141484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 696/821 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/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_13-12-26-960.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_13-12-26-960.csv Received shutdown request...