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.3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 13:12:33,184 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 13:12:33,185 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 13:12:33,197 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 13:12:33,197 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 13:12:33,198 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 13:12:33,199 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 13:12:33,200 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 13:12:33,201 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 13:12:33,202 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 13:12:33,203 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 13:12:33,203 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 13:12:33,204 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 13:12:33,204 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 13:12:33,205 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 13:12:33,207 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 13:12:33,208 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 13:12:33,209 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 13:12:33,210 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 13:12:33,211 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 13:12:33,213 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 13:12:33,213 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 13:12:33,213 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 13:12:33,214 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 13:12:33,214 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 13:12:33,215 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 13:12:33,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 13:12:33,216 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 13:12:33,216 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 13:12:33,217 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 13:12:33,217 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 13:12:33,217 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:33,238 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 13:12:33,239 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 13:12:33,240 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 13:12:33,240 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 13:12:33,240 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 13:12:33,240 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 13:12:33,240 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 13:12:33,240 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 13:12:33,240 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 13:12:33,240 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 13:12:33,240 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 13:12:33,240 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 13:12:33,241 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 13:12:33,241 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 13:12:33,241 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 13:12:33,241 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 13:12:33,241 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 13:12:33,241 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 13:12:33,241 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 13:12:33,241 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 13:12:33,241 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 13:12:33,242 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:33,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 13:12:33,275 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 13:12:33,278 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 13:12:33,279 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 13:12:33,280 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 13:12:33,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,651 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG8ee05578e [2018-04-11 13:12:33,757 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 13:12:33,757 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 13:12:33,758 INFO L168 CDTParser]: Scanning lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,764 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 13:12:33,765 INFO L215 ultiparseSymbolTable]: [2018-04-11 13:12:33,765 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 13:12:33,765 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flockfree_____false_valid_memtrack_i__pop ('pop') in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,765 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,765 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flockfree_____false_valid_memtrack_i__push ('push') in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,765 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 13:12:33,765 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____mode_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,765 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____intptr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ssize_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__size_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____time_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int8_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsfilcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_mutexattr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____timer_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int8_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int32_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__mode_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__timer_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____nlink_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__caddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_short in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__gid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pc4 in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ssize_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blkcnt64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__key_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fd_set in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsfilcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_short in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int32_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pc1 in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int16_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____id_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____sig_atomic_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_char in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____off64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fd_mask in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int8_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint32_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__x4 in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_once_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__x1 in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsblkcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__blksize_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____clockid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__div_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_long in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____pthread_list_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_cond_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsblkcnt64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int16_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__blkcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__quad_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__garbage in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____suseconds_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_char in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__off_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__uid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____socklen_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__lldiv_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____rlim_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__wchar_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_attr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ino64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_long in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____off_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_barrier_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_quad_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ushort in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____quad_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__daddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____sigset_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____pid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int16_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint16_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ino_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____WAIT_STATUS in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____gid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_spinlock_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____clock_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ulong in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__clockid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int32_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____loff_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fd_mask in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__suseconds_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_rwlockattr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____caddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__clock_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_key_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____dev_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsblkcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_quad_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__uint in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__nlink_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_rwlock_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__loff_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__id_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_condattr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__t1 in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____rlim64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__dev_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__sigset_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____qaddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blksize_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__t4 in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__register_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____daddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_barrierattr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blkcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____key_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_int in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__S in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint8_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__time_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____useconds_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_mutex_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ino_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ldiv_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____swblk_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsfilcnt64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:33,789 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG8ee05578e [2018-04-11 13:12:33,792 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 13:12:33,793 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 13:12:33,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 13:12:33,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 13:12:33,797 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 13:12:33,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 01:12:33" (1/1) ... [2018-04-11 13:12:33,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69187220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:12:33, skipping insertion in model container [2018-04-11 13:12:33,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 01:12:33" (1/1) ... [2018-04-11 13:12:33,814 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 13:12:33,836 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 13:12:33,979 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 13:12:34,016 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 13:12:34,022 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-11 13:12:34,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:12:34 WrapperNode [2018-04-11 13:12:34,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 13:12:34,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 13:12:34,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 13:12:34,067 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 13:12:34,078 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:34" (1/1) ... [2018-04-11 13:12:34,079 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:34" (1/1) ... [2018-04-11 13:12:34,091 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:34" (1/1) ... [2018-04-11 13:12:34,092 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:34" (1/1) ... [2018-04-11 13:12:34,099 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:34" (1/1) ... [2018-04-11 13:12:34,105 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:34" (1/1) ... [2018-04-11 13:12:34,107 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:34" (1/1) ... [2018-04-11 13:12:34,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 13:12:34,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 13:12:34,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 13:12:34,112 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 13:12:34,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:12:34" (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:34,193 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 13:12:34,193 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 13:12:34,194 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-11 13:12:34,194 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-11 13:12:34,194 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 13:12:34,194 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 13:12:34,194 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 13:12:34,194 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 13:12:34,194 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 13:12:34,194 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 13:12:34,194 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 13:12:34,194 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 13:12:34,194 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 13:12:34,194 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 13:12:34,194 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 13:12:34,195 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 13:12:34,195 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 13:12:34,195 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 13:12:34,195 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 13:12:34,195 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 13:12:34,195 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 13:12:34,195 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 13:12:34,195 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 13:12:34,195 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 13:12:34,196 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 13:12:34,196 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 13:12:34,196 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 13:12:34,196 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 13:12:34,196 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 13:12:34,196 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 13:12:34,196 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 13:12:34,196 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 13:12:34,196 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 13:12:34,197 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 13:12:34,197 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 13:12:34,197 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 13:12:34,197 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 13:12:34,197 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 13:12:34,197 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 13:12:34,197 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 13:12:34,197 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 13:12:34,197 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 13:12:34,198 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 13:12:34,198 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 13:12:34,198 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 13:12:34,198 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 13:12:34,198 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 13:12:34,198 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 13:12:34,198 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 13:12:34,198 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 13:12:34,198 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 13:12:34,199 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 13:12:34,199 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 13:12:34,199 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 13:12:34,199 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 13:12:34,199 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 13:12:34,199 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 13:12:34,199 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 13:12:34,199 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 13:12:34,199 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 13:12:34,199 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 13:12:34,200 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 13:12:34,200 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 13:12:34,200 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 13:12:34,200 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 13:12:34,200 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 13:12:34,200 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 13:12:34,200 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 13:12:34,200 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 13:12:34,200 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 13:12:34,200 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 13:12:34,200 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 13:12:34,201 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 13:12:34,201 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 13:12:34,201 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 13:12:34,201 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 13:12:34,201 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 13:12:34,201 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 13:12:34,201 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 13:12:34,201 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 13:12:34,201 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 13:12:34,201 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 13:12:34,202 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 13:12:34,202 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 13:12:34,202 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 13:12:34,202 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 13:12:34,202 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 13:12:34,202 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 13:12:34,202 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 13:12:34,202 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 13:12:34,202 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 13:12:34,202 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 13:12:34,203 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 13:12:34,203 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 13:12:34,203 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 13:12:34,203 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 13:12:34,203 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 13:12:34,203 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 13:12:34,203 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 13:12:34,203 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 13:12:34,203 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 13:12:34,203 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 13:12:34,204 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 13:12:34,204 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 13:12:34,204 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 13:12:34,204 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 13:12:34,204 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 13:12:34,204 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 13:12:34,204 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-11 13:12:34,204 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 13:12:34,204 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 13:12:34,204 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 13:12:34,205 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-11 13:12:34,205 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 13:12:34,205 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 13:12:34,205 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 13:12:34,205 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 13:12:34,205 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 13:12:34,205 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 13:12:34,205 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 13:12:34,527 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 13:12:34,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 01:12:34 BoogieIcfgContainer [2018-04-11 13:12:34,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 13:12:34,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 13:12:34,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 13:12:34,531 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 13:12:34,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 01:12:33" (1/3) ... [2018-04-11 13:12:34,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac16802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 01:12:34, skipping insertion in model container [2018-04-11 13:12:34,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:12:34" (2/3) ... [2018-04-11 13:12:34,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac16802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 01:12:34, skipping insertion in model container [2018-04-11 13:12:34,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 01:12:34" (3/3) ... [2018-04-11 13:12:34,534 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.3_false-valid-memtrack.i [2018-04-11 13:12:34,541 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 13:12:34,546 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-04-11 13:12:34,575 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 13:12:34,576 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 13:12:34,576 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 13:12:34,576 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-11 13:12:34,576 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 13:12:34,576 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 13:12:34,576 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 13:12:34,576 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 13:12:34,576 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 13:12:34,577 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 13:12:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-04-11 13:12:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-11 13:12:34,594 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:34,595 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:34,595 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:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash 764612502, now seen corresponding path program 1 times [2018-04-11 13:12:34,628 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:34,672 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:34,703 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:34,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:34,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 13:12:34,707 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:34,707 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:34,708 INFO L182 omatonBuilderFactory]: Interpolants [81#true, 82#false] [2018-04-11 13:12:34,708 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:34,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-11 13:12:34,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-11 13:12:34,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 13:12:34,722 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-04-11 13:12:34,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:34,737 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-04-11 13:12:34,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-11 13:12:34,738 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-04-11 13:12:34,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:34,748 INFO L225 Difference]: With dead ends: 78 [2018-04-11 13:12:34,749 INFO L226 Difference]: Without dead ends: 75 [2018-04-11 13:12:34,750 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:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-11 13:12:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-11 13:12:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-11 13:12:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2018-04-11 13:12:34,777 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 9 [2018-04-11 13:12:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:34,778 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2018-04-11 13:12:34,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-11 13:12:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2018-04-11 13:12:34,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 13:12:34,778 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:34,778 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:34,779 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:34,779 INFO L82 PathProgramCache]: Analyzing trace with hash -2144181541, now seen corresponding path program 1 times [2018-04-11 13:12:34,780 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:34,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:12:34,818 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:34,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:34,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:12:34,819 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:34,819 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:34,819 INFO L182 omatonBuilderFactory]: Interpolants [236#true, 237#false, 238#|main_#t~short8|] [2018-04-11 13:12:34,820 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:34,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:12:34,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:12:34,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:12:34,821 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 3 states. [2018-04-11 13:12:34,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:34,836 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-04-11 13:12:34,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:12:34,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-11 13:12:34,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:34,837 INFO L225 Difference]: With dead ends: 76 [2018-04-11 13:12:34,837 INFO L226 Difference]: Without dead ends: 76 [2018-04-11 13:12:34,837 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:34,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-04-11 13:12:34,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-04-11 13:12:34,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-11 13:12:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2018-04-11 13:12:34,841 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 12 [2018-04-11 13:12:34,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:34,841 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2018-04-11 13:12:34,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:12:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2018-04-11 13:12:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 13:12:34,842 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:34,842 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:34,842 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:34,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2142334499, now seen corresponding path program 1 times [2018-04-11 13:12:34,843 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:34,857 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:34,913 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:34,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:34,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:12:34,914 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:34,914 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:34,914 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:34,914 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:34,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:12:34,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:12:34,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:12:34,914 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 3 states. [2018-04-11 13:12:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:34,934 INFO L93 Difference]: Finished difference Result 134 states and 169 transitions. [2018-04-11 13:12:34,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:12:34,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-11 13:12:34,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:34,935 INFO L225 Difference]: With dead ends: 134 [2018-04-11 13:12:34,935 INFO L226 Difference]: Without dead ends: 134 [2018-04-11 13:12:34,935 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:34,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-11 13:12:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2018-04-11 13:12:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 13:12:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2018-04-11 13:12:34,943 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 12 [2018-04-11 13:12:34,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:34,943 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2018-04-11 13:12:34,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:12:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2018-04-11 13:12:34,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 13:12:34,944 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:34,944 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:34,944 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:34,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1987861526, now seen corresponding path program 1 times [2018-04-11 13:12:34,945 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:34,952 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:34,967 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:34,967 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:34,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 13:12:34,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:34,967 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:34,967 INFO L182 omatonBuilderFactory]: Interpolants [644#true, 645#false, 646#(= |#valid| |old(#valid)|)] [2018-04-11 13:12:34,967 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:34,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:12:34,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:12:34,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:12:34,968 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. Second operand 3 states. [2018-04-11 13:12:35,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:35,012 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2018-04-11 13:12:35,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:12:35,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-04-11 13:12:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:35,013 INFO L225 Difference]: With dead ends: 151 [2018-04-11 13:12:35,013 INFO L226 Difference]: Without dead ends: 147 [2018-04-11 13:12:35,014 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:35,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-11 13:12:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2018-04-11 13:12:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-11 13:12:35,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 194 transitions. [2018-04-11 13:12:35,023 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 194 transitions. Word has length 13 [2018-04-11 13:12:35,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:35,023 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 194 transitions. [2018-04-11 13:12:35,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:12:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 194 transitions. [2018-04-11 13:12:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 13:12:35,024 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:35,024 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:35,024 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:35,024 INFO L82 PathProgramCache]: Analyzing trace with hash -990934181, now seen corresponding path program 1 times [2018-04-11 13:12:35,025 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:35,036 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:35,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:35,079 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:35,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:12:35,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:35,080 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:35,080 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:35,080 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:35,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:12:35,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:12:35,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:12:35,080 INFO L87 Difference]: Start difference. First operand 137 states and 194 transitions. Second operand 5 states. [2018-04-11 13:12:35,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:35,131 INFO L93 Difference]: Finished difference Result 259 states and 361 transitions. [2018-04-11 13:12:35,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:12:35,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 13:12:35,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:35,133 INFO L225 Difference]: With dead ends: 259 [2018-04-11 13:12:35,133 INFO L226 Difference]: Without dead ends: 259 [2018-04-11 13:12:35,133 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:35,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-04-11 13:12:35,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 228. [2018-04-11 13:12:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-11 13:12:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 340 transitions. [2018-04-11 13:12:35,147 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 340 transitions. Word has length 15 [2018-04-11 13:12:35,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:35,148 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 340 transitions. [2018-04-11 13:12:35,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:12:35,148 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 340 transitions. [2018-04-11 13:12:35,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 13:12:35,148 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:35,149 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:35,149 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:35,149 INFO L82 PathProgramCache]: Analyzing trace with hash -654467540, now seen corresponding path program 1 times [2018-04-11 13:12:35,150 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:35,159 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:35,183 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:35,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:35,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:12:35,183 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:35,184 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:35,184 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:35,184 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:35,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:12:35,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:12:35,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:12:35,184 INFO L87 Difference]: Start difference. First operand 228 states and 340 transitions. Second operand 4 states. [2018-04-11 13:12:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:35,263 INFO L93 Difference]: Finished difference Result 390 states and 573 transitions. [2018-04-11 13:12:35,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:12:35,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 13:12:35,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:35,266 INFO L225 Difference]: With dead ends: 390 [2018-04-11 13:12:35,266 INFO L226 Difference]: Without dead ends: 390 [2018-04-11 13:12:35,266 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:35,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-04-11 13:12:35,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 360. [2018-04-11 13:12:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-04-11 13:12:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 550 transitions. [2018-04-11 13:12:35,284 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 550 transitions. Word has length 16 [2018-04-11 13:12:35,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:35,285 INFO L459 AbstractCegarLoop]: Abstraction has 360 states and 550 transitions. [2018-04-11 13:12:35,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:12:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 550 transitions. [2018-04-11 13:12:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 13:12:35,286 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:35,286 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:35,286 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:35,286 INFO L82 PathProgramCache]: Analyzing trace with hash -654467539, now seen corresponding path program 1 times [2018-04-11 13:12:35,287 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:35,296 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:35,341 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:35,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:35,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:12:35,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:35,342 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:35,342 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:35,342 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:35,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:12:35,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:12:35,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:12:35,342 INFO L87 Difference]: Start difference. First operand 360 states and 550 transitions. Second operand 4 states. [2018-04-11 13:12:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:35,425 INFO L93 Difference]: Finished difference Result 489 states and 720 transitions. [2018-04-11 13:12:35,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:12:35,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 13:12:35,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:35,428 INFO L225 Difference]: With dead ends: 489 [2018-04-11 13:12:35,429 INFO L226 Difference]: Without dead ends: 489 [2018-04-11 13:12:35,429 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:35,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-04-11 13:12:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 462. [2018-04-11 13:12:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-04-11 13:12:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 698 transitions. [2018-04-11 13:12:35,443 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 698 transitions. Word has length 16 [2018-04-11 13:12:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:35,443 INFO L459 AbstractCegarLoop]: Abstraction has 462 states and 698 transitions. [2018-04-11 13:12:35,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:12:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 698 transitions. [2018-04-11 13:12:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 13:12:35,443 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:35,444 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:35,444 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:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2111148230, now seen corresponding path program 1 times [2018-04-11 13:12:35,445 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:35,452 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:35,477 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:35,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:35,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:12:35,478 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:35,478 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:35,478 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:35,479 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:35,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:12:35,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:12:35,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:12:35,479 INFO L87 Difference]: Start difference. First operand 462 states and 698 transitions. Second operand 5 states. [2018-04-11 13:12:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:35,511 INFO L93 Difference]: Finished difference Result 865 states and 1229 transitions. [2018-04-11 13:12:35,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:12:35,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-11 13:12:35,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:35,516 INFO L225 Difference]: With dead ends: 865 [2018-04-11 13:12:35,516 INFO L226 Difference]: Without dead ends: 865 [2018-04-11 13:12:35,516 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:35,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-04-11 13:12:35,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 830. [2018-04-11 13:12:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-04-11 13:12:35,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1198 transitions. [2018-04-11 13:12:35,536 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1198 transitions. Word has length 16 [2018-04-11 13:12:35,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:35,536 INFO L459 AbstractCegarLoop]: Abstraction has 830 states and 1198 transitions. [2018-04-11 13:12:35,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:12:35,537 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1198 transitions. [2018-04-11 13:12:35,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 13:12:35,537 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:35,537 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:35,538 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:35,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1464034702, now seen corresponding path program 1 times [2018-04-11 13:12:35,538 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:35,547 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:35,576 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:35,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:35,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 13:12:35,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:35,576 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:35,577 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:35,577 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:35,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:12:35,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:12:35,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:12:35,577 INFO L87 Difference]: Start difference. First operand 830 states and 1198 transitions. Second operand 6 states. [2018-04-11 13:12:35,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:35,653 INFO L93 Difference]: Finished difference Result 1293 states and 1813 transitions. [2018-04-11 13:12:35,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 13:12:35,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-11 13:12:35,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:35,660 INFO L225 Difference]: With dead ends: 1293 [2018-04-11 13:12:35,660 INFO L226 Difference]: Without dead ends: 1293 [2018-04-11 13:12:35,660 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:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2018-04-11 13:12:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1222. [2018-04-11 13:12:35,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-04-11 13:12:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1746 transitions. [2018-04-11 13:12:35,699 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1746 transitions. Word has length 26 [2018-04-11 13:12:35,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:35,699 INFO L459 AbstractCegarLoop]: Abstraction has 1222 states and 1746 transitions. [2018-04-11 13:12:35,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:12:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1746 transitions. [2018-04-11 13:12:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 13:12:35,701 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:35,701 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:35,701 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:35,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1396165131, now seen corresponding path program 1 times [2018-04-11 13:12:35,702 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:35,712 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:35,753 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:35,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:35,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:12:35,754 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:35,754 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:35,754 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:35,755 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:35,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:12:35,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:12:35,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:12:35,755 INFO L87 Difference]: Start difference. First operand 1222 states and 1746 transitions. Second operand 5 states. [2018-04-11 13:12:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:35,827 INFO L93 Difference]: Finished difference Result 1826 states and 2685 transitions. [2018-04-11 13:12:35,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:12:35,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-04-11 13:12:35,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:35,835 INFO L225 Difference]: With dead ends: 1826 [2018-04-11 13:12:35,835 INFO L226 Difference]: Without dead ends: 1826 [2018-04-11 13:12:35,835 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:35,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2018-04-11 13:12:35,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1804. [2018-04-11 13:12:35,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2018-04-11 13:12:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2673 transitions. [2018-04-11 13:12:35,885 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2673 transitions. Word has length 27 [2018-04-11 13:12:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:35,885 INFO L459 AbstractCegarLoop]: Abstraction has 1804 states and 2673 transitions. [2018-04-11 13:12:35,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:12:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2673 transitions. [2018-04-11 13:12:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 13:12:35,886 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:35,886 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:35,887 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:35,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1008277157, now seen corresponding path program 1 times [2018-04-11 13:12:35,887 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:35,899 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:36,003 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:36,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:36,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 13:12:36,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:36,004 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:36,004 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:36,004 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:36,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:12:36,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:12:36,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:12:36,005 INFO L87 Difference]: Start difference. First operand 1804 states and 2673 transitions. Second operand 7 states. [2018-04-11 13:12:36,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:36,281 INFO L93 Difference]: Finished difference Result 2122 states and 3004 transitions. [2018-04-11 13:12:36,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:36,281 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-04-11 13:12:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:36,291 INFO L225 Difference]: With dead ends: 2122 [2018-04-11 13:12:36,291 INFO L226 Difference]: Without dead ends: 2122 [2018-04-11 13:12:36,292 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:12:36,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-04-11 13:12:36,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2098. [2018-04-11 13:12:36,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-04-11 13:12:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2986 transitions. [2018-04-11 13:12:36,349 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2986 transitions. Word has length 31 [2018-04-11 13:12:36,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:36,349 INFO L459 AbstractCegarLoop]: Abstraction has 2098 states and 2986 transitions. [2018-04-11 13:12:36,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:12:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2986 transitions. [2018-04-11 13:12:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 13:12:36,350 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:36,351 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:36,351 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:36,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1466399373, now seen corresponding path program 1 times [2018-04-11 13:12:36,352 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:36,363 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:36,512 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:36,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:36,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:12:36,515 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:36,515 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:36,515 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:36,516 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:36,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:12:36,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:12:36,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:12:36,516 INFO L87 Difference]: Start difference. First operand 2098 states and 2986 transitions. Second operand 8 states. [2018-04-11 13:12:36,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:36,766 INFO L93 Difference]: Finished difference Result 3085 states and 4339 transitions. [2018-04-11 13:12:36,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:36,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-04-11 13:12:36,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:36,778 INFO L225 Difference]: With dead ends: 3085 [2018-04-11 13:12:36,779 INFO L226 Difference]: Without dead ends: 3085 [2018-04-11 13:12:36,779 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:36,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2018-04-11 13:12:36,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 2980. [2018-04-11 13:12:36,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2980 states. [2018-04-11 13:12:36,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 4240 transitions. [2018-04-11 13:12:36,860 INFO L78 Accepts]: Start accepts. Automaton has 2980 states and 4240 transitions. Word has length 31 [2018-04-11 13:12:36,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:36,861 INFO L459 AbstractCegarLoop]: Abstraction has 2980 states and 4240 transitions. [2018-04-11 13:12:36,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:12:36,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 4240 transitions. [2018-04-11 13:12:36,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 13:12:36,862 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:36,862 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:36,862 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:36,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1708388511, now seen corresponding path program 1 times [2018-04-11 13:12:36,863 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:36,874 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:37,000 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:37,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:37,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:12:37,001 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:37,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:12:37,001 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:37,001 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:37,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:12:37,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:12:37,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:12:37,002 INFO L87 Difference]: Start difference. First operand 2980 states and 4240 transitions. Second operand 8 states. [2018-04-11 13:12:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:37,284 INFO L93 Difference]: Finished difference Result 4961 states and 7003 transitions. [2018-04-11 13:12:37,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 13:12:37,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-11 13:12:37,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:37,322 INFO L225 Difference]: With dead ends: 4961 [2018-04-11 13:12:37,322 INFO L226 Difference]: Without dead ends: 4961 [2018-04-11 13:12:37,323 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:37,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4961 states. [2018-04-11 13:12:37,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4961 to 4888. [2018-04-11 13:12:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2018-04-11 13:12:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 6936 transitions. [2018-04-11 13:12:37,446 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 6936 transitions. Word has length 33 [2018-04-11 13:12:37,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:37,446 INFO L459 AbstractCegarLoop]: Abstraction has 4888 states and 6936 transitions. [2018-04-11 13:12:37,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:12:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 6936 transitions. [2018-04-11 13:12:37,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 13:12:37,447 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:37,447 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:37,447 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:37,447 INFO L82 PathProgramCache]: Analyzing trace with hash 460690199, now seen corresponding path program 1 times [2018-04-11 13:12:37,448 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:37,457 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:37,557 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:37,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:37,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 13:12:37,558 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:37,558 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:37,558 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:37,559 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:37,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:12:37,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:12:37,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:12:37,559 INFO L87 Difference]: Start difference. First operand 4888 states and 6936 transitions. Second operand 7 states. [2018-04-11 13:12:37,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:37,812 INFO L93 Difference]: Finished difference Result 6291 states and 8827 transitions. [2018-04-11 13:12:37,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 13:12:37,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-04-11 13:12:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:37,840 INFO L225 Difference]: With dead ends: 6291 [2018-04-11 13:12:37,840 INFO L226 Difference]: Without dead ends: 6291 [2018-04-11 13:12:37,840 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:37,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6291 states. [2018-04-11 13:12:37,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6291 to 6110. [2018-04-11 13:12:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6110 states. [2018-04-11 13:12:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6110 states to 6110 states and 8648 transitions. [2018-04-11 13:12:37,994 INFO L78 Accepts]: Start accepts. Automaton has 6110 states and 8648 transitions. Word has length 33 [2018-04-11 13:12:37,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:37,995 INFO L459 AbstractCegarLoop]: Abstraction has 6110 states and 8648 transitions. [2018-04-11 13:12:37,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:12:37,995 INFO L276 IsEmpty]: Start isEmpty. Operand 6110 states and 8648 transitions. [2018-04-11 13:12:37,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 13:12:37,996 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:37,996 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:37,996 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:37,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1776763504, now seen corresponding path program 1 times [2018-04-11 13:12:37,997 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:38,008 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:38,105 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:38,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:38,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:12:38,105 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:38,106 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:38,106 INFO L182 omatonBuilderFactory]: Interpolants [43633#true, 43634#false, 43635#(and (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.offset) (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base)), 43636#(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)|)), 43637#(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)|)), 43638#(and (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.base) (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.offset)), 43639#(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)|)), 43640#(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)|)))] [2018-04-11 13:12:38,106 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:38,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:12:38,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:12:38,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:12:38,106 INFO L87 Difference]: Start difference. First operand 6110 states and 8648 transitions. Second operand 8 states. [2018-04-11 13:12:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:38,481 INFO L93 Difference]: Finished difference Result 12523 states and 18442 transitions. [2018-04-11 13:12:38,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 13:12:38,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-04-11 13:12:38,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:38,521 INFO L225 Difference]: With dead ends: 12523 [2018-04-11 13:12:38,522 INFO L226 Difference]: Without dead ends: 12523 [2018-04-11 13:12:38,522 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:12:38,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12523 states. [2018-04-11 13:12:38,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12523 to 11602. [2018-04-11 13:12:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11602 states. [2018-04-11 13:12:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11602 states to 11602 states and 16466 transitions. [2018-04-11 13:12:38,718 INFO L78 Accepts]: Start accepts. Automaton has 11602 states and 16466 transitions. Word has length 38 [2018-04-11 13:12:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:38,718 INFO L459 AbstractCegarLoop]: Abstraction has 11602 states and 16466 transitions. [2018-04-11 13:12:38,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:12:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 11602 states and 16466 transitions. [2018-04-11 13:12:38,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 13:12:38,719 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:38,719 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:38,719 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:38,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1308524624, now seen corresponding path program 1 times [2018-04-11 13:12:38,720 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:38,728 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:38,767 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:38,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:38,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:12:38,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:38,768 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:38,768 INFO L182 omatonBuilderFactory]: Interpolants [67792#(<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 67785#true, 67787#(or (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 2)), 67786#false, 67789#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 67788#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 2), 67791#(or (<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 67790#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|)] [2018-04-11 13:12:38,768 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:38,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:12:38,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:12:38,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:12:38,769 INFO L87 Difference]: Start difference. First operand 11602 states and 16466 transitions. Second operand 8 states. [2018-04-11 13:12:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:39,049 INFO L93 Difference]: Finished difference Result 11825 states and 16827 transitions. [2018-04-11 13:12:39,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 13:12:39,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-04-11 13:12:39,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:39,075 INFO L225 Difference]: With dead ends: 11825 [2018-04-11 13:12:39,075 INFO L226 Difference]: Without dead ends: 11785 [2018-04-11 13:12:39,075 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:39,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11785 states. [2018-04-11 13:12:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11785 to 11562. [2018-04-11 13:12:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11562 states. [2018-04-11 13:12:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11562 states to 11562 states and 16406 transitions. [2018-04-11 13:12:39,309 INFO L78 Accepts]: Start accepts. Automaton has 11562 states and 16406 transitions. Word has length 42 [2018-04-11 13:12:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:39,310 INFO L459 AbstractCegarLoop]: Abstraction has 11562 states and 16406 transitions. [2018-04-11 13:12:39,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:12:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 11562 states and 16406 transitions. [2018-04-11 13:12:39,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 13:12:39,311 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:39,311 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:39,312 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:39,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1554312302, now seen corresponding path program 1 times [2018-04-11 13:12:39,312 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:39,323 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:39,455 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:39,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:39,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 13:12:39,456 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:39,456 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:39,456 INFO L182 omatonBuilderFactory]: Interpolants [91201#(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|)), 91200#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 91202#(and (<= 3 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|) (<= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| 3)), 91193#true, 91195#(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|))), 91194#false, 91197#(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))), 91196#(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)))), 91199#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 91198#(or (<= 4 ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 2))] [2018-04-11 13:12:39,457 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:39,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:12:39,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:12:39,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:12:39,457 INFO L87 Difference]: Start difference. First operand 11562 states and 16406 transitions. Second operand 10 states. [2018-04-11 13:12:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:39,807 INFO L93 Difference]: Finished difference Result 11418 states and 16086 transitions. [2018-04-11 13:12:39,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:39,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-04-11 13:12:39,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:39,838 INFO L225 Difference]: With dead ends: 11418 [2018-04-11 13:12:39,838 INFO L226 Difference]: Without dead ends: 11218 [2018-04-11 13:12:39,838 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:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11218 states. [2018-04-11 13:12:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11218 to 10974. [2018-04-11 13:12:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10974 states. [2018-04-11 13:12:40,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10974 states to 10974 states and 15484 transitions. [2018-04-11 13:12:40,020 INFO L78 Accepts]: Start accepts. Automaton has 10974 states and 15484 transitions. Word has length 45 [2018-04-11 13:12:40,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:40,020 INFO L459 AbstractCegarLoop]: Abstraction has 10974 states and 15484 transitions. [2018-04-11 13:12:40,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:12:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 10974 states and 15484 transitions. [2018-04-11 13:12:40,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 13:12:40,022 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:40,022 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 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:40,022 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:40,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1520630861, now seen corresponding path program 1 times [2018-04-11 13:12:40,023 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:40,030 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:40,150 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:40,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:40,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 13:12:40,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:40,150 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:40,151 INFO L182 omatonBuilderFactory]: Interpolants [113617#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0)|), 113616#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0), 113619#(and (<= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0)| 4) (<= 4 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0)|)), 113618#(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)|))), 113611#false, 113610#true, 113613#(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|), 113612#(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))), 113615#(or (<= 5 ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 3)), 113614#(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:40,151 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:40,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:12:40,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:12:40,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:12:40,151 INFO L87 Difference]: Start difference. First operand 10974 states and 15484 transitions. Second operand 10 states. [2018-04-11 13:12:40,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:40,519 INFO L93 Difference]: Finished difference Result 11072 states and 15526 transitions. [2018-04-11 13:12:40,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:40,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-04-11 13:12:40,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:40,540 INFO L225 Difference]: With dead ends: 11072 [2018-04-11 13:12:40,540 INFO L226 Difference]: Without dead ends: 10715 [2018-04-11 13:12:40,541 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:12:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10715 states. [2018-04-11 13:12:40,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10715 to 8878. [2018-04-11 13:12:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8878 states. [2018-04-11 13:12:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 12457 transitions. [2018-04-11 13:12:40,643 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 12457 transitions. Word has length 47 [2018-04-11 13:12:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:40,643 INFO L459 AbstractCegarLoop]: Abstraction has 8878 states and 12457 transitions. [2018-04-11 13:12:40,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:12:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 12457 transitions. [2018-04-11 13:12:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 13:12:40,645 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:40,645 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:40,645 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:40,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1413895777, now seen corresponding path program 1 times [2018-04-11 13:12:40,645 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:40,655 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:40,727 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:40,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:40,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:12:40,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:40,727 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:40,727 INFO L182 omatonBuilderFactory]: Interpolants [133587#true, 133590#(or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 3) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 133591#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 3), 133588#false, 133589#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)), 133594#(or (<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 133595#(<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 133592#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 133593#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|)] [2018-04-11 13:12:40,728 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:40,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:12:40,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:12:40,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:12:40,728 INFO L87 Difference]: Start difference. First operand 8878 states and 12457 transitions. Second operand 9 states. [2018-04-11 13:12:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:41,027 INFO L93 Difference]: Finished difference Result 8985 states and 12503 transitions. [2018-04-11 13:12:41,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:41,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-04-11 13:12:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:41,062 INFO L225 Difference]: With dead ends: 8985 [2018-04-11 13:12:41,062 INFO L226 Difference]: Without dead ends: 8985 [2018-04-11 13:12:41,062 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:12:41,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8985 states. [2018-04-11 13:12:41,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8985 to 8878. [2018-04-11 13:12:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8878 states. [2018-04-11 13:12:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 12389 transitions. [2018-04-11 13:12:41,246 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 12389 transitions. Word has length 54 [2018-04-11 13:12:41,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:41,247 INFO L459 AbstractCegarLoop]: Abstraction has 8878 states and 12389 transitions. [2018-04-11 13:12:41,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:12:41,247 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 12389 transitions. [2018-04-11 13:12:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 13:12:41,249 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:41,249 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:41,249 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:41,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1676288163, now seen corresponding path program 1 times [2018-04-11 13:12:41,250 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:41,263 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:41,322 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:41,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:41,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:12:41,323 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:41,323 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:41,323 INFO L182 omatonBuilderFactory]: Interpolants [151488#(<= 3 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 151482#false, 151483#(or (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 2)), 151481#true, 151486#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 151487#(or (<= 3 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 151484#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 2), 151485#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)] [2018-04-11 13:12:41,323 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:41,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:12:41,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:12:41,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:12:41,324 INFO L87 Difference]: Start difference. First operand 8878 states and 12389 transitions. Second operand 8 states. [2018-04-11 13:12:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:41,568 INFO L93 Difference]: Finished difference Result 8917 states and 12382 transitions. [2018-04-11 13:12:41,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:41,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-04-11 13:12:41,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:41,592 INFO L225 Difference]: With dead ends: 8917 [2018-04-11 13:12:41,593 INFO L226 Difference]: Without dead ends: 8777 [2018-04-11 13:12:41,593 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:41,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8777 states. [2018-04-11 13:12:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8777 to 8738. [2018-04-11 13:12:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8738 states. [2018-04-11 13:12:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8738 states to 8738 states and 12181 transitions. [2018-04-11 13:12:41,734 INFO L78 Accepts]: Start accepts. Automaton has 8738 states and 12181 transitions. Word has length 54 [2018-04-11 13:12:41,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:41,734 INFO L459 AbstractCegarLoop]: Abstraction has 8738 states and 12181 transitions. [2018-04-11 13:12:41,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:12:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 8738 states and 12181 transitions. [2018-04-11 13:12:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 13:12:41,736 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:41,736 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:41,736 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:41,736 INFO L82 PathProgramCache]: Analyzing trace with hash -249227344, now seen corresponding path program 1 times [2018-04-11 13:12:41,737 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:41,749 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:41,858 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:41,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:41,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:12:41,859 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:41,859 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:41,859 INFO L182 omatonBuilderFactory]: Interpolants [169168#(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|)), 169169#(and (<= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| 6) (<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|)), 169162#false, 169163#(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|))), 169161#true, 169166#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 169167#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 169164#(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|)))), 169165#(or (<= 7 ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 5))] [2018-04-11 13:12:41,859 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:41,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:12:41,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:12:41,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:12:41,860 INFO L87 Difference]: Start difference. First operand 8738 states and 12181 transitions. Second operand 9 states. [2018-04-11 13:12:42,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:42,233 INFO L93 Difference]: Finished difference Result 10618 states and 15106 transitions. [2018-04-11 13:12:42,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 13:12:42,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-04-11 13:12:42,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:42,269 INFO L225 Difference]: With dead ends: 10618 [2018-04-11 13:12:42,269 INFO L226 Difference]: Without dead ends: 10614 [2018-04-11 13:12:42,269 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:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10614 states. [2018-04-11 13:12:42,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10614 to 10479. [2018-04-11 13:12:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10479 states. [2018-04-11 13:12:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10479 states to 10479 states and 14958 transitions. [2018-04-11 13:12:42,475 INFO L78 Accepts]: Start accepts. Automaton has 10479 states and 14958 transitions. Word has length 58 [2018-04-11 13:12:42,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:42,475 INFO L459 AbstractCegarLoop]: Abstraction has 10479 states and 14958 transitions. [2018-04-11 13:12:42,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:12:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 10479 states and 14958 transitions. [2018-04-11 13:12:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 13:12:42,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:42,478 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:42,478 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:42,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1966165147, now seen corresponding path program 1 times [2018-04-11 13:12:42,479 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:42,492 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:42,634 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:42,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:42,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 13:12:42,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:42,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:42,635 INFO L182 omatonBuilderFactory]: Interpolants [190290#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 190291#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 190288#(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))), 190289#(or (<= 6 ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 4)), 190292#(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|)), 190293#(and (<= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| 5) (<= 5 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|)), 190286#(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))), 190287#(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)))), 190284#true, 190285#false] [2018-04-11 13:12:42,635 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:42,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:12:42,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:12:42,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:12:42,636 INFO L87 Difference]: Start difference. First operand 10479 states and 14958 transitions. Second operand 10 states. [2018-04-11 13:12:43,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:43,011 INFO L93 Difference]: Finished difference Result 4496 states and 6054 transitions. [2018-04-11 13:12:43,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:43,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-04-11 13:12:43,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:43,055 INFO L225 Difference]: With dead ends: 4496 [2018-04-11 13:12:43,055 INFO L226 Difference]: Without dead ends: 4435 [2018-04-11 13:12:43,055 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:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4435 states. [2018-04-11 13:12:43,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4435 to 4404. [2018-04-11 13:12:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4404 states. [2018-04-11 13:12:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 5951 transitions. [2018-04-11 13:12:43,124 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 5951 transitions. Word has length 60 [2018-04-11 13:12:43,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:43,124 INFO L459 AbstractCegarLoop]: Abstraction has 4404 states and 5951 transitions. [2018-04-11 13:12:43,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:12:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 5951 transitions. [2018-04-11 13:12:43,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 13:12:43,126 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:43,126 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 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:43,126 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:43,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1781242572, now seen corresponding path program 1 times [2018-04-11 13:12:43,127 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:43,140 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:43,211 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:43,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:43,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:12:43,212 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:43,212 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:43,212 INFO L182 omatonBuilderFactory]: Interpolants [199219#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 4), 199218#(or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 4) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 199217#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)), 199216#false, 199223#(<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 199222#(or (<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 199221#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 199220#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 199215#true] [2018-04-11 13:12:43,212 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:43,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:12:43,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:12:43,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:12:43,213 INFO L87 Difference]: Start difference. First operand 4404 states and 5951 transitions. Second operand 9 states. [2018-04-11 13:12:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:43,445 INFO L93 Difference]: Finished difference Result 4444 states and 5968 transitions. [2018-04-11 13:12:43,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:43,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2018-04-11 13:12:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:43,454 INFO L225 Difference]: With dead ends: 4444 [2018-04-11 13:12:43,454 INFO L226 Difference]: Without dead ends: 4410 [2018-04-11 13:12:43,454 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:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4410 states. [2018-04-11 13:12:43,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4410 to 4353. [2018-04-11 13:12:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4353 states. [2018-04-11 13:12:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4353 states to 4353 states and 5883 transitions. [2018-04-11 13:12:43,500 INFO L78 Accepts]: Start accepts. Automaton has 4353 states and 5883 transitions. Word has length 66 [2018-04-11 13:12:43,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:43,500 INFO L459 AbstractCegarLoop]: Abstraction has 4353 states and 5883 transitions. [2018-04-11 13:12:43,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:12:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 4353 states and 5883 transitions. [2018-04-11 13:12:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 13:12:43,501 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:43,502 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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:43,502 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:43,502 INFO L82 PathProgramCache]: Analyzing trace with hash 573456714, now seen corresponding path program 1 times [2018-04-11 13:12:43,503 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:43,514 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:43,575 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:43,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:43,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:12:43,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:43,576 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:43,576 INFO L182 omatonBuilderFactory]: Interpolants [208051#(<= 4 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 208050#(or (<= 4 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 208049#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 208048#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 208043#true, 208047#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 3), 208046#(or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 3) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 208045#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)), 208044#false] [2018-04-11 13:12:43,576 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:43,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:12:43,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:12:43,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:12:43,577 INFO L87 Difference]: Start difference. First operand 4353 states and 5883 transitions. Second operand 9 states. [2018-04-11 13:12:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:43,836 INFO L93 Difference]: Finished difference Result 4410 states and 5883 transitions. [2018-04-11 13:12:43,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:43,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-04-11 13:12:43,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:43,846 INFO L225 Difference]: With dead ends: 4410 [2018-04-11 13:12:43,846 INFO L226 Difference]: Without dead ends: 4410 [2018-04-11 13:12:43,846 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:43,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4410 states. [2018-04-11 13:12:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4410 to 4353. [2018-04-11 13:12:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4353 states. [2018-04-11 13:12:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4353 states to 4353 states and 5832 transitions. [2018-04-11 13:12:43,902 INFO L78 Accepts]: Start accepts. Automaton has 4353 states and 5832 transitions. Word has length 68 [2018-04-11 13:12:43,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:43,902 INFO L459 AbstractCegarLoop]: Abstraction has 4353 states and 5832 transitions. [2018-04-11 13:12:43,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:12:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 4353 states and 5832 transitions. [2018-04-11 13:12:43,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-11 13:12:43,904 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:43,904 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 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:43,904 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:43,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1585963081, now seen corresponding path program 1 times [2018-04-11 13:12:43,904 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:43,917 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:43,968 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:43,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:43,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:12:43,968 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:43,968 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:43,969 INFO L182 omatonBuilderFactory]: Interpolants [216839#(or (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|) (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 5)), 216838#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)), 216837#false, 216836#true, 216843#(or (<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 216842#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 216841#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 216840#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 5), 216844#(<= 6 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|)] [2018-04-11 13:12:43,969 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:43,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:12:43,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:12:43,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:12:43,969 INFO L87 Difference]: Start difference. First operand 4353 states and 5832 transitions. Second operand 9 states. [2018-04-11 13:12:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:44,183 INFO L93 Difference]: Finished difference Result 4289 states and 5713 transitions. [2018-04-11 13:12:44,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:44,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-04-11 13:12:44,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:44,190 INFO L225 Difference]: With dead ends: 4289 [2018-04-11 13:12:44,191 INFO L226 Difference]: Without dead ends: 4285 [2018-04-11 13:12:44,191 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:44,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4285 states. [2018-04-11 13:12:44,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4285 to 4243. [2018-04-11 13:12:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4243 states. [2018-04-11 13:12:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4243 states to 4243 states and 5673 transitions. [2018-04-11 13:12:44,235 INFO L78 Accepts]: Start accepts. Automaton has 4243 states and 5673 transitions. Word has length 80 [2018-04-11 13:12:44,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:44,236 INFO L459 AbstractCegarLoop]: Abstraction has 4243 states and 5673 transitions. [2018-04-11 13:12:44,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:12:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 4243 states and 5673 transitions. [2018-04-11 13:12:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-11 13:12:44,237 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:44,237 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 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] [2018-04-11 13:12:44,237 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:44,237 INFO L82 PathProgramCache]: Analyzing trace with hash -264096039, now seen corresponding path program 1 times [2018-04-11 13:12:44,238 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:44,248 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:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 40 proven. 59 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-04-11 13:12:44,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:44,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:12:44,310 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 13:12:44,310 INFO L182 omatonBuilderFactory]: Interpolants [225399#true, 225403#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.base)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.base), 225402#(not (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.base)), 225401#(not (= 0 |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~malloc2.base|)), 225400#false, 225407#|main_#t~short8|, 225406#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base), 225405#(not (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base)), 225404#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.base)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base)] [2018-04-11 13:12:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 40 proven. 59 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-04-11 13:12:44,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:12:44,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:12:44,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:12:44,311 INFO L87 Difference]: Start difference. First operand 4243 states and 5673 transitions. Second operand 9 states. [2018-04-11 13:12:44,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:44,615 INFO L93 Difference]: Finished difference Result 7890 states and 10658 transitions. [2018-04-11 13:12:44,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 13:12:44,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-04-11 13:12:44,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:44,634 INFO L225 Difference]: With dead ends: 7890 [2018-04-11 13:12:44,634 INFO L226 Difference]: Without dead ends: 7890 [2018-04-11 13:12:44,635 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:12:44,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7890 states. [2018-04-11 13:12:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7890 to 7876. [2018-04-11 13:12:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7876 states. [2018-04-11 13:12:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7876 states to 7876 states and 10650 transitions. [2018-04-11 13:12:44,745 INFO L78 Accepts]: Start accepts. Automaton has 7876 states and 10650 transitions. Word has length 81 [2018-04-11 13:12:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:44,746 INFO L459 AbstractCegarLoop]: Abstraction has 7876 states and 10650 transitions. [2018-04-11 13:12:44,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:12:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 7876 states and 10650 transitions. [2018-04-11 13:12:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-04-11 13:12:44,748 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:44,748 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:44,748 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:44,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2088101202, now seen corresponding path program 1 times [2018-04-11 13:12:44,749 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:44,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:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-04-11 13:12:44,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:44,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 13:12:44,856 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 13:12:44,856 INFO L182 omatonBuilderFactory]: Interpolants [241219#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.base), 241218#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base), 241217#(= 1 (select |#valid| ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base)), 241216#(and (= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.base)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base) (= |#valid| |old(#valid)|)), 241221#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.base)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.base), 241220#(= 1 (select |#valid| ~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.base)), 241211#true, 241215#(and (= |#valid| |old(#valid)|) (= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.base)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.base)), 241214#(= 1 (select |#valid| ~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.base)), 241213#(= 1 (select |#valid| |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~malloc2.base|)), 241212#false] [2018-04-11 13:12:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-04-11 13:12:44,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 13:12:44,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 13:12:44,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:12:44,857 INFO L87 Difference]: Start difference. First operand 7876 states and 10650 transitions. Second operand 11 states. [2018-04-11 13:12:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:45,964 INFO L93 Difference]: Finished difference Result 14595 states and 19936 transitions. [2018-04-11 13:12:45,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 13:12:45,964 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2018-04-11 13:12:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:45,987 INFO L225 Difference]: With dead ends: 14595 [2018-04-11 13:12:45,987 INFO L226 Difference]: Without dead ends: 14451 [2018-04-11 13:12:45,987 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=282, Invalid=1278, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 13:12:45,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14451 states. [2018-04-11 13:12:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14451 to 13736. [2018-04-11 13:12:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13736 states. [2018-04-11 13:12:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13736 states to 13736 states and 18734 transitions. [2018-04-11 13:12:46,116 INFO L78 Accepts]: Start accepts. Automaton has 13736 states and 18734 transitions. Word has length 91 [2018-04-11 13:12:46,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:46,116 INFO L459 AbstractCegarLoop]: Abstraction has 13736 states and 18734 transitions. [2018-04-11 13:12:46,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 13:12:46,116 INFO L276 IsEmpty]: Start isEmpty. Operand 13736 states and 18734 transitions. [2018-04-11 13:12:46,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-04-11 13:12:46,117 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:46,117 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:46,118 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:46,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2088101201, now seen corresponding path program 1 times [2018-04-11 13:12:46,118 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:46,128 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:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 100 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-04-11 13:12:46,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:46,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:12:46,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:46,185 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:46,185 INFO L182 omatonBuilderFactory]: Interpolants [269632#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 269633#(or (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|) (<= 5 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|)), 269634#(<= 5 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)|), 269628#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~post0| 1)), 269629#(or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 4) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__push_#t~switch1|)), 269630#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0 4), 269631#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0), 269626#true, 269627#false] [2018-04-11 13:12:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 100 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-04-11 13:12:46,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:12:46,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:12:46,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:12:46,186 INFO L87 Difference]: Start difference. First operand 13736 states and 18734 transitions. Second operand 9 states. [2018-04-11 13:12:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:46,440 INFO L93 Difference]: Finished difference Result 13815 states and 18694 transitions. [2018-04-11 13:12:46,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:12:46,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2018-04-11 13:12:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:46,462 INFO L225 Difference]: With dead ends: 13815 [2018-04-11 13:12:46,463 INFO L226 Difference]: Without dead ends: 13584 [2018-04-11 13:12:46,463 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 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:46,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13584 states. [2018-04-11 13:12:46,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13584 to 13448. [2018-04-11 13:12:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13448 states. [2018-04-11 13:12:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13448 states to 13448 states and 18305 transitions. [2018-04-11 13:12:46,579 INFO L78 Accepts]: Start accepts. Automaton has 13448 states and 18305 transitions. Word has length 91 [2018-04-11 13:12:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:46,579 INFO L459 AbstractCegarLoop]: Abstraction has 13448 states and 18305 transitions. [2018-04-11 13:12:46,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:12:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 13448 states and 18305 transitions. [2018-04-11 13:12:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-04-11 13:12:46,580 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:46,580 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:46,580 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__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:46,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1692834780, now seen corresponding path program 1 times [2018-04-11 13:12:46,581 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:46,598 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:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 47 proven. 95 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-04-11 13:12:47,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:47,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 13:12:47,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 13:12:47,045 INFO L182 omatonBuilderFactory]: Interpolants [296928#(and (= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.offset)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.offset) (= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.base)), 296929#(and (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.offset) (= 8 (select |#length| ~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.base))), 296930#(and (= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.base)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.base) (= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.offset)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__t4~0.offset)), 296924#(and (= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.offset)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.offset) (= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.base)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.base) (= |old(#length)| |#length|)), 296925#(and (= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.base)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base) (= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.offset)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.offset) (= |old(#length)| |#length|)), 296926#(and (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.offset) (= 8 (select |#length| ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base))), 296927#(and (= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.offset)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.offset) (= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base)), 296920#true, 296921#false, 296922#(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|))), 296923#(and (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.offset) (= 8 (select |#length| ~__U_MULTI_flockfree_____false_valid_memtrack_i__x1~0.base)))] [2018-04-11 13:12:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 47 proven. 95 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-04-11 13:12:47,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 13:12:47,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 13:12:47,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:12:47,046 INFO L87 Difference]: Start difference. First operand 13448 states and 18305 transitions. Second operand 11 states. [2018-04-11 13:12:48,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:48,528 INFO L93 Difference]: Finished difference Result 20660 states and 28223 transitions. [2018-04-11 13:12:48,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 13:12:48,585 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2018-04-11 13:12:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:48,619 INFO L225 Difference]: With dead ends: 20660 [2018-04-11 13:12:48,619 INFO L226 Difference]: Without dead ends: 20660 [2018-04-11 13:12:48,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=282, Invalid=1278, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 13:12:48,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20660 states. [2018-04-11 13:12:48,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20660 to 19972. [2018-04-11 13:12:48,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19972 states. [2018-04-11 13:12:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19972 states to 19972 states and 27219 transitions. [2018-04-11 13:12:48,803 INFO L78 Accepts]: Start accepts. Automaton has 19972 states and 27219 transitions. Word has length 105 [2018-04-11 13:12:48,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:48,803 INFO L459 AbstractCegarLoop]: Abstraction has 19972 states and 27219 transitions. [2018-04-11 13:12:48,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 13:12:48,803 INFO L276 IsEmpty]: Start isEmpty. Operand 19972 states and 27219 transitions. [2018-04-11 13:12:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-04-11 13:12:48,806 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:48,806 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:48,806 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__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:48,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1197327800, now seen corresponding path program 1 times [2018-04-11 13:12:48,806 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:48,819 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:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 86 proven. 4 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-04-11 13:12:48,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:12:48,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:12:48,892 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 13:12:48,893 INFO L182 omatonBuilderFactory]: Interpolants [337637#false, 337636#true, 337639#(or (<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 3) (not |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~switch4|)), 337638#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 (+ |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| 1)), 337644#(<= 4 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0)|), 337641#(= |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0)| ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0), 337640#(<= ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0 3), 337643#(or (not |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~switch4|) (<= 4 |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0)|)), 337642#(= |__U_MULTI_flockfree_____false_valid_memtrack_i__pop_#t~post3| |old(~__U_MULTI_flockfree_____false_valid_memtrack_i__pc4~0)|)] [2018-04-11 13:12:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 86 proven. 4 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-04-11 13:12:48,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:12:48,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:12:48,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:12:48,894 INFO L87 Difference]: Start difference. First operand 19972 states and 27219 transitions. Second operand 9 states. [2018-04-11 13:12:49,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:49,098 INFO L93 Difference]: Finished difference Result 19186 states and 25852 transitions. [2018-04-11 13:12:49,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 13:12:49,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2018-04-11 13:12:49,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:49,127 INFO L225 Difference]: With dead ends: 19186 [2018-04-11 13:12:49,127 INFO L226 Difference]: Without dead ends: 18592 [2018-04-11 13:12:49,128 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:12:49,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18592 states. [2018-04-11 13:12:49,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18592 to 17960. [2018-04-11 13:12:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17960 states. [2018-04-11 13:12:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17960 states to 17960 states and 24171 transitions. [2018-04-11 13:12:49,371 INFO L78 Accepts]: Start accepts. Automaton has 17960 states and 24171 transitions. Word has length 131 [2018-04-11 13:12:49,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:49,372 INFO L459 AbstractCegarLoop]: Abstraction has 17960 states and 24171 transitions. [2018-04-11 13:12:49,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:12:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 17960 states and 24171 transitions. [2018-04-11 13:12:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-04-11 13:12:49,376 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:49,376 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:49,377 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__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:49,377 INFO L82 PathProgramCache]: Analyzing trace with hash -269588793, now seen corresponding path program 1 times [2018-04-11 13:12:49,377 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:12:49,391 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:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-04-11 13:12:49,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:12:49,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:12:49,476 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:12:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 13:12:49,477 INFO L182 omatonBuilderFactory]: Interpolants [374820#(not |main_#t~short8|), 374817#false, 374816#true, 374819#(and (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.offset) (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base) (= 1 ~__U_MULTI_flockfree_____false_valid_memtrack_i__pc1~0)), 374818#(and (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.offset) (= 0 ~__U_MULTI_flockfree_____false_valid_memtrack_i__S~0.base) (= ~__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))] [2018-04-11 13:12:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-04-11 13:12:49,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:12:49,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:12:49,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:12:49,477 INFO L87 Difference]: Start difference. First operand 17960 states and 24171 transitions. Second operand 5 states. [2018-04-11 13:12:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:12:49,554 INFO L93 Difference]: Finished difference Result 17960 states and 24168 transitions. [2018-04-11 13:12:49,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:12:49,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2018-04-11 13:12:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:12:49,589 INFO L225 Difference]: With dead ends: 17960 [2018-04-11 13:12:49,589 INFO L226 Difference]: Without dead ends: 17960 [2018-04-11 13:12:49,589 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:12:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17960 states. [2018-04-11 13:12:49,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17960 to 17960. [2018-04-11 13:12:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17960 states. [2018-04-11 13:12:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17960 states to 17960 states and 24168 transitions. [2018-04-11 13:12:49,759 INFO L78 Accepts]: Start accepts. Automaton has 17960 states and 24168 transitions. Word has length 145 [2018-04-11 13:12:49,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:12:49,759 INFO L459 AbstractCegarLoop]: Abstraction has 17960 states and 24168 transitions. [2018-04-11 13:12:49,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:12:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 17960 states and 24168 transitions. [2018-04-11 13:12:49,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-04-11 13:12:49,763 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:12:49,763 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 9, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:12:49,763 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__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:49,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1889495301, now seen corresponding path program 2 times [2018-04-11 13:12:49,764 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:12:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 13:12:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 13:12:49,830 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-11 13:12:49,883 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-04-11 13:12:49,891 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:49,892 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:49,893 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:49,893 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:49,894 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:49,895 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:49,897 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:49,898 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:49,899 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:49,899 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:49,901 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:49,902 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:49,902 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:49,903 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:49,905 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:49,905 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:49,906 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:49,906 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:49,907 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:49,907 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:49,909 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:49,909 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:49,910 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:49,910 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:49,910 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:49,911 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:49,911 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:49,912 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:49,912 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:49,912 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:49,913 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:49,913 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:49,913 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:49,913 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:49,914 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 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:49,914 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 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:49,915 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 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:49,915 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 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:49,916 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 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:49,916 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 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:49,916 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 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:49,917 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 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:49,917 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 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:49,917 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 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:49,918 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 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:49,919 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 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:49,919 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 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:49,920 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 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:49,920 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 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:49,920 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 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:49,921 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 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:49,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 01:12:49 BoogieIcfgContainer [2018-04-11 13:12:49,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 13:12:49,936 INFO L168 Benchmark]: Toolchain (without parser) took 16143.76 ms. Allocated memory was 399.5 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 332.3 MB in the beginning and 838.1 MB in the end (delta: -505.8 MB). Peak memory consumption was 563.7 MB. Max. memory is 5.3 GB. [2018-04-11 13:12:49,937 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 399.5 MB. Free memory is still 359.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 13:12:49,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.73 ms. Allocated memory is still 399.5 MB. Free memory was 332.3 MB in the beginning and 306.5 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 5.3 GB. [2018-04-11 13:12:49,938 INFO L168 Benchmark]: Boogie Preprocessor took 44.92 ms. Allocated memory is still 399.5 MB. Free memory was 306.5 MB in the beginning and 302.5 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:49,938 INFO L168 Benchmark]: RCFGBuilder took 416.02 ms. Allocated memory was 399.5 MB in the beginning and 606.1 MB in the end (delta: 206.6 MB). Free memory was 302.5 MB in the beginning and 532.8 MB in the end (delta: -230.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. [2018-04-11 13:12:49,938 INFO L168 Benchmark]: TraceAbstraction took 15407.32 ms. Allocated memory was 606.1 MB in the beginning and 1.5 GB in the end (delta: 863.0 MB). Free memory was 532.8 MB in the beginning and 838.1 MB in the end (delta: -305.3 MB). Peak memory consumption was 557.7 MB. Max. memory is 5.3 GB. [2018-04-11 13:12:49,940 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 399.5 MB. Free memory is still 359.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 272.73 ms. Allocated memory is still 399.5 MB. Free memory was 332.3 MB in the beginning and 306.5 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.92 ms. Allocated memory is still 399.5 MB. Free memory was 306.5 MB in the beginning and 302.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 416.02 ms. Allocated memory was 399.5 MB in the beginning and 606.1 MB in the end (delta: 206.6 MB). Free memory was 302.5 MB in the beginning and 532.8 MB in the end (delta: -230.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 15407.32 ms. Allocated memory was 606.1 MB in the beginning and 1.5 GB in the end (delta: 863.0 MB). Free memory was 532.8 MB in the beginning and 838.1 MB in the end (delta: -305.3 MB). Peak memory consumption was 557.7 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 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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~switch4 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)=13, \old(t4)=18, \old(x1)=20, \old(x1)=14, \old(x4)=11, \old(x4)=21, 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] S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L690] S || 1 != pc1 || __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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] S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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)=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}] [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] S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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)=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}] [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)=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}] [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] S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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)=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}] [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)=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}] [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)=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}] [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)=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}] [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)=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}] [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] S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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)=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}] [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)=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}] [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)=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}] [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)=0, \old(x1)=10, \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] S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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)=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}] [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)=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}] [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)=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=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)=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}] [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] S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \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)=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}] [L663] pc4++ [L663] pc4++ [L664] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \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)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, pc4++=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L664] COND TRUE case 1: [L665] RET t4 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \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)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, pc4++=1, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L694] pop() 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=2, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() 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=2, res4=0, S={10:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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=2, res4=0, S={10:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=10, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L663] pc4++ [L663] pc4++ [L664] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L664] COND FALSE !(case 1:) [L667] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L667] COND TRUE case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L668] COND FALSE, RET !(t4 == ((void *)0)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=10, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L694] pop() 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=3, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() 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=3, res4=0, S={10:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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=3, res4=0, S={10:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=10, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L663] pc4++ [L663] pc4++ [L664] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=10, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L664] COND FALSE !(case 1:) [L667] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=10, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L667] COND FALSE !(case 2:) [L671] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=10, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L671] COND TRUE case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L672] EXPR, FCALL t4->next VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={10:0}, t1={0:0}, t4={10:0}, t4->next={0:0}, x1={10:0}, x4={0:0}] [L672] RET x4 = t4->next [L694] pop() 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=4, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() 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=4, res4=0, S={10:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() 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=4, res4=0, S={10:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L663] pc4++ [L663] pc4++ [L664] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L664] COND FALSE !(case 1:) [L667] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L667] COND FALSE !(case 2:) [L671] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L671] COND FALSE !(case 3:) [L674] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L674] COND TRUE case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={10:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L675] COND TRUE S == t4 [L676] RET S = x4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=10, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L694] pop() 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=5, res4=0, S={0:0}, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() 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=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L690] S || 1 != pc1 || __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={10:0}, x1={10:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc1 || __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=5, res4=0, S={0:0}, t1={0:0}, t4={10: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=5, 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, 15.3s OverallTime, 32 OverallIterations, 11 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3194 SDtfs, 5544 SDslu, 6899 SDs, 0 SdLazy, 7957 SolverSat, 1069 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 550 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1331 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19972occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1683/2029 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 6505 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1691 NumberOfCodeBlocks, 1691 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1515 ConstructedInterpolants, 0 QuantifiedInterpolants, 336608 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 10 PerfectInterpolantSequences, 1683/2029 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.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_13-12-49-947.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_13-12-49-947.csv Received shutdown request...